Paper Info
Title
Scalable Reader-Writer Locks for Parallel Systems
Abstract
Current algorithms for reader-writer synchronization do not scale for readers: readers cannot acquire locks in parallel. The authors describe two new algorithms that allow parallelism among readers during lock acquisition; this is achieved by distributing the lock state among different processors, and by trading reader throughput for writer throughput. Their experiments show that when reads are a large percentage of lock requests, the throughput of each of their algorithms scales significantly better than current algorithms.
Year
DOI
Venue
1992
10.1109/IPPS.1992.222989
Beverly Hills, CA
Keywords
Field
DocType
current algorithm,scalable reader-writer locks,algorithms scale,parallel systems,writer throughput,large percentage,new algorithm,trading reader throughput,fair percentage,lock request,reader-writer synchronization,different processor,lock acquisition,lock state,parallel processing,computer science,scalability,scale,testing,simulators,ratios,algorithms,synchronisation,concurrent computing,throughput
Synchronization,Lock (computer science),Computer science,Reader writer,Parallel computing,Parallel processing,Readers–writer lock,Throughput,Concurrent computing,Scalability
Conference
ISBN
Citations 
PageRank 
0-8186-2672-0
12
1.77
References 
Authors
5
2
Name
Order
Citations
PageRank
Wilson C. Hsieh12532261.94
William E. Weihl22614903.11