A fast mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
Electing a leader in a synchronous ring
Journal of the ACM (JACM)
An efficient solution to the mutual exclusion problem using weak semaphores
Information Processing Letters
Computing on an anonymous ring
Journal of the ACM (JACM)
Distributed FIFO allocation of identical resources using small shared space
ACM Transactions on Programming Languages and Systems (TOPLAS)
Tight bounds for shared memory symmetric mutual exclusion problems
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Renaming in an asynchronous environment
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Speeding Lamport's fast mutual exclusion algorithm
Information Processing Letters
Bounds on shared memory for mutual exclusion
Information and Computation
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Wait-free algorithms for fast, long-lived renaming
Science of Computer Programming
Time/contention trade-offs for multiprocessor synchronization
Information and Computation
Contention-free complexity of shared memory algorithms
Information and Computation
Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable
Journal of the ACM (JACM)
Solution of a problem in concurrent programming control
Communications of the ACM
The concurrency hierarchy, and algorithms for unbounded concurrency
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Wait-free consensus with infinite arrivals
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Distributed Algorithms
Active disk paxos with infinitely many processes
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Public data structures: counters as a special case
Theoretical Computer Science
A Simple Algorithmic Characterization of Uniform Solvability
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
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
Adaptive and efficient mutual exclusion
Distributed Computing
Long-Lived Adaptive Collect with Applications
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
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
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Long lived adaptive splitter and applications
Distributed Computing
Adaptive solutions to the mutual exclusion problem
Distributed Computing
Synchronization Algorithms and Concurrent Programming
Synchronization Algorithms and Concurrent Programming
| Hi-index | 0.00 |
We explore four classic problems in concurrent computing (election, mutual exclusion, consensus, and naming) when the number of processes which may participate is unbounded. Partial information about the number of processes actually participating and the concurrency level is shown to affect the computability and complexity of solving these problems when using only atomic registers. We survey and generalize work carried out in models with known bounds on the number of processes, and prove several new results. These include improved bounds for election when participation is required and a new adaptive starvation-free mutual exclusion algorithm for unbounded concurrency. We also survey results in models with shared objects stronger than atomic registers, such as test&set bits, semaphores or read-modify-write registers, and update them for the unbounded case.