| | |
Summary: Built-in Coloring
for Highly-Concurrent
Doubly-Linked Lists
Hagit Attiya and Eshcar Hillel
Computer Science Department
Technion
Built-in Coloring for Doubly-Linked Lists 2
Concurrent Data Structures
At the core of many distributed applications
E.g., doubly-linked lists are used as queues
Lock-based implementations
Deadlock when locking in a different order
Blocking when processes are slow or fail
Do not scale
Lock-free implementations, esp., nonblocking
Often complex and hard to get right
Built-in Coloring for Doubly-Linked Lists 3
Methodology for
specific
data structures
|
