%0 Report %T Circuit-Switched Gossiping in the 3-Dimensional Torus Networks %+ Simulation, Object Oriented Languages and Parallelism (SLOOP) %A Delmas, Olivier %A Pérennes, Stéphane %N RR-2930 %I INRIA %8 1996-07 %D 1996 %K CIRCUIT-SWITCHING %K GOSSIPING %K TORUS NETWORK %K TOROIRAL MESH %K LINEARCODE THEORY %Z Computer Science [cs]/Other [cs.OH]Reports %X In this paper we describe, in the case of short messages, an efficient gossiping algorithm for 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. The algorithm requires an optimal number of rounds and a quasi-optimal number of intermediate switch settings to gossip in an $7^i \times 7^i \times 7^i$ torus. %G English %2 https://inria.hal.science/inria-00073769/document %2 https://inria.hal.science/inria-00073769/file/RR-2930.pdf %L inria-00073769 %U https://inria.hal.science/inria-00073769 %~ UNICE %~ CNRS %~ INRIA %~ INRIA-SOPHIA %~ INRIA-RRRT %~ I3S %~ INRIASO %~ INRIA_TEST %~ TESTALAIN1 %~ INRIA2 %~ LARA %~ UNIV-COTEDAZUR