Locality-conscious lock-free linked lists

24Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.
Get full text

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 requires care. The basic component of this construction is a chunk of entries in the list that maintains a minimum and a maximum number of entries. This basic chunk component is an interesting tool on its own and may be used to build other lock-free data structures as well. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Braginsky, A., & Petrank, E. (2011). Locality-conscious lock-free linked lists. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6522 LNCS, pp. 107–118). https://doi.org/10.1007/978-3-642-17679-1_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free