Efficient Communication in Metacube: A New Interconnection Network

Authors:
Affiliations:
Venue:
ISPAN '02 Proceedings of the 2002 International Symposium on Parallel Architectures, Algorithms and Networks
Year:
2002

Citing 0
Cited 4

Hypercube and Its Variant Networks: A Topological Evaluation

HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
An Efficient Parallel Sorting Algorithm on Metacube Multiprocessors

ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
X-torus: a variation of torus topology with lower diameter and larger bisection width

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
Bitonic sort on a chained-cubic tree interconnection network

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a new interconnection network for very large parallel computers called metacube (MC). An MC network has a 2-level cube structure. An MC(k,m) network connects 2^{m2^k+k} nodes with m+k links per node, where k is the dimension of a high-level cube and m is the dimension of low-level cubes (clusters). An MC network is a symmetric network with short diameter, easy and efficient routing similar to that of hypercubes. However, an MC network can connect more than one hundred of millions of nodes with only 6 links per node, Design of efficient routing algorithms for collective communications is the key issue for any interconnection network. In this paper, we also show that total exchange (all-to-all personalized communication) can be done efficiently in metacube.