.png){kind=icon}
.png){kind=icon}
Return
Practical concurrent unrolled linked lists using lazy synchronization
.png){kind=icon}
OA
AI
DOI：10.1016/j.jpdc.2019.11.005.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Linked lists and other list-based sets are some of the most ubiquitous data structures in computer science. They are useful in their own right and are frequently used as building blocks in other data structures. A linked list can be unrolled to combine multiple keys in each node; this improves storage density and overall performance. This organization also allows an operation to skip over nodes which cannot contain a key of interest. This work introduces a new high-performance concurrent unrolled linked list with a lazy synchronization strategy. Most write operations under this strategy can complete by locking a single node. Experiments show up to 300% improvement over other concurrent list-based sets. (C) 2019 Published by Elsevier Inc.
Keywords:
Concurrent data structures
Lazy synchronization
Linked lists
Unrolling
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K