2011
DOI: 10.1007/978-3-642-17679-1_10
|View full text |Cite
|
Sign up to set email alerts
|

Locality-Conscious Lock-Free Linked Lists

Abstract: We extend state-of-the-art lock-free linked lists by building linked lists with special care for locality of traversals. These linked lists are built of sequences of entries that reside on consecutive chunks of memory. When traversing such lists, subsequent entries typically reside on the same chunk and are thus close to each other, e.g., in same cache line or on the same virtual memory page. Such cache-conscious implementations of linked lists are frequently used in practice, but making them lock-free require… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2013
2013
2018
2018

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 16 publications
(6 citation statements)
references
References 11 publications
0
6
0
Order By: Relevance
“…In brief, each thread has a timestamp which tracks its activity, and an anchor pointer, which records a new reference only once every several node accesses. To recover from a thread crash, a complex technique called freezing [3] is used, in which threads co-operate to replace part of the data structure, restoring their ability to free memory. The key to performance is that the expensive anchor and freezing operations are used rarely, and do not affect the "fast path" of the construction.…”
Section: Related Workmentioning
confidence: 99%
“…In brief, each thread has a timestamp which tracks its activity, and an anchor pointer, which records a new reference only once every several node accesses. To recover from a thread crash, a complex technique called freezing [3] is used, in which threads co-operate to replace part of the data structure, restoring their ability to free memory. The key to performance is that the expensive anchor and freezing operations are used rarely, and do not affect the "fast path" of the construction.…”
Section: Related Workmentioning
confidence: 99%
“…The freezing idea was previously used in the context of concurrent data structures by Braginsky and Petrank in their recent work on chunk-based linked lists [3]. There, list nodes are grouped into chunks for better cache locality and list traversal performance.…”
Section: Related Workmentioning
confidence: 99%
“…There, list nodes are grouped into chunks for better cache locality and list traversal performance. The freezing technique is used in [3] for list restructuring to notify threads that the part of the data structure they are currently using is obsolete. This is done by setting a special freeze-bit on pointers belonging to nodes in the obsolete part, making the pointers/nodes unsuitable for traversing.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations