A Theory for Total Exchange in Multidimensional Interconnection Networks

Authors:
Vassilios V. Dimakopoulos;Nikitas J. Dimopoulos
Affiliations:
Univ. of Ioannina, Ioannina, Greece;Univ. of Victoria, Victoria, B.C., Canada
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1998

Citing 21
Cited 9

The Performance of Multicomputer Interconnection Networks

Computer
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

IEEE Transactions on Computers
Communication effect basic linear algebra computations on hypercube architectures

Journal of Parallel and Distributed Computing
Parallel and distributed computation: numerical methods

Parallel and distributed computation: numerical methods
A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
Data communication in hypercubes

Journal of Parallel and Distributed Computing
Optimum Broadcasting and Personalized Communication in Hypercubes

IEEE Transactions on Computers
Optimal communication algorithms for hypercubes

Journal of Parallel and Distributed Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Product-shuffle networks: toward reconciling shuffles and butterflies

Discrete Applied Mathematics - Special double volume: interconnection networks
Compiling Fortran D for MIMD distributed-memory machines

Communications of the ACM
Methods and problems of communication in usual networks

Proceedings of the international workshop on Broadcasting and gossiping 1990
Folded Petersen Cube Networks: New Competitors for the Hypercubes

IEEE Transactions on Parallel and Distributed Systems
High Performance Fortran

IEEE Parallel & Distributed Technology: Systems & Technology
Collective Communication in Wormhole-Routed Massively Parallel Computers

Computer
The Banyan-Hypercube Networks

IEEE Transactions on Parallel and Distributed Systems
The Hyper-deBruijn Networks: Scalable Versatile Architecture

IEEE Transactions on Parallel and Distributed Systems
Communication Aspects of the Star Graph Interconnection Network

IEEE Transactions on Parallel and Distributed Systems
Products of Networks with Logarithmic Diameter and Fixed Degree

IEEE Transactions on Parallel and Distributed Systems
Tota; Exchange in Cayley Networks

Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing - Volume I
MPI: A Message-Passing Interface Standard

MPI: A Message-Passing Interface Standard

Toward Optimal Complete Exchange on Wormhole-Routed Tori

IEEE Transactions on Computers
Optimal Total Exchange in Cayley Graphs

IEEE Transactions on Parallel and Distributed Systems
Constructing Edge-Disjoint Spanning Trees in Product Networks

IEEE Transactions on Parallel and Distributed Systems
All-port total exchange in cartesian product networks

Journal of Parallel and Distributed Computing
Capturing an intruder in product networks

Journal of Parallel and Distributed Computing
Multiphase Data Exchange in Distributed Logic-Algebraic Based Processing

IEA/AIE '08 Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence
Resource placement in Cartesian product of networks

Journal of Parallel and Distributed Computing
Single-port and multi-port collective communication operations on single and dual Cell BE processor systems

International Journal of Communication Networks and Distributed Systems
Capturing an intruder in product networks

HiPC'06 Proceedings of the 13th international conference on High Performance Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 single-port networks and provide conditions under which it behaves optimally. It is seen that many of the popular topologies, including hypercubes, k-ary n-cubes, and general tori satisfy these conditions. The algorithm is also extended to homogeneous networks with 2k dimensions and with multiport capabilities. Optimality conditions are also given for this model. In the course of our analysis, we also derive a formula for the average distance of nodes in multidimensional networks; it can be used to obtain almost closed-form results for many interesting networks.