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.

中文翻译：

---

Hemlock：紧凑且可扩展的互斥

我们介绍了Hemlock，这是一种新颖的互斥锁定算法，它非常紧凑，每个线程只需要一个单词，每个锁定只需要一个单词，但是在大多数情况下仍可提供本地自旋，在争用情况下吞吐量高，在无竞争情况下延迟低。Hemlock不受上下文限制-不需要将任何信息从锁定操作传递到相应的解锁-和FIFO。Hemlock的性能与最佳可伸缩自旋锁相比具有竞争力，并且通常优于最佳可伸缩自旋锁。