A tabular method for verification of data exchange algorithms on networks of parallel processors

Authors:
K. Coolsaet;V. Fack;H. De Meyer
Affiliations:
Department of Pure Mathematics, University of Gent, Galglaan 2, B-9000 Gent Belgium;Department of Applied Mathematics and Computer Science, University of Gent, Krijgslaan 281-S9, B-9000 Gent, Belgium;Department of Applied Mathematics and Computer Science, University of Gent, Krijgslaan 281-S9, B-9000 Gent, Belgium
Venue:
Nordic Journal of Computing
Year:
1994

Citing 5
Cited 0

Interconnection Networks Based on a Generalization of Cube-Connected Cycles

IEEE Transactions on Computers
Parallel and distributed computation: numerical methods

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

IEEE Transactions on Computers
A unified approach to off-line permutation routing on parallel networks

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Optimal algorithms for total exchange without buffering on the hypercube

BIT

Quantified Score

Hi-index	0.00

Visualization

Abstract

A tabular method for verification of data exchange algorithms on networks which possess a certain symmetry (whose underlying graph is a Cayley graph) is given. The algorithms use no intermediate buffering of messages.To illustrate this method, optimal total exchange (i.e., all-to-all personalised) algorithms are given for several much-used processor configurations, such as ring networks, the hypercube and symmetric meshes with wrap-around (two and three-dimensional). To the best of our knowledge the latter are new.