论文信息 - An Effective Characterization of Computability in Anonymous Networks

An Effective Characterization of Computability in Anonymous Networks

We provide effective (i.e., recursive) characterizations of the relations that can be computed on networks where all processors use the same algorithm, start from the same state, and know at least a bound on the network size. Three activation models are considered (synchronous, asynchronous, interleaved).

Sebastiano Vigna | Paolo Boldi | P. Boldi | S. Vigna

[1] Masafumi Yamashita,et al. Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases , 1996, IEEE Trans. Parallel Distributed Syst..

[2] Sebastiano Vigna,et al. Fibrations of graphs , 2002, Discret. Math..

[3] Sebastiano Vigna,et al. Computing vector functions on anonymous networks , 1997, PODC '97.

[4] Hagit Attiya,et al. Computing on an anonymous ring , 1988, JACM.

[5] Dana Angluin,et al. Local and global properties in networks of processors (Extended Abstract) , 1980, STOC '80.

[6] Nancy Norris. Computing Functions on Partially Wireless Networks , 1995, SIROCCO.

[7] Krzysztof Diks,et al. Anonymous Wireless Rings , 1995, Theor. Comput. Sci..

[8] Sebastiano Vigna,et al. Computing anonymously with arbitrary knowledge , 1999, PODC '99.

[9] Alon Itai,et al. Average and Randomized Complexity of Distributed Problems , 1994, SIAM J. Comput..

[10] Ralph E. Johnson,et al. Symmetry and similarity in distributed systems , 1985, PODC '85.

[11] T. Kameda,et al. Computing functions on asynchronous anonymous networks , 1998, Theory of Computing Systems.

[12] Sebastiano Vigna,et al. Symmetry Breaking in Anonymous Networks: Characterizations , 1996, ISTCS.

[13] Sebastiano Vigna,et al. Self-stabilizing universal algorithms , 1997, WSS.

[14] Sandeep K. Shukla,et al. Observations on self-stabilizing graph algorithms for anonymous networks , 1995 .

[15] M. Kaufmann. What Can Be Computed Locally ? , 2003 .