Dissemination of Information in Vertex-Disjoint Paths Mode

The communication modes (one-way and two-way mode) used for disseminating information among processors of interconnection networks via vertex-disjoint paths in the communication step are investigated. The complexity of communication algorithms is measured by the number of communication steps (rounds). Since optimal broadcast and accumulation algorithms for these modes can be achieved in a straightforward way for almost all interconnection networks used, the paper concentrates on the gossip problem. The main results are listed below: 1.    Optimal gossip algorithms for paths, complete graphs and flakes in both modes. 2.    For hypercubes, cube-connected cycles, butterfly networks, etc., gossip algorithms which are only about O (log2log2n) rounds slower than the optimal gossip algorithms on complete graphic are designed. Note that the results achieved have also practical applications, because the vertex/disjoint paths mode can be implemented in several hardware realisations of computing networks.

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

[2]  Frank Thomson Leighton,et al.  A Tight Lower Bound on the Size of Planar Permutation Networks , 1992, SIAM J. Discret. Math..

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

[4]  Frank Harary,et al.  The communication problem on graphs and digraphs , 1974 .

[5]  Bruce M. Maggs,et al.  Fast algorithms for bit-serial routing on a hypercube , 1990, SPAA '90.

[6]  Leonard Kleinrock,et al.  Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.

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

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

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

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

[11]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[12]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

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

[14]  Krzysztof Diks,et al.  Edge Separators of Planar and Outerplanar Graphs with Applications , 1993, J. Algorithms.

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

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

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

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

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

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

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