
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ted H. Szymanski, "Design Principles for Practical SelfRouting Nonblocking Switching Networks with O(N · log N) BitComplexity," IEEE Transactions on Computers, vol. 46, no. 10, pp. 10571069, October, 1997.  
BibTex  x  
@article{ 10.1109/12.628391, author = {Ted H. Szymanski}, title = {Design Principles for Practical SelfRouting Nonblocking Switching Networks with O(N · log N) BitComplexity}, journal ={IEEE Transactions on Computers}, volume = {46}, number = {10}, issn = {00189340}, year = {1997}, pages = {10571069}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.628391}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Design Principles for Practical SelfRouting Nonblocking Switching Networks with O(N · log N) BitComplexity IS  10 SN  00189340 SP1057 EP1069 EPD  10571069 A1  Ted H. Szymanski, PY  1997 KW  Multistage KW  networks KW  selfrouting KW  nonblocking KW  circuitswitching KW  scalable KW  randomization KW  electrical KW  optical. VL  46 JA  IEEE Transactions on Computers ER   
Abstract—Principles for designing practical selfrouting nonblocking
[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. 19, 1983.
[2] ARPA/COOP/AT&T HybridSEED 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. 149158, 1990.
[4] B.D. Alleyne and I. Scherson, "Expanded Delta Networks for Very Large Parallel Computers," Proc. Int'l Conf. Parallel Processing, pp. 127131, 1992.
[5] A. Bassalygo and M.S. Pinsker, "Complexity of Optimum Nonblocking Switching Network without Reconnections," Problems of Information Transmission, vol. 9, pp. 6466, 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. 289293, 1992.
[8] T.J. Cloonan, G.W. Richards, A.L. Lentine, F.B. McCormick, and J.R. Erickson, "FreeSpace Photonic Switching Architectures Based on Extended Generalized Shuffles," Applied Optics, vol. 31, no. 35, pp. 7,4717,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,5121,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,0471,051, Aug. 1995.
[11] B.G. Douglass,"Rearrangeable ThreeStage Interconnection Networks and Their Routing Properties," IEEE Trans. Computers, vol. 42, no. 5, pp. 559567, May 1993.
[12] H.S. Hinton, T.J. Cloonan, F.B. McCormick, A.L. Lentine, and F.A.P. Tooley, "FreeSpace Digital Optical Systems," Proc. IEEE, vol. 82, no. 11, pp. 1,6321,649, Nov. 1994.
[13] W. Hoeffding, "On the Distribution of the Number of Successes in Independent Trials," Annals of Math. Statistics, vol. 27, pp. 713721, 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 SelfRouting Permutation Switching on an Asymptotically Minimum Cost Network,” IEEE Trans. Computers, vol. 42, no. 12, pp. 1,4691,479, Dec. 1993.
[16] R. Kannan, H.F. Jordan, K.Y. Lee, and C. Reed, "A BitControlled MultiChannel Time Slot Permutation Network," Proc. Second Int'l Conf. Massively Parallel Processing Using Optical Interconnects, pp. 271278, 1995.
[17] D.M. Koppelman and A.Y. Oruç, “A SelfRouting Permutation Network,” J. Parallel and Distributed Computing, vol. 10, no. 10, pp. 140151, Oct. 1990.
[18] A.V. Krishnamoorthy and D.A.B. Miller, "Scaling OptoelectronicVLSI Circuits into the 21st Century: A Technology Roadmap," IEEE J. Selected Topics in Quantum Electronics, vol. 2, no. 1, pp. 5576, 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,0911,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 FlipChipBonded 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. 6470, May 1996.
[23] D. Mitra and R.A. Cieslak, "Randomized Parallel Communications on an Extension of the Omega Network," J. ACM, vol. 34, pp. 802824, 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. 642667, July 1982.
[26] J.H. Patel, "Performance of ProcessorMemory Interconnections for Multiprocessors," IEEE Trans. Computers, vol. 30, no. 10, pp. 771780, Oct. 1981.
[27] J.L. Hennessey and D.A. Patterson, Computer Architecture, A Quantatative Approach, second edition. San Francisco: MorganKauffman, 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 SelfRouting 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 NDepth Networks," IEEE Trans. Comm., pp. 2,5212,531, Sept. 1995.
[34] T.H. Szymanski and H.S. Hinton, "Reconfigurable Intelligent Optical Backplane for Parallel Computing and Communications," Applied Optics, pp. 1,2531,268, Mar. 1996.
[35] C.D. Thompson, "Generalized Connection Networks for Parallel Processor Intercommunication," IEEE Trans. Computers, vol. 27, no. 12, pp. 1,1191,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, May1214, 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. 356362, Apr. 1996.
[38] L.G. Valiant and G.J. Brebner,"Universal Schemes for Parallel Communication," Proc. 13th Ann. ACM Symp. Theory of Computing, pp. 263277, May 1981.
[39] M. Yamaguchi and KI Yukimatsu, "Recent FreeSpace Photonic Switches," IEICE Trans. Comm., vol. E77B, no. 2, Feb. 1994.