论文信息 - Computing vector functions on anonymous networks

Computing vector functions on anonymous networks

We characterize exactly the vector functions f : n → n computable by several classes of anonymous networks. We study both undirectional and bidirectional networks, (partially) wireless networks, and two different processor activation models (synchronous and asynchronous). We also identify the rigidity conditions under which a network can compute every function.

Sebastiano Vigna | Paolo Boldi

[1] Masafumi Yamashita,et al. Computing on an anonymous network , 1988, PODC '88.

[2] Jan K. Pachl,et al. Uniform self-stabilizing rings , 1988, TOPL.

[3] Michael Doob,et al. Spectra of graphs , 1980 .

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

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

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

[7] Nancy Norris,et al. Universal Covers of Graphs: Isomorphism to Depth N-1 Implies Isomorphism to All Depths , 1995, Discret. Appl. Math..

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

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

[10] Masafumi Yamashita,et al. Electing a Leader when Processor Identity Numbers are not Distinct (Extended Abstract) , 1989, WDAG.

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