A new routing scheme for concatenating two omega networks

  • Seung-Woo Seo
  • Tse-yun Feng
Poster Session
Part of the Lecture Notes in Computer Science book series (LNCS, volume 817)


A new routing scheme for concatenating two omega networks is presented. Routing the 2log2N-stage concatenated network has been an open problem for decades, and no clear solution has yet been proposed. It was shown in [5] that this asymmetric network can be converted into a symmetric network with butterfly connections between the two center stages. The proposed algorithm routes the network from center stages to outer stages at both the input and the output sides, simultaneously. The algorithm presented is simpler and more flexible than other algorithms known so far, in that it can be applied adaptively, according to the structure of the network.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    D.H. Lawrie, “Access and Alignment of Data in an Array Processor,” IEEE Trans. Comput., Vol.C-24, pp.1145–1155, Dec. 1975.Google Scholar
  2. 2.
    V. Benes, “Mathematical Theory of Connecting Networks,” New York, Academic Press 1965.Google Scholar
  3. 3.
    D.C. Opferman and N.T. Tsao-Wu, “On a Class of Rearrangeable Switching Networks,” The Bell System Technical Journal, Vol.50, No.5, 1971.Google Scholar
  4. 4.
    Y.-M. Yeh and T. Feng, “On a Class of Rearrangeable Networks,” IEEE Trans. Comput., Vol. C-41, pp. 1361–1379, Nov. 1992.Google Scholar
  5. 5.
    S. Seo, “Some Aspects of Multistage Interconnection Networks: Routing, Rearrangeability and Fault-tolerance,” Ph.D. Thesis, The Pennsylvania State University, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Seung-Woo Seo
    • 1
  • Tse-yun Feng
    • 1
  1. 1.Department of Computer Science and EngineeringThe Pennsylvania State UniversityUniversity Park

Personalised recommendations