Scalable reader-writer synchronization for shared-memory multiprocessors
PPOPP '91 Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming
The communication requirements of mutual exclusion
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
Concurrent control with “readers” and “writers”
Communications of the ACM
Solution of a problem in concurrent programming control
Communications of the ACM
The Performance of Spin Lock Alternatives for Shared-Memory Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
An improved lower bound for the time complexity of mutual exclusion
Distributed Computing - Special issue: Selected papers from PODC '01
Tight RMR lower bounds for mutual exclusion and other problems
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Reader-Writer Synchronization for Shared-Memory Multiprocessor Real-Time Systems
ECRTS '09 Proceedings of the 2009 21st Euromicro Conference on Real-Time Systems
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Constant RMR solutions to reader writer synchronization
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Abortable reader-writer locks are no more complex than abortable mutex locks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
| Hi-index | 0.00 |
Brandenburg and Anderson recently introduced a phase-fair readers/ writers lock, where read and write phases alternate: when the writer leaves the CS, any waiting reader will enter the CS before the next writer enters the CS; similarly, if a reader is in the CS and a writer is waiting, any new reader that now enters the Try section will not enter the CS before some writer enters the CS. Thus, neither class of processes-readers or writer-has priority over the others, and no process starves. Brandenburg and Anderson informally specify a phase fair lock and present an algorithm to implement it with O(n) remote memory reference complexity (RMR), where n is the number of processes in the system. In this work we give a rigorous specification of a phase fair lock and present an algorithm that implements it with O(1) RMR complexity.