Paper Details

Reference:

Orran Krieger, Michael Stumm, Ronald C. Unrau, and Jonathan Hanna,
"A fair fast scalable reader-writer lock",
In Proceedings International Conference on Parallel Processing (ICPP'93), Syracuse University, NY, USA, 2, IEEE Computer Society, Washington, DC, USA, August, 1993, pp. 201–204.

Download:

PDF

Abstract:

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.

Keywords:

Operating systems, locking, shared memory multiprocessors, reader-writer locks, scalability

Reference Info:

DOI: 10.1109/ICPP.1993.21
ACMid: 1260898
ISBN: 0-8493-8983-6

BibTeX:

@inproceedings(Krieger-ICPP93,
    author = {Orran Krieger and Michael Stumm and Ronald C. Unrau and Jonathan Hanna},
    title = {A fair fast scalable reader-writer lock},
    booktitle = {Proceedings International Conference on Parallel Processing (\textbf{ICPP'93})},
    location = {Syracuse University, NY, USA},
    volume = {2},
    organization = {IEEE Computer Society},
    address = {Washington, DC, USA},
    month = {August},
    year = {1993},
    pages = {201-204},
    doi = {10.1109/ICPP.1993.21},
    isbn = {0-8493-8983-6},
    keywords = {Operating systems, locking, shared memory multiprocessors, reader-writer locks, scalability}
)