A fast mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
An efficient solution to the mutual exclusion problem using weak semaphores
Information Processing Letters
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
Speeding Lamport's fast mutual exclusion algorithm
Information Processing Letters
Bounds on shared memory for mutual exclusion
Information and Computation
Time bounds for mutual exclusion and related problems
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
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
Adaptive solutions to the mutual exclusion problem
Distributed Computing
The concurrency hierarchy, and algorithms for unbounded concurrency
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Active disk paxos with infinitely many processes
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Early-Delivery Dynamic Atomic Broadcast
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
A pleasant stroll through the land of infinitely many creatures
ACM SIGACT News
On the design of distributed protocols from differential equations
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Active disk Paxos with infinitely many processes
Distributed Computing - Special issue: PODC 02
Common2 extended to stacks and unbounded concurrency
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
A new class of nature-inspired algorithms for self-adaptive peer-to-peer computing
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Asynchronous exclusive selection
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Progress guarantee for parallel programs via bounded lock-freedom
Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation
Adaptive mutual exclusion with local spinning
Distributed Computing
Joining a Distributed Shared Memory Computation in a Dynamic Distributed System
SEUS '09 Proceedings of the 7th IFIP WG 10.2 International Workshop on Software Technologies for Embedded and Ubiquitous Systems
The anonymous consensus hierarchy and naming problems
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Communication and data sharing for dynamic distributed systems
Future directions in distributed computing
Contention-sensitive data structures and algorithms
DISC'09 Proceedings of the 23rd international conference on Distributed computing
From bounded to unbounded concurrency objects and back
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Quorum-based dynamic regular registers in systems with churn
Proceedings of the 3rd International Workshop on Theoretical Aspects of Dynamic Distributed Systems
Multi-writer regular registers in dynamic distributed systems with byzantine failures
Proceedings of the 3rd International Workshop on Theoretical Aspects of Dynamic Distributed Systems
An algorithm for implementing BFT registers in distributed systems with bounded churn
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Dynamic regular registers in systems with churn
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Renaming with k-set-consensus: an optimal algorithm into n + k - 1 slots
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Simultaneous consensus tasks: a tighter characterization of set-consensus
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Two abstractions for implementing atomic objects in dynamic systems
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Regular register: an implementation in a churn prone environment
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Specifying and implementing an eventual leader service for dynamic systems
International Journal of Web and Grid Services
Looking for a definition of dynamic distributed systems
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
Connectivity in eventually quiescent dynamic distributed systems
LADC'07 Proceedings of the Third Latin-American conference on Dependable Computing
The strong at-most-once problem
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Virtual Tree: A robust architecture for interval valid queries in dynamic distributed systems
Journal of Parallel and Distributed Computing
A protocol for implementing byzantine storage in churn-prone distributed systems
Theoretical Computer Science
Dynamic regular registers in systems with churn
Theoretical Computer Science
Computing with infinitely many processes
Information and Computation
| 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 infinite. Partial information about the number of actually participating processes and the concurrency level is shown to affect the possibility and complexity of solving these problems. We survey and generalize work carried out in models with finite 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 algorithm for starvation-free mutual exclusion in a model with unbounded concurrency. We also explore models where objects stronger than atomic registers, such as test&set bits, semaphores or read-modify-write registers, are used.