research-article

Free access

Interconnection networks: a survey and assessment

Author:

Kenneth J. ThurberAuthors Info & Claims

AFIPS '74: Proceedings of the May 6-10, 1974, national computer conference and exposition

Pages 909 - 919

https://doi.org/10.1145/1500175.1500346

Published: 06 May 1974 Publication History

Abstract

As the level of complexity of digital systems increases, the problem of interconnecting subunits is receiving increasing attention. We are reaching the point where processing speed cannot be further improved through the use of faster componentry. Further speed-up of systems will most likely result from changes in the organization and structure of hardware, rather than by raw circuit improvements. Another factor increasing the complexity of systems is the arrival of cheap, powerful LSI microcomputers which allow system construction involving a plurality of processors connected together to perform a specific task. Restructurable system concepts are also very promising, but require extensive amounts of interconnective capability. Thus, bus structures are attracting considerable attention. This paper focuses on a small segment of the general bus structure problem; namely, interconnection (permutation, sorting, etc.) networks.

References

[1]

Joseph, E. C., "Future Computer Architecture in Polysystems," Proceedings of COMPCON 72, pp. 149--153, September 1972.

[2]

Johnson, M. D., et al., "All Semiconductor Distributed Aerospace Processor/Memory Study; Volume II: Description of Alternatives and Trade Offs," Final Report Air Force Contract F33615--72-C-1709, August 1973.

[3]

Wulf, W. A., and C. G. Bell, "C.mmp---A Multi-mini-Processor," Proceedings of the 1972 FJCC, pp. 765--777, December 1972.

Digital Library

[4]

Thurber, K. J., et al., "A Systematic Approach to the Design of Digital Bussing Structures," Proceedings of the 1972 FJCC, pp. 719--740, December 1972.

Digital Library

[5]

Martin, W. A., "Sorting," Computing Surveys, December 1971, pp. 147--174.

Digital Library

[6]

Benes, V. E., "Algebraic and Topological Properties of Connecting Networks," Bell System Technical Journal, pp. 1249--1273, July 1962.

[7]

Benes, V. E., "Permutation Groups, Complexes, and Rearrangeable Connecting Networks," Bell System Technical Journal, pp. 1619--1640, July 1964.

[8]

Benes, V. E., "Optimal Rearrangeable Multistage Connecting Networks," Bell System Technical Journal, pp. 1641--1656, July 1964.

[9]

Benes, V. E., Mathematical Theory of Connecting Networks and Telephone Traffic, Academic Press, New York, 1965.

[10]

Joel, A. E., "On Permutation Switching Networks," Bell System Technical Journal, pp. 813--822, May-June 1968.

[11]

Opferman, D. C. and N. T. Tsao-Wu, "On a Class of Rearrangeable Switching Networks," Bell Systems Technical Journal, pp. 1579--1618, May-June 1971.

[12]

Batcher, K. E., "Sorting Networks and Their Applications," Proceedings of the 1968 SJCC, pp. 307--314.

Digital Library

[13]

Batcher, K. E., "Means for Merging Data," U.S. Patent 3428946, February 18, 1969.

[14]

Kautz, W. H., et al., "Cellular Interconnection Arrays," IEEETC May 1968, pp. 443--451.

Digital Library

[15]

Waksman, A., "A Permutation Network," JACM, January 1968, pp. 159--163.

Digital Library

[16]

Bose, R. C. and R. J. Nelson, "A Sorting Problem," JACM, Sept. 1962, pp. 282--296.

Digital Library

[17]

Thurber, K. J., "Programmable Indexing Networks," Proceedings of the 1970 SJCC, pp. 51--58.

Digital Library

[18]

Thurber, K. J., "Permutation Switching Networks," Proceedings of the 1971 Computer Designer's Conference, January 19--21, 1971, Anaheim, California, pp. 7--24, Industrial and Scientific Conference Management, Chicago, Illinois.

[19]

Tarjan, R., "Sorting Using Networks of Queues and Stacks," JACM, April 1972. pp. 341--346.

Digital Library

[20]

Harada, K., "Sequential Permutation Networks," IEEETC, May 1972, pp. 472--479.

Digital Library

[21]

Bandyopadhyay, S., et al., "A Cellular Permuter Array," IEEETC, October 1972, pp. 1116--1119.

Digital Library

[22]

Smith, B. J., "An Analysis of Sorting Networks," Final Report ONR Contract N00014-70-A-0362-0006, October 1972.

