Highly-Concurrent Doubly-Linked Lists

Details Highly-Concurrent Doubly-Linked Lists Highly-Concurrent Doubly-Linked Lists

2011-12-06

arxiv.org/abs/1112.1141v1

Computer Science

Data Structures and Algorithms

Scientific paper

As file systems are increasingly being deployed on ever larger systems with many cores and multi-gigabytes of memory, scaling the internal data structures of file systems has taken greater importance and urgency. A doubly-linked list is a simple and very commonly used data structure in file systems but it is not very friendly to multi-threaded use. While special cases of lists, such as queues and stacks, have lock-free versions that scale reasonably well, the general form of a doubly-linked list offers no such solution. Using a mutex to serialize all operations remains the de-facto method of maintaining a doubly linked list. This severely limits the scalability of the list and developers must resort to ad-hoc workarounds that involve using multiple smaller lists (with individual locks) and deal with the resulting complexity of the system. In this paper, we present an approach to building highly concurrent data structures, with special focus on the implementation of highly concurrent doubly-linked lists. Dubbed "advanced doubly-linked list" or "adlist" for short, our list allows iteration in any direction, and insert/delete operations over non-overlapping nodes to execute in parallel. Operations with common nodes get serialized so as to always present a locally consistent view to the callers. An adlist node needs an additional 8 bytes of space for keeping synchronization information. The Data Domain File System makes extensive use of adlists which has allowed for significant scaling of the system without sacrificing simplicity.

Affiliated with

Also associated with

No associations

Rating

Highly-Concurrent Doubly-Linked Lists does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Highly-Concurrent Doubly-Linked Lists, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Highly-Concurrent Doubly-Linked Lists will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-380163