A Fair Fast Scalable Rea,der-Writer Lock
A Fair Fast Scalable Rea,der-Writer Lock
复制标题
一种快速可扩展的读写器锁
DOI：
--
复制
发表时间：
1993
期刊：
影响因子：
--
通讯作者：
J. Hanna
中科院分区：
文献类型：
--
作者：
Orran Krieger;M. Stumm;Ronald C. Unrau;J. Hanna
读写器（RW）锁允许多个读取器检查共享数据，或者允许单个写入器独占访问以修改该数据。在共享内存多处理器上，获取和释放这些锁的成本会对并行应用程序的性能产生很大影响。这些锁的简单实现的一个主要问题是，当锁被竞争时，包含锁的内存和到该内存的互连网络也将被竞争，其中处理器在全局锁变量上旋转以等待锁变得可用。
A reader-writer (RW) lock allows either multiple readers to inspect shared data or a single writer exclusive access for modifying that data. On shared memory multiprocessors,cost of acquiring and releasing these locks can have a large impact on the performance of parallel applications. A major problem with naive implementations of these locks, where processors spin on a global lock variable waiting for the lock to become available, is that the memory containing the lock and the interconnection network to that memory will also become contended when the lock is contended.