David Pritchard
Santosh Vempala
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.
- D. Angluin, J. Aspnes, Z. Diamadi, M. J. Fischer, and R. Peralta. Computation in networks of passively mobile finite-state sensors. In Proc. 23rd Symp. Principles of Distributed Computing, pages 290--299, 2004. Google Scholar
Digital Library
- B. Awerbuch. Complexity of network synchronization. J. ACM, 32(4):804--823, 1985. Google ScholarDigital Library
- B. Awerbuch and R. Ostrovsky. Memory-efficient and self-stabilizing network reset. In Proc. 13th Symp. Principles of Distributed Computing, pages 254--263, 1994. Google ScholarDigital Library
- S. R. Buss, C. H. Papadimitriou, and J. N. Tsitsiklis. On the predictability of coupled automata: An allegory about chaos. In Proc. 31st Symp. Foundations of Computer Science, pages 788--293, 1990.Google ScholarDigital Library
- S. Dolev. Self-Stabilization. MIT Press, 2000. Google ScholarDigital Library
- P. Flajolet and G. N. Martin. Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci., 31(2):182--209, 1985. Google ScholarDigital Library
- M. Gardner. The fantastic combinations of John Conway's new solitaire game "life". Scientific American, 223:120--123, 1970.Google ScholarCross Ref
- D. S. Hirschberg and J. B. Sinclair. Decentralized extrema-finding in circular configurations of processors. Commun. ACM, 23(11):627--628, 1980. Google ScholarDigital Library
- G. Itkis and L. Levin. Fast and lean self-stabilizing asynchronous protocols. In Proc. 35th Symp. Foundations of Computer Science, pages 226--239, 1994.Google ScholarDigital Library
- D. Kempe and F. McSherry. A decentralized algorithm for spectral analysis. In Proc. 36th Symp. Theory of Computing, pages 561--568, 2004. Google ScholarDigital Library
- N. Lynch. A hundred impossibility proofs for distributed computing. In Proc. 8th Symp. Principles of Distributed Computing, pages 1--28, 1989. Google ScholarDigital Library
- B. Martin. A geometrical hierarchy on graphs via cellular automata. Fundamenta Informaticae, 52(1-3):157--181, 2002. Google ScholarDigital Library
- A. Mayer, Y. Ofek, R. Ostrovsky, and M. Yung. Self-stabilizing symmetry breaking in constant space. In Proc. 24th Symp. Theory of Computing, pages 667--678, 1992. Google ScholarDigital Library
- D. L. Milgram. Web automata. Information and Control, 29(2):162--184, 1975.Google ScholarCross Ref
- R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 2000. Google ScholarDigital Library
- S. Nath, P. B. Gibbons, Z. Anderson, and S. Seshan. Synopsis diffusion for robust aggregation in sensor networks. In Proc. 2nd Conf. Embedded Networked Sensor Systems, pages 250--262, 2004. Google ScholarDigital Library
- E. Rémila. Recognition of graphs by automata. Theoret. Comput. Sci., 136(2):291--332, 1994. Google ScholarDigital Library
- A. Rosenfeld. Networks of automata: some applications. IEEE Trans. Systems, Man, and Cybernetics, 5:380--383, 1975.Google ScholarCross Ref
- A. Rosenfeld and D. L. Milgram. Web automata and web grammars. Machine Intelligence, 7:307--324, 1972.Google Scholar
- D. J. Rosenkrantz, R. E. Stearns, and P. M. Lewis II. An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput., 6(5):563--581, 1977.Google ScholarCross Ref
- P. Rosenstiehl, J. Fiksel, and A. Holliger. Intelligent graphs: Networks of finite automata capable of solving graph problems. In R. C. Read, editor, Graph Theory and Computing, pages 219--265. Academic Press, 1972.Google ScholarCross Ref
- H. Szwerinkski. Time-optimal solution of the firing-squad synchronization-problem for n-dimensional rectangles with the general at an arbitrary position. Theoret. Comput. Sci., 19:305--320, 1982.Google ScholarCross Ref
- G. Tel. Introduction to Distibuted Algorithms. Cambridge University Press, 2000. Google ScholarDigital Library
Index Terms
- Symmetric network computation
Recommendations
Symmetric Paraunitary Matrix Extension and Parametrization of Symmetric Orthogonal Multifilter Banks
This paper is devoted to a study of symmetric paraunitary matrix extensions. The problem for a given compactly supported orthonormal scaling vector with some symmetric property, to construct a corresponding multiwavelet which also has the symmetric ...
Computing the Smoothness Exponent of a Symmetric Multivariate Refinable Function
Smoothness and symmetry are two important properties of a refinable function. It is known that the Sobolev smoothness exponent of a refinable function can be estimated by computing the spectral radius of a certain finite matrix which is generated from a ...
Symmetric monotone Venn diagrams with seven curves
FUN'10: Proceedings of the 5th international conference on Fun with algorithmsAn n-Venn diagram consists of n curves drawn in the plane in such a way that each of the 2n possible intersections of the interiors and exteriors of the curves forms a connected non-empty region. A k-region in a diagram is a region that is in the ...
Comments