Circuit-switched gossiping in 3-dimensional torus networks

Olivier Delmas (1) , Stéphane Pérennes (2)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications

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 7^i×7^i×7^i torus network.

Domaines: Réseaux et télécommunications [cs.NI]

Olivier Delmas, Stéphane Pérennes. Circuit-switched gossiping in 3-dimensional torus networks. Euro-Par'96 Parallel Processing, Aug 1996, Lyon, France. pp.370-373, ⟨10.1007/3-540-61626-8_48⟩. ⟨hal-00407414⟩