Digital Library

[23]

Lawrie, D. H., Memory-Processor Connection Networks, University of Illinois Report UIUCDCS-R-73-557, February 1973.

[24]

Goke, L. R. and G. J. Lipovski, "Banyan Networks for Partitioning Multiprocessor Systems," 1st Annual Computer Architecture Conference, Gainsville, Florida, December 1973, pp. 21--28.

Digital Library

[25]

Rohrbacher, D. L., Advanced Computer Organization Study: Volume 1---Basic Report, Volume 2---Appendixes, Air Force Contract AF 30(602)-3550, April 1966, AD 631870 and AD 631871.

[26]

Thurber, K. J. and J. W. Myrna, "System Design of a Cellular APL Machine," IEEETC, April 1970, pp. 291--303.

Digital Library

[27]

Pease, M. C., "An Adaption of the Fast Fourier Transform to Parallel Processing," JACM, pp. 252--264, April 1968.

Digital Library

[28]

Stone, H. S., "Parallel Processing with the Perfect Shuffle," IEEETC, pp. 153--161, February 1971.

Digital Library

[29]

Stone, H. S., "Dynamic Memories with enhanced data access," IEEETC, pp. 359--366, April 1972.

[30]

Gold, D. E., "Applications of Some Switching Network Results to Dynamic Allocation of Memories in a Hierarchy," COMPCON 72, pp. 127--129.

[31]

Kuck, D. J., et al., "Interconnection Networks for Processors and Memories in Large Systems," COMPCON 72, pp. 131--134.

[32]

Wong, C. K. and P. C. Yue, "The Anticipatory Control of a Cyclically Permutable Memory," IEEETC, May 1973, pp. 481--488.

Digital Library

[33]

Liu, C. L., "Construction of Sorting Plans," Theory of Machines and Computations, pp. 87--98 (eds. Z. Kohavi and A. Paz) Academic Press, New York, 1971.

[34]

Van Voorhis, D. C., A Lower Bound for Sorting Networks that use the Divide-Sort-Merge Strategy, Stanford Digital Systems Laboratory Technical Report No. 17, August 1971.

Digital Library

[35]

Levitt, K. N., et al., "A Study of the Data Communication Problems in a Self-Repairable Multiprocessor," Proceedings of the 1968 SJCC, pp. 515--527.

Digital Library

[36]

Clos, C., "A Study of Non-Blocking Switching Networks," Bell System Technical Journal, March 1963, pp. 406--424.

[37]

Tsao-Wu, N. T., and D. C. Opferman, "On Permutation Algorithms for Rearrangeable Switching Networks," Conference Record 1969 IEEE International Conference On Communications, pp. 10.29--10.34.

[38]

Kautz, W. H. and J. Turner, "Universal Connecting Networks and the Synthesis of Canonical Sequential Circuits," Proceedings of the 9th Annual Symposium on Switching and Automata Theory, pp. 257--268, 1968.

Digital Library

[39]

Elspas, B., "Topological Constraints on Interconnection-limited logic," Proceedings of the 5th Annual Symposium on Switching Circuit Theory and Logical Design, pp. 133--137, 1964.

Digital Library

[40]

Joel, A. E., Relay Permutation Type Switching System, U.S. Patent 2,625,610 January 13, 1953.

[41]

Moore, E. F., Relay Selecting Circuit, U.S. Patent 2,864,008, December 9, 1958.

[42]

Kautz, W. H., et al., Cellular Logic-in-Memory Arrays, Final Report ONR Contract NONR-4833(00), May 1970.

[43]

Waksman, A., "On Permutation Networks," Proceedings of the Hawaii International Conference on System Sciences, January 1968, pp. 581--582.

[44]

Kautz, W. H., "Cellular Logic-in-Memories," IEEETC, August 1969, pp. 719--727.

Digital Library

[45]

Lipovski, G. J., "The Architecture of a Large Associative Processor," Proceedings of the 1970 SJCC, pp. 385--396.

Digital Library

[46]

Kautz, W. H., "The Design of Optimum Interconnection Networks for Multiprocessors," Structure et Conception des Ordinateurs Architecture and Design of Digital Computers, (ed. Guy Boulaye), Ecole dete de 1 O.T.A.N. A N.A.T.O. Advanced Summer Institute 1969, Dunob, Paris, 1971.

[47]

Elspas, B., et al., Theory of Cellular Logic Networks and Machines, Final Report Contract F19628--68-C-0262, 1968.

