New graph model and its routing algorithm for rearrangeable networks

  • Yanggon Kim
  • Tse-yun Feng
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1184)

Abstract

This paper introduces a new simple graphical representation, called an N-leaf Dual Complete Binary Tree (N-leaf DCB-tree), for (2 log2N−1)-stage networks. The N-leaf DCB-tree representation method has hierarchical and recursive characteristics. Due to the hierarchical property, it provides an analytical and systematic model for a multistage interconnection network with respect to a permutation realizability. Based on the recursive property of DCB-tree structure, we present a universal necessary and sufficient condition of a conflict-free connection pattern for N one-to-one simultaneous connection paths in multistage interconnection networks. Depending on the class of a given (2 log2N−1)-stage network, this universal condition can be changed. Also this N-leaf DCB-tree model is shown to be very useful in comparing the permutation capabilities of various network topologies. The N-leaf DCB-tree model can convert a routing problem to a conflict-free assignment problem for N binary numbers where each binary number is a (log2N−1)-bit string. Converting to a conflict-free assignment problem may make it easier to attack the rearrangeablity of a (2 log2N−1)-stage network in a class of Shuffle-Exchange equivalent netwrks (E- class).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Wu, C.L., Feng, T.: On a Class of Multistage Interconnection Networks. IEEE Trans. Comput. 29 (1980) 694–702Google Scholar
  2. 2.
    Parker, D.S.: Notes on Shuffle/Exchange-Type Switching Networks. IEEE Trans. Comput. 29 (1980) 213–222Google Scholar
  3. 3.
    Pradhan, D.K., Kodandapani, K.L.: A Uniform Representation of Single and Multistage Interconnection Networks Used in SIMD Machine. IEEE Trans. Comput. 29 (1980) 777–790Google Scholar
  4. 4.
    Agrawal, D.P.: Graph Theoretical Analysis and Design of Multistage Interconnection Networks. IEEE Trans. Comput. 32 (1983) 637–648Google Scholar
  5. 5.
    Scherson, I.D.: Orthogonal Graphs and the Analysis and Construction of a Class of Multistage Interconnection Networks. Proc. of Int. Conf. on Parallel Processing (1990) 380–387Google Scholar
  6. 6.
    Das, N., Bhattacharya, B.B., Dattagupta, J.: Isomorphism of Conflict Graphs in Multistage Interconnection Networks and Its Application to Optimal Routing. IEEE Trans. Comput. 42 (1993) 665–677Google Scholar
  7. 7.
    Bernhard, P. J., Rosenkrantz, D.J.: An Efficient Method for Representing and Transmitting Message Patterns on Multiprocessor Interconnection Networks. IEEE Trans. Parallel and Distributed System 11 (1991) 72–85Google Scholar
  8. 8.
    Kim, Y., Feng, T.: A New Tag Schem and Its Tree Representation For A Shuffle-Exchange Network. Proc. of Int. Conf. on Parallel Processing (1994) 109–112Google Scholar

Copyright information

© Springer-Verlag 1996

Authors and Affiliations

  • Yanggon Kim
    • 1
  • Tse-yun Feng
    • 2
  1. 1.Virginia Commonwealth UniversityRichmondUSA
  2. 2.The Pennsylvania State UniversityUniversity ParkUSA
  3. 3.NSF/CISE/CDAArlington

Personalised recommendations