A low-latency scalable locking algorithm for shared memory multiprocessors
A low-latency scalable locking algorithm for shared memory multiprocessors
复制标题
共享内存多处理器的低延迟可扩展锁定算法
DOI：
--
复制
发表时间：
1994
期刊：
影响因子：
--
通讯作者：
R. Campbell
中科院分区：
文献类型：
--
作者：
Amitabh Dave;N. Islam;R. Campbell
在本文中，我们专门讨论中小型共享内存多处理器的自旋锁。锁的性能取决于对受锁保护的临界区的争用。为关键部分选择最合适的锁很困难，因为争用级别可能会动态变化。我们验证当前没有锁对所有关键部分都具有最佳性能。我们提出了一种新的锁，称为共享数组锁，它可以缓解这个问题。共享数组锁属于基于等待锁的处理器排队的锁类别。与现有的基于队列的锁在低争用情况下遭受高延迟不同，实验结果表明共享数组锁具有低延迟和良好的可扩展性。<<ETX>>
In this paper we deal exclusively with spin locks for small- to medium-scale shared memory multiprocessors. The performance of a lock depends on the contention for the critical section being protected by the lock. The selection of the most appropriate lock for a critical section is difficult because the level of contention can vary dynamically. We verify that no current lock has the best performance for all critical sections. We present a new lock, called the shared array lock, which alleviates this problem. The shared array lock belongs to the class of locks based on queuing of processors waiting for the lock. Unlike existing queue-based locks which suffer from high latency in low contention situations, experimental results show that the shared array lock has low latency and good scalability.<<ETX>>