The higher radix hypercube as an interconnection and virtual network
Authors: 
T.-C. Lin, P. GuptaAuthors Info & Claims
Pages 260 - 268
Abstract
The HIGHER RADIX HYPERCUBE (HRH) is investigated in this paper as an interconnection network for multiprocessors as well as a virtual network. The HRH is based on a radix higher than two, the radix for the hypercube. We have compared several topological parameters' for the HRH with the hypercube. It can be seen that HRH provides smaller diameter for a small price. A mapping and a partitioning algorithms are proposed for mapping different topologies to the HRH. In our algorithm, we first map the problem topology to a virtual HRH, which is the most natural HRH for the problem. The virtual HRH is then transformed into the actual topology. This algorithm is applicable to HRH used either as an interconnection or a virtual network. The partitioning algorithm reduces a large application topology to the required size by the iterative reduction process. Three examples of mapping topologies onto the HRH are also presented.
References
[1]
J.P. Hayes, T.N. Mudge and Q.F. Stout, "Architecture of a Hypercube Supercomputer," Proc. 1986 Intl. conf.- on Parallel Processing, August 1986, p p . 653-660.
[2]
Charles L. Seitz,"The Cosmic cube," Communications o f t h e ACM, J a n . 1985, Vol . 28, No 1, pp 22-33 .
[3]
Kai Hwang and Joydeep Ghosh, "Hypernet Architectures for Parallel Processing," Proc. 1987 Intl. conf. on Parallel Processing, August 1987, pp. 810-819.
[4]
William Tsun-yuk Hsu, Pen-Chung Yew and Chuan-qi Zhu, "An Enhancement Scheme for Hypercube Interconnection Networks," Proc. 1987 Intl. conf. on Parallel Processing, August 1987, pp. 820-823.
[5]
Laxmi N. Bhuyan and Dharma P. Agrawal, "Generalized Hypercube and Hyperbus Structures for a Computer Network," IEEE Tran-s. on Computers, April 1984, Vol. C-33, No. 4, pp. 323-333.
[6]
Shahid E. Bokhari, "On the mapping problem," Proc. 1979 Intl. conf. on Parallel Processing, August 1979, pp. 239-247.
[7]
Francine Berman, Lawrence Snyder, "On mapping algorithms into parallel computers," Intl. conf. on Parallel Processing, August 1984, pp. 307-309.
[8]
D. A. Reed, L. M. Adams, and M. L. Patrick, "Stencils and Problem Partitionings: Their Influence on the Performance of Multiple Processor Systems", IEEE Transactions of Computers, July 1987, Vol. C-36, No. 7, pp. 845-858.
[9]
Russ Miller and Quentin F. Stout, "Computational Geometry on a meshconnected computer (Preliminary version)", Proc. 1984 Intl. conf. on Parallel Processing, August 1984, pp. 66 -7 3 .
[10]
V.K.P. Kumar and M.M. Eshaghian, "Parallel Geometric Algorithm for Digitized Pictures on Mesh of Trees (Preliminary version)", Proc. 1986 Intl. conf. on Parallel Processing, August 1986, pp. 270-273.
[11]
Russ Miller and Quentin F. Stout, "Convexity algorithms for pyramid computers," Proc. 1984 Intl. conf. on Parallel Processing, August 1984, pp. 177-184.
[12]
Praveen Gupta, "TECHNIQUES FOR MAPPING THE ALGORITHMS INTO THE HIGHER RADIX HYPERCUBE MULTIPROCESSORS", M.S. Thesis, May 1988, The University of Texas at Arlington, Arlington, TX.
[13]
T. C. Lin, "Virtual Network and Mapping Problem", CSE Technical Report TR-03, UTA, May 1987.
Index Terms
- The higher radix hypercube as an interconnection and virtual network
Recommendations
Scalable high-radix router microarchitecture using a network switch organization
As the system size of supercomputers and datacenters increases, cost-efficient networks become critical in achieving good scalability on those systems. High-radix routers reduce network cost by lowering the network diameter while providing a high ...
On the hierarchical hypercube interconnection network
IPPS '93: Proceedings of the 1993 Seventh International Parallel Processing SymposiumThe paper explores the hierarchical hypercube (HHC) interconnection network, suitable for building massively parallel systems with thousands of processors. HHC is self-embedded, that is, an HHC can embed HHCs of lower dimensions. In addition, HHC is a ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 1989 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 21 February 1989
Check for updates
Qualifiers
- Article
Conference
ICMI05
Sponsor:
ICMI05: Seventh International Conference on Multimodal Interfaces 2005
February 21 - 23, 1989
Kentucky, Louisville
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 245Total Downloads
- Downloads (Last 12 months)45
- Downloads (Last 6 weeks)5
Reflects downloads up to 16 Nov 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in