Sciweavers

Share
SPAA
2006
ACM

Symmetric network computation

9 years 8 months ago
Symmetric network computation
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. Categories and Subject Descriptors
David Pritchard, Santosh Vempala
Added 14 Jun 2010
Updated 14 Jun 2010
Type Conference
Year 2006
Where SPAA
Authors David Pritchard, Santosh Vempala
Comments (0)
books