Abstract
A new family of dynamic circuit switching Interconnection Networks is proposed, for connecting resources in parallel processing systems. These networks provide links for any input to any output, under distributed control schemes. Network nodes are build by 2×4/4×2, switches at the first/last stage, and 4×4 nodes in the middle stages. The networks compare favourably to existing non-blocking and blocking networks in terms of area and speed.
Preview
Unable to display preview. Download preview PDF.
References
T.-y. Feng, "A Survey of Interconnection Networks", Computer, pp. 12–27, December 1981.
G. Broomell and J.R Heath, "Classification Categories and Historical Development of Circuit Switching Topologies", Computing Surveys, vol. 15, pp. 95–133, June 1983.
H.J Siegel, Interconnection Networks for Large-Scale Parallel Processing. Lexington Books, 1985.
A.L DeCegama, Parallel Processing Architectures and VLSI Hardware. Prentice Hall 1989.
J. Lenfant, "Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations", IEEE Trans. on Computers, vol. c-27, pp.204–214, July 1978.
V.E Benes, Mathematical Theory of Connecting Networks and Telephone Traffic. Academic Press, 1965.
D. Nassimi and S. Sahni, "A Self-Routing Benes Network and Parallel Permutation Algorithms", IEEE Trans. on Computers, vol. c-30, pp. 21–249, May 1981.
A. Harissis, PhD Thesis in preparation.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Harissis, A., Jam, C., Ambler, A. (1990). Analysis and design of circuit switching interconnection networks using 4×4 nodes. In: Burkhart, H. (eds) CONPAR 90 — VAPP IV. VAPP CONPAR 1990 1990. Lecture Notes in Computer Science, vol 457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53065-7_116
Download citation
DOI: https://doi.org/10.1007/3-540-53065-7_116
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53065-7
Online ISBN: 978-3-540-46597-3
eBook Packages: Springer Book Archive