This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Design Principles for Practical Self-Routing Nonblocking Switching Networks with O(N · log N) Bit-Complexity
October 1997 (vol. 46 no. 10)
pp. 1057-1069

Abstract—Principles for designing practical self-routing nonblocking N×N circuit-switched connection networks with optimal θ(N· log N) hardware at the bit-level of complexity are described. The overall principles behind the architecture can be described as "Expand-Route-Contract." A self-routing nonblocking network with w-bit wide datapaths can be achieved by expanding the datapaths to w + z independent bit-serial connections, routing these connections through self-routing networks with blocking, and by contracting the data at the output and recovering the w-bit wide datapaths. For an appropriate redundancy z, the blocking probability can be made arbitrarily small and the fault tolerance arbitrarily high. By using efficient space domain concentrators, the architecture yields self-routing nonblocking switching networks with an optimal O(N· log N) bits of memory or O(N· log N· log log log N) logic gates. By using a linear-cost time domain concentrator, the architecture yields self-routing nonblocking switching networks with an optimal θ(N· log N) bits of memory or logic gates. These designs meet Shannon's lower bound on memory requirements, established in the 1950s. The number of stages of crossbars can match the theoretical minimum, which has not been achieved by previous self-routing networks. The architecture is feasible with existing electrical or optical technologies. The designs of electrical and optical switch cores with Terabits of bisection bandwidth for Networks-of-Workstations (NOWs) are described.

