Abstract
This paper discussed two aspects of the use of the Clos networks for high capacity statistical switching. A self routing algorithm was described for the general s staged Clos network, as well as for a special case of the Clos network for which the routing is simpler. The topological VLSI area complexity of the Clos network was also studied and was found to be comparable in many instances to that of the crossbar network. This is true even though the number of crosspoints in the Clos network is usually less than that of the crossbar.
F. Makedon is currently with the Department of Computer Science, University of Texas-Dallas, Richardson, TX, 75083-0688.
W. R. Daasch is currently with the Department of Electrical Engineering, Portland State University, Portland, OR 97207.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
C. Clos, "A Study of Non-Blocking Switching Networks," Bell System Technical Journal No. 32, pp. 406–424, 1953.
D. Nassimi and S. Sahni, "A Self-Routing Benes Network and Parallel Permutation Algorithms," IEEE Trans. on Comp., Vol. C-30, No. 5, May 1981, pp. 332–340.
K. E. Batcher, "Sorting Networks and Their Applications," Proc. AFIPS 1968 SJCC, Vol. 32, AFIPS Press, pp. 307–314.
W. A. Payne, Complexity and Performance of Statistically Switched Interconnection Networks, PhD Dissertation, Dept. of Elec. Eng., Illinois Inst. of Tech., 1986.
V. E. Benes, "Algebraic and Topological Properties of Connecting Networks," Bell System Technical Journal No. 41, 1962.
V. E. Benes, Mathematical Theory of Connecting Networks and Telephone Traffic, Academic Press, 1965.
C. D. Thompson, A Complexity Theory for VLSI, Phd Dissertation, Dept. of Comp. Sci., Carnegie-Mellon Univ., 1980.
D. Hoey and C. E. Leiserson, "A Layout for the Shuffle-Exchange Network," Proc. of the 1980 IEEE Int. Conf. on Parallel Processing, August 1980.
D. Kleitman, F. T. Leighton, M. Lepley, and G. L. Miller, "New Layouts for the Shuffle-Exchange Graph," Proc. 13th ACM Symp. on the Theory of Computing, May 1981.
F. T. Leighton, "Optimal Layouts for Small Shuffle-Exchange Graphs," VLSI 81, edited by John P. Gray, Academic Press, London, August 1981.
F. T. Leighton, Layouts for the Shuffle-Exchange Graph and Lower Bound Techniques for VLSI, PhD Dissertation, MIT, June 1982.
L. R. Goke and G. J. Lipovski, "Banyan Networks for Partitioning Multiprocessor Systems," Proc. 1st Annual Computer Architecture Conference, Dec. 1973.
M. Franklin, "VLSI Performance Comparison of Banyan and Crossbar Communications Networks," IEEE Trans. on Computers, April 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Payne, W.A., Makedon, F., Daasch, W.R. (1988). High speed interconnection using the clos network. In: Houstis, E.N., Papatheodorou, T.S., Polychronopoulos, C.D. (eds) Supercomputing. ICS 1987. Lecture Notes in Computer Science, vol 297. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18991-2_7
Download citation
DOI: https://doi.org/10.1007/3-540-18991-2_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18991-6
Online ISBN: 978-3-540-38888-3
eBook Packages: Springer Book Archive