Article

Free access

The composite binary cube — a family of interconnection networks for multiprocessors

Author:

Krishnan PadmanabhanAuthors Info & Claims

ICS '89: Proceedings of the 3rd international conference on Supercomputing

Pages 62 - 71

https://doi.org/10.1145/318789.318797

Published: 01 June 1989 Publication History

Abstract

A class of interconnection networks called composite binary n-cube networks is presented in this paper for multiprocessors. These networks provide a spectrum of performance levels (measured in terms of message delays or network bandwidth) at different switching costs. At the low end of this spectrum is a structure called the expanded indirect binary n-cube (a multistage network), and at the high end is the well known hypercube structure. All members of this class have the same external connectivity between nodes, but utilize different internal switching architectures within the nodes. The distributed control algorithm for these networks is similar to those for multistage and hypercube architectures. An analytical model for the performance of these networks is also presented in this paper. Results of this model show that message delays decrease by about 40% from the low end architecture to the high end of the spectrum; however, the improvements in performance diminish near the high end. Thus for best performance/cost ratios within this class, our studies indicate that an intermediate architecture needs to be chosen.

References

[1]

S. Abraham and K. Padmanabhan, "Performance of the Dixect Binary n-Cube Network for Multiprocessors," Proc. J986 Int. Conf. Parallel Processing, Aug. 1986, pp 636-639.

[2]

G.H. Barnes and S.F. Lundstrom, "Design and Validation of a Connection Network for Many-Processor Multiprocessor Systems," Computer, Vol. 14, No. 12, Dec. 1981, pp 31-41.

Digital Library

[3]

P-Y. Chen, P-C. Yew, and D.H. Lawrie, "Performance of Packet Switching in Buffered Single-Stage Shuffle- Exchange Networks," Proc. 3rd Int. Conf. Distributed Computing, May, 1982, pp 622-627.

[4]

W.J. Dally and C.L. Seitz, "Deadlock-Free Message Routing in Multiprocessor Interconnection Networks," IEEE Trans. Computers, Vol. C-36, No. 5, May 1987, pp 547- 553.

Digital Library

[5]

G. Fox, et. al., Solving Problems on Concurrent Processors, Vol. I, Prentice Hall, Englewood Cliffs, 1988.

Digital Library

[6]

D. Gajski, D. Kuck, D. Lawrie, and A. Sameh, "Cedar A Large Scale Multiprocessor," Proc. 1983 int. Conf. Parallel Processing, Aug. 1983, pp 524-529.

[7]

A. Gotfiieb and I. Schwartz, "Networks and Algorithms for Very-Large-Scale Parallel Computation," Computer, Vol. 15, No. 1, Jan. 1982, pp 27-36.

Digital Library

[8]

L. Kleinrock, Queueing Systems, Vol. i, John Wiley and Sons, New York, 1975 (Chapter 5).

Digital Library

[9]

C.P. Kmskal and M. Snir, "The Performance of Multistage Interconnection Networks for Multiprocessors," IEEE Transactions on Computers, Vol. C-32, No. 12, Dec. 1983, pp 1091-1098.

[10]

D.I. Kuck, The Structure of Computers and Computations, Vol. 1, John Wiley and Sons, New York, 1978 (Chapter 2).

Digital Library

[11]

K. Padmanabhan, "Towards a Synthesis of Direct and Indirect Cube Structures for Multiprocessors," Proc. 8th Ann. IEEE Int. Phoenix Conf. on Computers and Communications, March !989,

[12]

J.H. Patel, "Performance of Processor-Memory Interconnecfions for Multiprocessors," IEEE Trans. Computers, Vol. C-30, No. 10, Oct. 1981, pp 771-780.

[13]

M.C. Pease, I~ "The Indirect Binary n-Cube Microprocessor Array," IEEE Trans. Compur, Vol. C-Z~5, No. 5, May 1977, pp 458-473.

[14]

C. Seitz, "The Cosmic Cube," Comm. ACM, Vol. 28, No. 1, Jan. 1985, pp 22-33.

