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.

链接列表和其他基于列表的集合是计算机科学中最普遍使用的数据结构。它们本身就很有用，并经常用作其他数据结构的构建块。链表可以“展开”以在每个节点中组合多个键；这提高了存储密度和整体性能。该组织还允许操作跳过不能包含感兴趣密钥的节点。这项工作介绍了一种具有懒惰同步策略的新型高性能并发展开链表。这种策略下的大多数写操作都可以通过锁定单个节点来完成。实验显示，与其他基于列表的并发集合相比，改进幅度高达300％。