Circuit-switched gossiping in 3-dimensional torus networks

  • Olivier Delmas
  • Stéphane Perennes
Workshop 02 Routing and Communication in Interconnection Networks
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1123)


In this paper we describe an efficient gossiping algorithm for short messages into the 3-dimensional torus networks (wrap-around or toroidal meshes) that uses synchronous circuit-switched routing. The algorithm is based on a recursive decomposition of a torus. It requires an optimal number of rounds and a quasi-optimal number of intermediate switch settings to gossip in a 7i×7i×7i torus network.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    O. Delmas and S. Perennes. Diffusion on mode commutation de circuits. In RenPar'8, pages 53–56, Bordeaux, Prance, 20–24 May 1996. Edition spéciale, présentation des activités du GDR-PRC Parallélisme, Réseaux et Systèmes, Richard Castanet and Jean Roman.Google Scholar
  2. 2.
    M.C. Heydemann, J.C. Meyer, and D. Sotteau. On forwarding indices of networks Discrete Applied Mathematics, 23:103–123, 1989.CrossRefGoogle Scholar
  3. 3.
    F.J. MacWilliams and N.J.A. Sloane. The theory of Error-Correcting Codes. North-Holland, 1977.Google Scholar
  4. 4.
    J.G. Peters and M. Syska. Circuit-switched broadcasting in torus networks. IEEE Transactions on Parallel and Distributed Systems, 7(3):246–255, March 1996.CrossRefGoogle Scholar
  5. 5.
    Jean de Rumeur. Communication dans les réseaux de processeurs. Collection Etudes et Recherches en Informatique. Masson, 1994. (English version to appear)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Olivier Delmas
    • 1
  • Stéphane Perennes
    • 1
  1. 1.Laboratoire I3S - CNRS URA 1376SLOOP Project (CNRS-INRIA-UNSA)Sophia Antipolis Cedex

Personalised recommendations