Lower Bounds for Distributed Maximum-Finding Algorithms
Journal of the ACM (JACM)
Electing a leader in a synchronous ring
Journal of the ACM (JACM)
Language complexity on the synchronous anonymous ring
Theoretical Computer Science
An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Decentralized extrema-finding in circular configurations of processors
Communications of the ACM
Mathematical Theory of L Systems
Mathematical Theory of L Systems
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Tight bounds for shared memory symmetric mutual exclusion problems
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Calling names in nameless networks
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Tight lower bounds for probabilistic solitude verification on anonymous rings
Journal of the ACM (JACM)
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
Uniform Dynamic Self-Stabilizing Leader Election
IEEE Transactions on Parallel and Distributed Systems
Computing anonymously with arbitrary knowledge
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Backward consistency and sense of direction in advanced distributed systems
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Assigning labels in unknown anonymous networks (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Computing in totally anonymous asynchronous shared memory systems
Information and Computation
Distributed Computing on Regular Networks with Anonymous Nodes
IEEE Transactions on Computers
Optimal Allocation for Partially Replicated Database Systems on Ring Networks
IEEE Transactions on Knowledge and Data Engineering
Analyzing Expected Time by Scheduler-Luck Games
IEEE Transactions on Software Engineering
Time-message trade-offs for the weak unison problem
Nordic Journal of Computing
Distributed coloring and communication in rings with local knowledge
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
An Effective Characterization of Computability in Anonymous Networks
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Can we elect if we cannot compare?
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Sense of direction in distributed computing
Theoretical Computer Science - Special issue: Distributed computing
Computing on anonymous networks with sense of direction
Theoretical Computer Science
Tight bounds for synchronous communication of information using bits and silence
Discrete Applied Mathematics - Special issue: Algorithmic aspects of communication
Distributed Computing
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Sorting and election in anonymous asynchronous rings
Journal of Parallel and Distributed Computing
Distributed Colouring and Communication in Rings with Local Knowledge
Combinatorics, Probability and Computing
Leader election in rings with nonunique labels
Fundamenta Informaticae
On the complexity of computation in the presence of link failures: the case of a ring
Distributed Computing
Finding routes in anonymous sensor networks
Information Processing Letters
A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Computing on a partially eponymous ring
Theoretical Computer Science
Proceedings of the 28th ACM symposium on Principles of distributed computing
Proceedings of the 28th ACM symposium on Principles of distributed computing
An optimal local approximation algorithm for max-min linear programs
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
On the round complexity of Byzantine agreement without initial set-up
Information and Computation
Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Finding routes in anonymous sensor networks
Information Processing Letters
An algorithmic theory of mobile agents
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Distributed anonymous function computation in information fusion and multiagent systems
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Distributed algorithms for edge dominating sets
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
How to meet when you forget: log-space rendezvous in arbitrary graphs
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
How much memory is needed for leader election
DISC'10 Proceedings of the 24th international conference on Distributed computing
The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash, and Anonymity
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Mathematical models of object-based distributed systems
Formal modeling
Computing on a partially eponymous ring
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
A knowledge-based analysis of global function computation
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Waking up anonymous ad hoc radio networks
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Effective elections for anonymous mobile agents
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Distributed tree comparison with nodes of limited memory
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Communication complexity of consensus in anonymous message passing systems
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Weak models of distributed computing, with connections to modal logic
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Leader Election in Rings with Nonunique Labels
Fundamenta Informaticae
Knowledge, level of symmetry, and time of leader election
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Lower bounds for local approximation
Journal of the ACM (JACM)
Computing with infinitely many processes
Information and Computation
Hi-index | 0.01 |
The computational capabilities of a system of n indistinguishable (anonymous) processors arranged on a ring in the synchronous and asynchronous models of distributed computation are analyzed. A precise characterization of the functions that can be computed in this setting is given. It is shown that any of these functions can be computed in O(n2) messages in the asynchronous model. This is also proved to be a lower bound for such elementary functions as AND, SUM, and Orientation. In the synchronous model any computable function can be computed in O(n log n) messages. A ring can be oriented and start synchronized within the same bounds.The main contribution of this paper is a new technique for proving lower bounds in the synchronous model. With this technique tight lower bounds of &thgr;(n log n) (for particular n) are proved for XOR, SUM, Orientation, and Start Synchronization. The technique is based on a string-producing mechanism from formal language theory, first introduced by Thue to study square-free words. Two methods for generalizing the synchronous lower bounds to arbitrary ring sizes are presented.