The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—Total exchange (or multiscattering) is one of the important collective communication problems in multiprocessor interconnection networks. It involves the dissemination of distinct messages from every node to every other node. We present a novel theory for solving the problem in any multidimensional (cartesian product) network. These networks have been adopted as cost-effective interconnection structures for distributed-memory multiprocessors. We construct a general algorithm for <it>single-port</it> networks and provide conditions under which it behaves optimally. It is seen that many of the popular topologies, including hypercubes, <it>k</it>-ary <it>n</it>-cubes, and general tori satisfy these conditions. The algorithm is also extended to homogeneous networks with 2<super><it>k</it></super> dimensions and with <it>multiport</it> capabilities. Optimality conditions are also given for this model. In the course of our analysis, we also derive a formula for the <it>average distance</it> of nodes in multidimensional networks; it can be used to obtain almost closed-form results for many interesting networks.</p>
Collective communications, interconnection networks, multidimensional networks, packet-switched networks, total exchange.

V. V. Dimakopoulos and N. J. Dimopoulos, "A Theory for Total Exchange in Multidimensional Interconnection Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 9, no. , pp. 639-649, 1998.
91 ms
(Ver 3.3 (11022016))