This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fast Self-Routing Permutation Switching on an Asymptotically Minimum Cost Network
December 1993 (vol. 42 no. 12)
pp. 1469-1479

A self-routing permutation network with O((n lg n)) switches and O(lg/sup 2/n) routing time, where lg denotes log/sub 2/, is presented. More generally, a permutation network with O(kn/sup 1+1/k/) cost and O(k lg n) routing time for any k, 1>or=k lg n, is described. This improves D. Nassimi and J. Sahni's (1982) routing algorithm that gives O(k lg/sup 3/ n) routing time for the same cost expression. The only networks capable of permutation switching with O(n lg n) cost and O(lg n) routing time are the AKS sorting network and E. Upfal's (1989) packet routing network, but the constants hidden in the complexities of these networks are so large that they remain impractical until n gets very large.

[1] M. Ajtai, J. Komlos, and E. Szemeredi, "AnO(nlogn) sorting network," inProc. 15th ACM Symp. Theory Comput., 1983, pp. 1-9.
[2] S. Arora, T. Leighton, and B. Maggs, "On-line algorithms for path selection in a nonblocking network," inProc. 22nd Annu. ACM Symp. Theory Comput., May 1990, pp. 149-158.
[3] K. E. Batcher, "Sorting networks and their applications," inProc. 1968 Spring Joint Comput. Conf., pp. 307-314.
[4] V. E. Benes,Mathematical Theory of Connecting Networks and Telephone Traffic. New York: Academic, 1965.
[5] T. H. Cormen, "Concentrator switches for routing messages in parallel computers," M.S. thesis, Massachusetts Inst. Technol., Cambridge, 1986.
[6] O. Gabber and Z. Galil, "Explicit constructions of linear-sized superconcentrators,"J. Comput. Syst. Sci., vol. 22, pp. 407-420, 1981.
[7] L. J. Goldstein and S. W. Leibholz, "On the synthesis of signal switching networks with transient blocking,"IEEE Trans. Comput., vol. EC-16, pp. 637-641, Oct. 1967.
[8] A. E. Joel Jr., "On permutation switching networks,"Bell Syst. Tech. J., vol. 47, no. 5, pp. 813-822, May-June 1968.
[9] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: Addison-Wesley, 1973.
[10] D. Koppelman and A. Y. Oruç, "Time-space tradeoffs in parallel communications," inProc. Allerton Conf., Urbana, IL, 1989.
[11] D. Koppelman and A. Yavuz Oruç, "A self-routing permutation network,"J. Parallel Distributed Comput., no. 10, pp. 140-151, 1990.
[12] T. Leighton and B. Maggs, "Expanders might be practical: Fast algorithms for routing around faults on multibutterflies," inProc. 30th Annu. IEEE Symp. Foundations Comput. Sci., 1989, pp. 384-389.
[13] D. Nassimi and S. Sahni, "Parallel algorithms to set up the Benes permutation network,"IEEE Trans. Comput., vol. C-31, no. 2, pp. 148-154, Feb. 1982.
[14] A. Yavuz Oruçand M. Mittal, "Setup algorithms for cube-connected parallel computers using recursive karnaugh maps,"IEEE Trans. Comput., vol. 40, pp. 217-221, Feb. 1991.
[15] D. C. Opferman and N. T. Tsao-Wu, "On a class of rearrangeable switching networks,"Bell System Tech. J., pp. 1579-1600, May-June 1971.
[16] M. C. Pease, "The indirect binaryn-cube microprocessor array,"IEEE Trans. Comput., vol. C-26, pp. 458-473, May 1976.
[17] M. S. Pinsker, "On the complexity of a concentrator," inProc. 7th Int. Teletraffic Congress, Stockholm, 1973, pp. 318/1-318/4.
[18] D. K. Pradhan and S. M. Reddy, "A fault-tolerant distributed processor architecture,"IEEE Trans. Comput., vol. C-31, no. 9, pp. 863-870, Sept. 1982.
[19] C. Shannon, "Memory requirements in a telephone exchange,"Bell System Tech. J., vol. 29, pp. 343-349, 1950.
[20] H. J. Siegel and S. D. Smith, "Study of multistage SIMD interconnection networks," inProc. 5th Annu. Symp. Comput. Architecture, Apr. 1978, pp. 223-229.
[21] H. S. Stone, "Parallel processing with the perfect shuffle,"IEEE Trans. Comput., vol. C-20, pp. 153-161, Feb. 1971.
[22] A. Waksman, "A permutation network,"J. ACM, vol. 15, no. 1, 1968.
[23] E. Upfal, "AnO(logN) deterministic packet routing scheme," inProc. 21st Annu. ACM Symp. Theory Comput., May 1989, pp. 241-250.

Index Terms:
computational complexity; multiprocessor interconnection networks; packet switching; self-routing permutation switching; asymptotically minimum cost network; cost expression; AKS sorting network; packet routing network; complexities.
Citation:
Ching Yuh Jan, A.Y. Oruc, "Fast Self-Routing Permutation Switching on an Asymptotically Minimum Cost Network," IEEE Transactions on Computers, vol. 42, no. 12, pp. 1469-1479, Dec. 1993, doi:10.1109/12.260636
Usage of this product signifies your acceptance of the Terms of Use.