[48]

Fuller, S. H., and D. P. Siewiorek, "Some Observations on Semiconductor Technology and the Architecture of Large Digital Modules," Computer, October 1973, pp. 15--21.

Cited By

Amodu OOthman MYunus NHanapi Z(2021)A Primer on Design Aspects and Recent Advances in Shuffle Exchange Multistage Interconnection NetworksSymmetry10.3390/sym1303037813:3(378)Online publication date: 26-Feb-2021
https://doi.org/10.3390/sym13030378
Yadav SMishra RGupta U(2015)Performance evaluation of different versions of 2D Torus network2015 International Conference on Advances in Computer Engineering and Applications10.1109/ICACEA.2015.7164691(178-182)Online publication date: Mar-2015
https://doi.org/10.1109/ICACEA.2015.7164691
Chen X(2007)A survey of multistage interconnection networks in fast packet switchesInternational Journal of Digital & Analog Communication Systems10.1002/dac.45100401054:1(33-59)Online publication date: 21-Mar-2007
https://doi.org/10.1002/dac.4510040105
Show More Cited By

Interconnection networks: a survey and assessment
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory

Recommendations

High-radix interconnection networks
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, ...
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 ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

AFIPS '74: Proceedings of the May 6-10, 1974, national computer conference and exposition

May 1974

1083 pages

ISBN:9781450379205

DOI:10.1145/1500175

Copyright © 1974 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

AFIPS: American Federation of Information Processing Societies

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 May 1974

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
307
Total Downloads

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

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Amodu OOthman MYunus NHanapi Z(2021)A Primer on Design Aspects and Recent Advances in Shuffle Exchange Multistage Interconnection NetworksSymmetry10.3390/sym1303037813:3(378)Online publication date: 26-Feb-2021
https://doi.org/10.3390/sym13030378
Yadav SMishra RGupta U(2015)Performance evaluation of different versions of 2D Torus network2015 International Conference on Advances in Computer Engineering and Applications10.1109/ICACEA.2015.7164691(178-182)Online publication date: Mar-2015
https://doi.org/10.1109/ICACEA.2015.7164691
Chen X(2007)A survey of multistage interconnection networks in fast packet switchesInternational Journal of Digital & Analog Communication Systems10.1002/dac.45100401054:1(33-59)Online publication date: 21-Mar-2007
https://doi.org/10.1002/dac.4510040105
(1990)ReferencesTREAT10.1016/B978-0-273-08793-9.50017-0(138-143)Online publication date: 1990
https://doi.org/10.1016/B978-0-273-08793-9.50017-0
Mazumder P(1987)Evaluation of On-Chip Static Interconnection NetworksIEEE Transactions on Computers10.1109/TC.1987.167691036:3(365-369)Online publication date: 1-Mar-1987
https://dl.acm.org/doi/10.1109/TC.1987.1676910
Esfahanian AHakimi S(1985)Fault-Tolerant Routing in DeBruijn Comrnunication NetworksIEEE Transactions on Computers10.1109/TC.1985.167663334:9(777-788)Online publication date: 1-Sep-1985
https://dl.acm.org/doi/10.1109/TC.1985.1676633
Oruc A(1984)A Classification of Cube-Connected Networks with a Simple Control SchemeIEEE Transactions on Computers10.1109/TC.1984.500937033:8(769-772)Online publication date: 1-Aug-1984
https://dl.acm.org/doi/10.1109/TC.1984.5009370
Franklin MWann DThomas W(1982)Pin Limitations and Partitioning of VLSI Interconnection NetworksIEEE Transactions on Computers10.1109/TC.1982.167592731:11(1109-1116)Online publication date: 1-Nov-1982
https://dl.acm.org/doi/10.1109/TC.1982.1675927
Armstrong JGray F(1981)Fault Diagnosis in a Boolean n Cube Array of MicroprocessorsIEEE Transactions on Computers10.1109/TC.1981.167584430:8(587-590)Online publication date: 1-Aug-1981
https://dl.acm.org/doi/10.1109/TC.1981.1675844
Wittie L(1981)Communication Structures for Large Networks of MicrocomputersIEEE Transactions on Computers10.1109/TC.1981.167577430:4(264-273)Online publication date: 1-Apr-1981
https://dl.acm.org/doi/10.1109/TC.1981.1675774
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

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

Figures

Tables

Media

View Table of Conten