Minimizing Total Communication Distance of a Time-Step Optimal Broadcast in Mesh Networks

Authors:
Affiliations:
Venue:
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Year:
1998

Citing 2
Cited 1

Interconnection Networks: An Engineering Approach

Interconnection Networks: An Engineering Approach
Multicast Communication in Multicomputer Networks

IEEE Transactions on Parallel and Distributed Systems

Fault-Tolerant Broadcasting in 2-D Wormhole-Routed Meshes

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a new minimum total communication distance (TCD) algorithm and an optimal TCD algorithm for broadcast in a 2-dimension mesh. The former generates a minimum TCD from a given source node, and the latter guarantees a minimum TCD among all the possible source nodes. These algorithms can be generalized to a d-dimensional mesh or torus. TCD can potentially be used as a measurement for other types of collective communication operations.