PierreLaborde-SplitOrderedLists

PierreLaborde-SplitOrderedLists - 1 Split-Ordered Lists:...

Info iconThis preview shows pages 1–16. Sign up to view the full content.

View Full Document Right Arrow Icon
Split-Ordered Lists: Lock-Free Extensible Hash Tables Pierre LaBorde 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Nir Shavit Tel-Aviv University, Israel Ph.D. from Hebrew University Professor at School of Computer Science at Tel-Aviv University in 1992. 2004 Gödel Prize Winner The Art of Multiprocessor Programming 2
Background image of page 2
Outline Hashing Concurrency Algorithm Implementation Performance 3
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Hash Table Map keys to values Map each possible key to a unique slot index Hash collisions are normal Constant average cost per operation Efficient 4
Background image of page 4
Name Phone Number Hash Table 5
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Collision Resolution Bucket Chains sorted by the key field Disadvantages of linked lists Next pointer overhead Processor Cache 6
Background image of page 6
Chained Hashing 7
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Extensible Hash Table Treats a hash as a bit string Soft real-time Array of buckets Only increase in size 8
Background image of page 8
Outline Hashing Concurrency Algorithm Implementation Performance 9
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Concurrent Hash Table Operations Insert Delete Find Ability to synchronize 10
Background image of page 10
Synchronization Critical section Race condition Locking Mutex 11
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Lock-Free At least one thread will progress Wait-freedom General design problems Long delays Waiting for locks 12
Background image of page 12
Difficulty Synchronization problems Deadlock Livelock Starvation Priority Inversion 13
Background image of page 13

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Avoiding Locks CAS LL/SC Single-word Hardware locks Fine-granularity 14
Background image of page 14
Resizing Problem Requires moving items Atomic Other options Helping 15
Background image of page 15

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 16
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 56

PierreLaborde-SplitOrderedLists - 1 Split-Ordered Lists:...

This preview shows document pages 1 - 16. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online