论文信息 - The Complexity of Systolic Dissemination of Information in Interconnection Networks

The Complexity of Systolic Dissemination of Information in Interconnection Networks

A concept of systolic dissemination of information in interconnection networks is introduced, and the complexity of systolic gossip in one-way (telegraph) and two-way (telephone) communication mode is investigated. Optimal systolic algorithms in both communication modes are constructed for paths and complete k-ary trees for any k≥2.

Juraj Hromkovic | Ralf Klasing | Walter Unger | Dana Pardubská | Hubert Wagener

[1] Roger Labahn,et al. Periodic gossiping on trees , 1994, Discret. Appl. Math..

[2] Oscar H. Ibarra,et al. Characterizations and Computational Complexity of Systolic Trellis Automata , 1984, Theor. Comput. Sci..

[3] Oscar H. Ibarra,et al. Sequential Machine Characterizations of Trellis and Cellular Automata and Applications , 1985, SIAM J. Comput..

[4] H. T. Kung. Let's Design Algorithms for VLSI Systems , 1979 .

[5] Juraj Hromkovič,et al. Dissemination of Information in Interconnection Networks (Broadcasting & Gossiping) , 1996 .

[6] Burkhard Monien,et al. Embedding one interconnection network in another , 1990 .

[7] Juraj Hromkovic,et al. Optimal algorithms for dissemination of information in generalized communication modes , 1994, Discret. Appl. Math..

[8] Arthur L. Liestman,et al. A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[9] S. Louis Hakimi,et al. Parallel Algorithms for Gossiping by Mail , 1990, Inf. Process. Lett..

[10] Derick Wood,et al. Systolic Tree Acceptors , 1984, RAIRO Theor. Informatics Appl..

[11] Dana S. Richards,et al. Network Communication in Edge-Colored Graphs: Gossiping , 1993, IEEE Trans. Parallel Distributed Syst..

[12] Oscar H. Ibarra,et al. Fast Parallel Language Recognition by Cellular Automata , 1985, Theor. Comput. Sci..

[13] Juraj Hromkovic,et al. Note on Optimal Gossiping in Some Weak-Connected Graphs , 1994, Theor. Comput. Sci..