Hemlock : Compact and Scalable Mutual Exclusion

7 Feb 2021  ·  Dave Dice, Alex Kogan ·

We present Hemlock, a novel mutual exclusion locking algorithm that is extremely compact, requiring just one word per thread plus one word per lock, but which still provides local spinning in most circumstances, high throughput under contention, and low latency in the uncontended case. Hemlock is context-free -- not requiring any information to be passed from a lock operation to the corresponding unlock -- and FIFO... The performance of Hemlock is competitive with and often better than the best scalable spin locks. read more

PDF Abstract
No code implementations yet. Submit your code now


Distributed, Parallel, and Cluster Computing Operating Systems D.4.1


  Add Datasets introduced or used in this paper