Digital Library

[15]

H. Sullivan and T.R. Bashkow, "A Large Scale, Homogeneous, Fully Distributed Parallel Machine, I," Proc. 4~h Syrup. Comp. Arch., March 1977, pp 105-I 17.

Digital Library

[16]

C.-L.Wu and T.-Y. Feng, "On a Class of Multistage Interconnection Networks," {EEE Trans. Comput., Vol. C-29, No. 8, Aug. 1980, pp 694-702.

Cited By

Jin EReidys C(2011)Random induced subgraphs of Cayley graphs induced by transpositionsDiscrete Mathematics10.1016/j.disc.2011.07.027311:21(2496-2511)Online publication date: 1-Nov-2011
https://dl.acm.org/doi/10.1016/j.disc.2011.07.027
Padmanabhan K(1990)Cube structures for multiprocessorsCommunications of the ACM10.1145/76372.7637633:1(43-52)Online publication date: 3-Jan-1990
https://dl.acm.org/doi/10.1145/76372.76376
Padmanabhan K(1990)Hierarchical communication in cube-connected multiprocessorsProceedings.,10th International Conference on Distributed Computing Systems10.1109/ICDCS.1990.89294(270-277)Online publication date: 1990
https://doi.org/10.1109/ICDCS.1990.89294

Index Terms

The composite binary cube — a family of interconnection networks for multiprocessors

Recommendations

Performance Analysis of k-ary n-cube Interconnection Networks

VLSI communication networks are wire-limited, i.e. the cost of a network is not a function of the number of switches required, but rather a function of the wiring density required to construct the network. Communication networks of varying dimensions ...
Design Exploration of Optical Interconnection Networks for Chip Multiprocessors
HOTI '08: Proceedings of the 2008 16th IEEE Symposium on High Performance Interconnects

The Network-on-Chip (NoC) paradigm has emerged as a promising solution for providing connectivity among the increasing number of cores that get integrated into both systems-on chip(SoC) and chip multiprocessors (CMP). In future high performance CMPs, ...
The Performance of Multistage Interconnection Networks for Multiprocessors

This paper studies the performance of unbuffered and buffered, packet-switching, multistage interconnection networks. We begin by reviewing the definition of banyan networks and introducing some generalizations of them. We then present an asymptotic ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ICS '89: Proceedings of the 3rd international conference on Supercomputing

June 1989

484 pages

ISBN:0897913094

DOI:10.1145/318789

Chairmen:
George Paul
IBM
,
T. Papatheodorou
CTI, Greese
,
D. Gannon,
E. N. Pudue

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

AICA: Assoc Italianai de Calcolo Automatico
Computer Tech Inst.: Computer Technology Institute
SIGARCH: ACM Special Interest Group on Computer Architecture
SIAM: Society for Industrial and Applied Mathematics

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ICS89

Sponsor:

AICA
Computer Tech Inst.
SIGARCH
SIAM

ICS89: International Conference on Supercomputing 89

June 5 - 9, 1989

Crete, Greece

Acceptance Rates

Overall Acceptance Rate 629 of 2,180 submissions, 29%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
333
Total Downloads

Downloads (Last 12 months)41
Downloads (Last 6 weeks)16

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Jin EReidys C(2011)Random induced subgraphs of Cayley graphs induced by transpositionsDiscrete Mathematics10.1016/j.disc.2011.07.027311:21(2496-2511)Online publication date: 1-Nov-2011
https://dl.acm.org/doi/10.1016/j.disc.2011.07.027
Padmanabhan K(1990)Cube structures for multiprocessorsCommunications of the ACM10.1145/76372.7637633:1(43-52)Online publication date: 3-Jan-1990
https://dl.acm.org/doi/10.1145/76372.76376
Padmanabhan K(1990)Hierarchical communication in cube-connected multiprocessorsProceedings.,10th International Conference on Distributed Computing Systems10.1109/ICDCS.1990.89294(270-277)Online publication date: 1990
https://doi.org/10.1109/ICDCS.1990.89294

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents