Algorithms for scalable synchronization on shared-memory multiprocessors
ACM Transactions on Computer Systems (TOCS)
Scalable reader-writer synchronization for shared-memory multiprocessors
PPOPP '91 Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming
Asynchronous group mutual exclusion (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
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
Scalable queue-based spin locks with timeout
PPoPP '01 Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programming
A note on group mutual exclusion
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Non-blocking timeout in scalable queue-based spin locks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
The Performance of Spin Lock Alternatives for Shared-Memory Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Adaptive and efficient abortable mutual exclusion
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Shared-memory mutual exclusion: major research trends since 1986
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Resource allocation with immunity to limited process failure
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
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
Fast local-spin abortable mutual exclusion with bounded space
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Specification and constant RMR algorithm for phase-fair reader-writer lock
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
| Hi-index | 0.00 |
When a process attempts to acquire a mutex lock, it may be forced to wait if another process currently holds the lock. In certain applications, such as real-time operating systems and databases, indefinite waiting can cause a process to miss an important deadline [19]. Hence, there has been research on designing abortable mutual exclusion locks, and fairly efficient algorithms of O(logn) RMR complexity have been discovered [11,14] (n denotes the number of processes for which the algorithm is designed). The abort feature is just as important for a reader-writer lock as it is for a mutual exclusion lock, but to the best of our knowledge there are currently no abortable reader-writer locks that are starvation-free. We show the surprising result that any abortable, starvation-free mutual exclusion algorithm of RMR complexity t(n) can be transformed into an abortable, starvation-free reader-writer exclusion algorithm of RMR complexity O(t(n)). Thus, we obtain the first abortable, starvation-free reader-writer exclusion algorithm of O(logn) RMR complexity. Our results apply to the Cache-Coherent (CC) model of multiprocessors.