Optimal routing of permutations on rings

Extended abstract
  • Xiaojun Shen
  • Qing Hu
  • Hao Dai
  • Xiangzu Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 834)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    T-Y, Feng, “A Survey of Interconnection Networks”, IEEE Computer, Dec. 1981, pp. 12–27.Google Scholar
  2. [2]
    S. Abraham and K. Padmanabhan, “Performance of the Direct Binary n-Cube Network for Multiprocessors”, 1986 Int. Conf. on Parallel Processing, pp. 636–639.Google Scholar
  3. [3]
    G.M. Masson and G.C. Ginger and S. Makamura, “A Sampler of Circuit Switching Networks”, IEEE Computer, June 1979, pp. 32–48.Google Scholar
  4. [4]
    E. Choi, et al, “Hyperswitch Network for the Hypercube Computer”, Proc. Annu. Symp. Comput. Arch., 1988, pp. 90–99.Google Scholar
  5. [5]
    T. Szymanski, “On the Permutation Capability of a Circuit-switched Hypercube”, 1989 Int. Conf. on Parallel Processing, pp. I:103–110.Google Scholar
  6. [6]
    C.D. Thompson, “Generalized Connection Networks for Parallel Processor Intercommunication”, IEEE trans. Comput. Vol. C-27(12), Dec. 1978, pp. 1119–1125.Google Scholar
  7. [7]
    D. Nassimi and S. Sahni, “Optimal BPC permutations on a Cube Connected SIMD Computer”, IEEE Trans. Comput. Vol. C-31(4), Apr. 1982, pp. 338–341.Google Scholar
  8. [8]
    W. Lin, “A dimension-scrambling approach to fast hypercube data permutations”, 1990 Int. Conf. on parallel Processing, pp. III:119–122.Google Scholar
  9. [9]
    Z. Liu and J. You, “Realizing Frequently Used Permutations on Syncube”, 1991 Int. Conf. on parallel Processing, pp. I:274–277.Google Scholar
  10. [10]
    V.E. Benes, The Mathematical Theory of Connecting Networks and Telephone Traffic, Academic Press, New York, 1965.Google Scholar
  11. [11]
    S.E. Orcutt, “Implementation of Permutation in ILLIAC IV type Computer”, IEEE Trans. Comput. Vol. C-31(12), Dec. 1982, pp. 1202–1214.Google Scholar
  12. [12]
    A. Borodin, J.E. Hopcroft, “Routing, Merging and Sorting on Parallel Models of Computation”, Proc. 14th ACM Symp. on Theory of Computing, 1982, pp. 338–344.Google Scholar
  13. [13]
    W.J. Dally and C.L. Sietz, “Deadlock Free Message Routing in Multiprocessor Interconnection Networks”, IEEE Trans. Comput. Vol. C-36(5), May. 1987, pp. 547–553.Google Scholar
  14. [14]
    H.J. Siegel, Interconnection Networks for Large-Scale Parallel Processing, McGraw-Hill, 1990.Google Scholar
  15. [15]
    K. Hwang and F.A. Briggs, Computer Architecture and Parallel Processing, McGraw-Hill, 1984.Google Scholar
  16. [16]
    A. Lubiw, “A Couter-example to a Conjecture by Szymanski on Hypercube Routing”, Info. Proc. Lett. Vol. 35, June 1990, pp. 57–61.Google Scholar
  17. [17]
    X. Shen, Q. Hu, and W. Liang, “Realizability of an Arbitrary Permutation on a Circuit-Switched Hypercube,” to appear in Info. Proc. Lett. Google Scholar
  18. [18]
    Kai Hwang, Advanced Computer Architecture — Parallelism, Scalability, Programmability, McGraw-Hill, 1993.Google Scholar
  19. [19]
    S. Khuller, S.G. Mitchell and V.V. Vazirani, “Processor Efficient Algorithms for the Two Disjoint Paths Problem and for Finding a Kuratowaki Homeomorph”, SIAM J. Comput. Vol. 21, No. 3, June, 1992, pp. 486–506.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Xiaojun Shen
    • 1
  • Qing Hu
    • 1
  • Hao Dai
    • 1
  • Xiangzu Wang
    • 1
  1. 1.Computer Science Telecommunications ProgramUniversity of Missouri-Kansas CityKansas City

Personalised recommendations