Symmetric network computation

Authors:
David Pritchard;Santosh Vempala
Affiliations:
University of Waterloo, Waterloo, ON, Canada;MIT, Cambridge, MA
Venue:
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Year:
2006

Citing 14
Cited 1

Complexity of network synchronization

Journal of the ACM (JACM)
Probabilistic counting algorithms for data base applications

Journal of Computer and System Sciences
A hundred impossibility proofs for distributed computing

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Self-stabilizing symmetry breaking in constant-space (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Memory-efficient and self-stabilizing network RESET (extended abstract)

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Introduction to distributed algorithms

Introduction to distributed algorithms
Recognition of graphs by automata

Theoretical Computer Science
Randomized algorithms

Randomized algorithms
Self-stabilization

Self-stabilization
Decentralized extrema-finding in circular configurations of processors

Communications of the ACM
A geometrical hierarchy on graphs via cellular automata

Fundamenta Informaticae - Special issue on cellular automata
A decentralized algorithm for spectral analysis

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Computation in networks of passively mobile finite-state sensors

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Synopsis diffusion for robust aggregation in sensor networks

SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems

Fast computation of small cuts via cycle space sampling

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a simple new model of distributed computation -- finite-state symmetric graph automata (FSSGA) -- which captures the qualitative properties common to fault-tolerant distributed algorithms. Roughly speaking, the computation evolves homogeneously in the entire network, with each node acting symmetrically and with limited resources. As a building block, we demonstrate the equivalence of two automaton models for computing symmetric multi-input functions. We give FSSGA algorithms for several well-known problems.