A fast mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
Parallel program design: a foundation
Parallel program design: a foundation
The APRAM: incorporating asynchrony into the PRAM model
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
A first-come-first-served mutual-exclusion algorithm with small communication variables
ACM Transactions on Programming Languages and Systems (TOPLAS)
Improving fast mutual exclusion
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Speeding Lamport's fast mutual exclusion algorithm
Information Processing Letters
Fast, scalable synchronization with minimal hardware support
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Contention in shared memory algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The QRQW PRAM: accounting for contention in parallel algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables
ACM Transactions on Programming Languages and Systems (TOPLAS)
A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
Additional comments on a problem in concurrent programming control
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
Economical solutions for the critical section problem in a distributed system (Extended Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Fast allocation of nearby resources in a distributed system
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Fast Mutual Exclusion, Even with Contention
Fast Mutual Exclusion, Even with Contention
Contention in shared memory algorithms
Journal of the ACM (JACM)
Long-lived renaming made adaptive
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Adaptive and efficient mutual exclusion (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Lamport on mutual exclusion: 27 years of planting seeds
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Nonatomic mutual exclusion with local spinning
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Fair and Efficient Mutual Exclusion Algorithms (Extended Abstract)
Proceedings of the 13th International Symposium on Distributed Computing
Computing with Infinitely Many Processes
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Adaptive Mutual Exclusion with Local Spinning
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
A Time Complexity Bound for Adaptive Mutual Exclusion
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Adaptive and efficient mutual exclusion
Distributed Computing
An improved lower bound for the time complexity of mutual exclusion
Distributed Computing - Special issue: Selected papers from PODC '01
Algorithms adapting to point contention
Journal of the ACM (JACM)
Adaptive and efficient abortable mutual exclusion
Proceedings of the twenty-second annual symposium on Principles of distributed computing
On using network attached disks as shared memory
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Backoff Protocols for Distributed Mutual Exclusion and Ordering
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Shared-memory mutual exclusion: major research trends since 1986
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
A pleasant stroll through the land of infinitely many creatures
ACM SIGACT News
An adaptive collect algorithm with applications
Distributed Computing
A new fast-path mechanism for mutual exclusion
Distributed Computing
Using local-spin k-exclusion algorithms to improve wait-free object implementations
Distributed Computing
An O(1) RMRs leader election algorithm
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
The Weakest Failure Detector for Message Passing Set-Agreement
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
On the cost of uniform protocols whose memory consumption is adaptive to interval contention
Theoretical Computer Science
Adaptive mutual exclusion with local spinning
Distributed Computing
An $O(1)$ RMRs Leader Election Algorithm
SIAM Journal on Computing
On the cost of uniform protocols whose memory consumption is adaptive to interval contention
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Adapting to point contention with long-lived safe agreement
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Can memory be used adaptively by uniform algorithms?
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
A fully verified executable LTL model checker
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Computing with infinitely many processes
Information and Computation
| Hi-index | 0.00 |
Algorithms for mutual exclusion that adapt to the current degree of contention are developed. A filter and a leader election algorithm form the basic building blocks. The algorithms achieve system response times that are independent of the total number of processes and governed instead by the current degree of contention. The final algorithm achieves a constant amortized system response time.