Renaming in an asynchronous environment
Journal of the ACM (JACM)
Atomic snapshots of shared memory
Journal of the ACM (JACM)
Generalized FLP impossibility result for t-resilient asynchronous computations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Algorithms for the Certified Write-All Problem
SIAM Journal on Computing
The topological structure of asynchronous computability
Journal of the ACM (JACM)
Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
SIAM Journal on Computing
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Random walks, universal traversal sequences, and the complexity of maze problems
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
New combinatorial topology upper and lower bounds for renaming
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
From adaptive renaming to set agreement
Theoretical Computer Science
Beeping a maximal independent set
DISC'11 Proceedings of the 25th international conference on Distributed computing
Simultaneous consensus tasks: a tighter characterization of set-consensus
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
DISC'05 Proceedings of the 19th international conference on Distributed Computing
The committee decision problem
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Hi-index | 0.00 |
We introduce oblivious protocols, a new framework for distributed computation with limited communication.Within this model we consider the musical chairs task MC(n,m), involving n players (processors) and m chairs. Initially, players occupy arbitrary chairs. Two players are in conflict if they both occupy the same chair. The task terminates when there are no conflicts and each player occupies a different chair. Our oblivious protocols use only limited communication, and do so in an asynchronous fashion. Essentially, a player can only observe whether the player itself is in conflict or not, and nothing else. A player observing no conflict halts and never changes its chair, whereas a player observing a conflict changes its chair according to its deterministic program. Known results imply that even with more general communication primitives, no strategy of the players can guarantee termination if m n-1. We show that even with this minimal communication termination can be guaranteed with only m = 2n-1 chairs. Our oblivious protocol can be extended to the well-known Adaptive Renaming problem, using a name-space that is as small as that of the optimal nonoblivious protocol. We also make substantial progress in optimizing other parameters (such as program length) for our protocols, though many interesting questions remain open.