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 imes 7^i imes 7^i$ torus.
展开▼
机译：在本文中，我们描述了在短消息的情况下，使用同步电路交换路由的3维环形网络（环绕式或环形网格）的有效八卦算法。该算法基于圆环的递归分解。该算法需要一个最佳的回合次数和一个中间开关设置的准最优数目，以在$ 7 ^ i times 7 ^ i times 7 ^ i $圆环中传播闲话。
展开▼
