Optimal multinode broadcast on a mesh connected graph with reduced bufferization

  • Abderezak Touzene
  • Brigitte Plateau
Part of the Lecture Notes in Computer Science book series (LNCS, volume 487)


We present an optimal all-to-all communication procedure for a mesh connected topology of processors with wrap-around (a torus). This procedure is based on a spanning tree method and uses a reduced bufferization space.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Berge. Théorie des graphes. Gautiers-Villars, 1983.Google Scholar
  2. [2]
    S.M. Hedetniemi, S.T Hedetneimi, and A.L. Liestman. A survey of gossiping and broadcasting in communication networks. Networks, 18, 1986.Google Scholar
  3. [3]
    A.M.Farley and A.Proskurowski. Gossip in grid graphs. Journal of Combinatorics information and System Sciences, 5(2), 1980.Google Scholar
  4. [4]
    Y. Saad. Data communication in parallel architectures. Parallel Computing, (11), 1989.Google Scholar
  5. [5]
    D.M. Topkis. All-to-all broadcast by flooding in communication networks. IEEE Transactions on Computers, 38(9), September 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Abderezak Touzene
    • 1
  • Brigitte Plateau
    • 1
  1. 1.LGI-IMAG, Groupe Calcul parallèleGrenoble cedex France

Personalised recommendations