Time-Step Optimal Broadcasting in 3-D Meshes with Minimum Total Communication Distance

In this paper we propose a new minimum total communication distance T CD algorithm and an optimal T CD algorithm for broadcast in a 3-dimensional mesh 3-D mesh. The former generates a minimum T CD from a given source node, and the latter guarantees a minimum T CD among all the possible source nodes. These algorithms are based on a divide-and-conquer approach where a 3-D mesh is partitioned into eight submeshes of equal size. The source node sends the broadcast message to a special node called an eye in each submesh. The above procedure is then recursively applied in each submesh. These algorithms can be generalized to a d-dimensional mesh or torus. In addition, the proposed approach can potentially be used to solve optimization problems in other collective communication operations.

• Type: Journal
• Year: 2000
• Where: JPDC
• Authors: Songluan Cang, Jie Wu
• Keywords: 3-D Mesh, CD Algorithm, JPDC 2000, Source Nodes