A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
Non-blocking timeout in scalable queue-based spin locks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Adaptive and efficient abortable mutual exclusion
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Asynchronous group mutual exclusion
Distributed Computing
Using local-spin k-exclusion algorithms to improve wait-free object implementations
Distributed Computing
Brief announcement: fast local-spin abortable mutual exclusion with bounded space
DISC'10 Proceedings of the 24th international conference on Distributed computing
Fast local-spin abortable mutual exclusion with bounded space
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
| Hi-index | 0.00 |
A mutual exclusion (ME) algorithm consists of a trying protocol (TP)and exit protocol (EP)that surround a critical section (CS)and satisfy the following properties: mutual exclusion: at most one process is allowed to use the CS at a given time; lockout freedom: any process that enters the TP eventually enters the CS; and bounded exit: a process can complete the EP in a bounded number of its own steps. A First-Come-First-Served (FCFS) ME algorithm [1] additionally requires processes to enter the CS in roughly the order in which they start the TP. Once a process has started executing the TP of a ME algorithm, it has committed itself to entering the CS, since the correctness of the algorithm may depend on every process properly completing its TP and EP.