[1] M. Ajtai,J. Komlos,W.L. Steiger, and E. Szemeredi,"An O(n log n) sorting network," Proc. Ann. ACM Symp. Theory of Computing, pp. 1-9, 1983.
[2] ARPA/COOP/AT&T Hybrid-SEED Workshop Notes, George Mason Univ., July 1995.
[3] S. Arora,T. Leighton,, and B. Maggs,“On line algorithms for path selection in a nonblocking network,” Proc. 22nd Ann. ACM Symp. Theory of Computing, pp. 149-158, 1990.
[4] B.D. Alleyne and I. Scherson, "Expanded Delta Networks for Very Large Parallel Computers," Proc. Int'l Conf. Parallel Processing, pp. 127-131, 1992.
[5] A. Bassalygo and M.S. Pinsker, "Complexity of Optimum Nonblocking Switching Network without Reconnections," Problems of Information Transmission, vol. 9, pp. 64-66, 1974.
[6] K.E. Batcher, "Sorting Networks and Their Applications," Proc. 1968 Spring Joint Computer Conf., 1968.
[7] M.V. Chien and A.Y. Oruc, "Adaptive Binary Sorting Schemes and Associated Interconnection Networks," Proc. Int'l Conf. Parallel Processing, pp. 289-293, 1992.
[8] T.J. Cloonan, G.W. Richards, A.L. Lentine, F.B. McCormick, and J.R. Erickson, "Free-Space Photonic Switching Architectures Based on Extended Generalized Shuffles," Applied Optics, vol. 31, no. 35, pp. 7,471-7,492, Dec. 1992.
[9] T.J. Cloonan, "Comparative Study of Optical and Electronic Interconnection Technologies for Large Asynchronous Transfer Mode Packet Switching Applications," Optical Eng., vol. 33, no. 5, pp. 1,512-1,523, May 1994.
[10] G.A. De Biase, C. Ferrone, and A. Massini, "An O(logN) Depth Asymptotically Nonblocking Self Routing Permutation Network," IEEE Trans. Computers, vol. 44, no. 8, pp. 1,047-1,051, Aug. 1995.
[11] B.G. Douglass,"Rearrangeable Three-Stage Interconnection Networks and Their Routing Properties," IEEE Trans. Computers, vol. 42, no. 5, pp. 559-567, May 1993.
[12] H.S. Hinton, T.J. Cloonan, F.B. McCormick, A.L. Lentine, and F.A.P. Tooley, "Free-Space Digital Optical Systems," Proc. IEEE, vol. 82, no. 11, pp. 1,632-1,649, Nov. 1994.
[13] W. Hoeffding, "On the Distribution of the Number of Successes in Independent Trials," Annals of Math. Statistics, vol. 27, pp. 713-721, 1956.
[14] A. Huang and S. Knauer, "Starlite: A Wideband Digital Switch," Proc. Globecom, Dec. 1988.
[15] C.Y. Jan and A.Y. Oruç, “Fast Self-Routing Permutation Switching on an Asymptotically Minimum Cost Network,” IEEE Trans. Computers, vol. 42, no. 12, pp. 1,469-1,479, Dec. 1993.
[16] R. Kannan, H.F. Jordan, K.Y. Lee, and C. Reed, "A Bit-Controlled MultiChannel Time Slot Permutation Network," Proc. Second Int'l Conf. Massively Parallel Processing Using Optical Interconnects, pp. 271-278, 1995.
[17] D.M. Koppelman and A.Y. Oruç, “A Self-Routing Permutation Network,” J. Parallel and Distributed Computing, vol. 10, no. 10, pp. 140-151, Oct. 1990.
[18] A.V. Krishnamoorthy and D.A.B. Miller, "Scaling Optoelectronic-VLSI Circuits into the 21st Century: A Technology Roadmap," IEEE J. Selected Topics in Quantum Electronics, vol. 2, no. 1, pp. 55-76, Apr. 1996.
[19] C.P. Kruskal and M. Snir, "The Performance of Multistage Interconnection Networks for Multiprocessors," IEEE Trans. Computers, vol. 32, no. 12, pp. 1,091-1,098, Dec. 1983.
[20] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[21] A.L. Lentine et al., "700 Mb/s Operation of Optoelectronic Switching Nodes Comprised of Flip-Chip-Bonded GaAs/AlGaAS MQW Modulators and Detectors on Silicon CMOS Circuitry," Proc. Conf. Lasers and Electrooptics, 1995.
[22] T. Lewis, “The Next$10,000_2$Years,” Computer, pp. 64-70, May 1996.
[23] D. Mitra and R.A. Cieslak, "Randomized Parallel Communications on an Extension of the Omega Network," J. ACM, vol. 34, pp. 802-824, 1987.
[24] Motorola, "OPTOBUS Data Sheet," Logic Integrated Circuits Division, 1995.
[25] D. Nassimi and S. Sahni, “Parallel Permutation and Sorting Algorithms and a New Generalized Connection Network,” J. ACM, vol. 29, no. 3, pp. 642-667, July 1982.
[26] J.H. Patel, "Performance of Processor-Memory Interconnections for Multiprocessors," IEEE Trans. Computers, vol. 30, no. 10, pp. 771-780, Oct. 1981.
[27] J.L. Hennessey and D.A. Patterson, Computer Architecture, A Quantatative Approach, second edition. San Francisco: Morgan-Kauffman, 1995.
[28] Semiconductor Industry Association, "The National Technology Roadmap for Semiconductors,"San Jose, Calif.: SIA, 1994.
[29] C.E. Shannon, "Memory Requirements in a Telephone Exchange," Bell. Systems Technical J., 1953.
[30] S. Sherif, T.H. Szymanski, and H.S. Hinton, "Design and Implementation of a Field Programmable Smart Pixel Array," Proc. LEOS 96 Conf. Smart Pixels,Keystone, Colo., Aug. 1996.
[31] B. Supmonchai and T.H. Szymanski, "Fast Self-Routing Concentrators for Optoelectronic Systems," submitted.
[32] T.H. Szymanski and V.C. Hamacher, "On the Universality of Multipath Multistage Interconnection Networks," Interconnection Networks, I. Scherson and Youseff, eds., IEEE CS Press, 1994.
[33] T.H. Szymanski and C. Fang, "Randomized Routing of Virtual Connections in Essentially Nonblocking log N-Depth Networks," IEEE Trans. Comm., pp. 2,521-2,531, Sept. 1995.
[34] T.H. Szymanski and H.S. Hinton, "Reconfigurable Intelligent Optical Backplane for Parallel Computing and Communications," Applied Optics, pp. 1,253-1,268, Mar. 1996.
[35] C.D. Thompson, "Generalized Connection Networks for Parallel Processor Intercommunication," IEEE Trans. Computers, vol. 27, no. 12, pp. 1,119-1,125, Dec. 1978.
[36] U.S. National Science Foundation, "Research Priorities in Networking and Communications," Report to the NSF Division of Networking and Communications Research and Infrastructure, May12-14, 1994,Arlington, Va.
[37] E. Upfal, S. Felperin, and M Snir, "Randomized Routing with Shorter Paths," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 4, pp. 356-362, Apr. 1996.
[38] L.G. Valiant and G.J. Brebner,"Universal Schemes for Parallel Communication," Proc. 13th Ann. ACM Symp. Theory of Computing, pp. 263-277, May 1981.
[39] M. Yamaguchi and K-I Yukimatsu, "Recent Free-Space Photonic Switches," IEICE Trans. Comm., vol. E77B, no. 2, Feb. 1994.

Index Terms:
Multistage, networks, self-routing, nonblocking, circuit-switching, scalable, randomization, electrical, optical.
Citation:
Ted H. Szymanski, "Design Principles for Practical Self-Routing Nonblocking Switching Networks with O(N · log N) Bit-Complexity," IEEE Transactions on Computers, vol. 46, no. 10, pp. 1057-1069, Oct. 1997, doi:10.1109/12.628391
Usage of this product signifies your acceptance of the Terms of Use.