Dissemination of Information in Interconnection Networks (Broadcasting & Gossiping)

Considerable attention in recent theoretical computer science is devoted to parallel computing. Here, we would like to present a special part of this large topic, namely, the part devoted to an abstract study of the dissemination of information in interconnection networks. The importance of this research area lies in the fact that the ability of a network to effectively disseminate information is an important qualitative measure for the suitabilty of the network for parallel computing. This follows simply from the observation that the communication among processes working in parallel is one of the main parts of the whole parallel computation. So, the effectivity of information exchange among processors essentially influences the effectivity of the whole computation process.

[1]  J. H. Wilkinson.  The algebraic eigenvalue problem , 1966 .

[2]  Peter Winkler,et al.  Fast Information Sharing in a Complete Network , 1993, Discret. Appl. Math..

[3]  Arthur M. Farley.  Minimum-time line broadcast networks , 1980, Networks.

[4]  David W. Krumme,et al.  Gossiping in Minimal Time , 1992, SIAM J. Comput..

[5]  Marshall C. Pease,et al.  An Adaptation of the Fast Fourier Transform for Parallel Processing , 1968, JACM.

[6]  Shimon Even,et al.  On the number of rounds necessary to disseminate information , 1989, SPAA '89.

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

[8]  R. Labahn,et al.  Quick Gossiping by Multi-Telegraphs , 1990 .

[9]  Arnold L. Rosenberg,et al.  Group Action Graphs and Parallel Architectures , 1990, SIAM J. Comput..

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

[11]  Arthur L. Liestman,et al.  Broadcasting in Bounded Degree Graphs , 1992, SIAM J. Discret. Math..

[12]  Rainer Feldmann,et al.  The Cube-Connected Cycles Network Is a Subgraph of the Butterfly Network , 1992, Parallel Process. Lett..

[13]  Dana S. Richards,et al.  Generalizations of broadcasting and gossiping , 1988, Networks.

[14]  Chandra GowriSankaran,et al.  Broadcasting on recursively decomposable Cayley graphs , 1994 .

[15]  Rainer Bodendiek,et al.  Topics In Combinatorics and Graph Theory , 1992 .

[16]  Jaroslav Opatrny,et al.  Broadcasting and Spanning Trees in de Bruijn and Kautz Networks , 1992, Discret. Appl. Math..

[17]  David W. Krumme.  Fast Gossiping for the Hypercube , 1992, SIAM J. Comput..

[18]  Elena Stöhr.  On the Broadcast Time of the Butterfly network , 1991, WG.

[19]  Dhiraj K. Pradhan,et al.  The De Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI , 1989, IEEE Trans. Computers.

[20]  Pierre Fraigniaud,et al.  Methods and problems of communication in usual networks , 1994, Discret. Appl. Math..

[21]  Elena Stöhr.  Broadcasting in the Butterfly Network , 1991, Inf. Process. Lett..

[22]  E. C. Milner,et al.  A Cure for the Telephone Disease , 1972, Canadian Mathematical Bulletin.

[23]  Luisa Gargano,et al.  Time Bound for Broadcasting in Bounded Degree Graphs , 1989, WG.

[24]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[25]  Walter Knödel,et al.  New gossips and telephones , 1975, Discret. Math..

[26]  Ralf Klasing,et al.  Compressing cube-connected cycles and butterfly networks , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

[27]  Afonso Ferreira,et al.  Optimal information dissemination in star and pancake networks , 1996 .

[28]  Sheldon B. Akers,et al.  A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[29]  P. Slater,et al.  Gossips and telegraphs , 1979 .

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

[31]  Juraj Hromkovic,et al.  Optimal Algorithms for Dissemination of Information in Some Interconnection Networks (Extended Abstract) , 1990, MFCS.

[32]  Dilip Sarkar,et al.  Optimal Broadcasting on the Star Graph , 1992, IEEE Trans. Parallel Distributed Syst..

[33]  David W. Krumme,et al.  Simultaneous Broadcasting in Multiprocessor Networks , 1986, ICPP.

[34]  Ralf Klasing,et al.  Broadcasting in Butterfly and deBruijn Networks , 1992, Discret. Appl. Math..

[35]  Paul Walton Purdom,et al.  The Analysis of Algorithms , 1995 .

[36]  Brenda S. Baker,et al.  Gossips and telephones , 1972, Discret. Math..

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

[38]  Juraj Hromkovic,et al.  Optimal Algorithms for Disemination of Information in Generalized Communication Modes , 1992, PARLE.

[39]  Arthur L. Liestman,et al.  Broadcast Networks of Bounded Degree , 1988, SIAM J. Discret. Math..

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