Subscribe

Issue No.11 - November (1994 vol.43)

pp: 1270-1280

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.324560

ABSTRACT

<p>This paper presents a routing algorithm for a class of multistage interconnection networks. Specifically, the concatenation of two Omega networks which has 2 log/sub 2/ N stages is treated. It is shown that this kind of asymmetric Omega+Omega network can be converted into a symmetric Omega/sup -1spl times/Omega network or a symmetric Omega/spl times/Omega/sup -1/ network. However, they have butterfly connections between the two center stages. A general algorithm is developed which routes a class of symmetric networks. The 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 the well-known looping algorithm in that it can be applied adaptively according to the structure of the network. It can be applied to routing the Omega-based networks regardless of the center-stage connection patterns, i.e., straight, skewed straight, simple butterfly or skewed butterfly as long as the networks are symmetric. The sufficient conditions for proper routing are shown and proved. In addition, an example is shown to demonstrate the algorithm.</p>

INDEX TERMS

multiprocessor interconnection networks; network routing; reconfigurable architectures; routing algorithm; rearrangeable networks; multistage interconnection networks; Omega networks; butterfly connections; symmetric networks; looping algorithm; center-stage connection patterns; topological equivalence; interchangeable group; destination-tag scheme.

CITATION

T.-Y. Feng, S.-W. Seo, "A New Routing Algorithm for a Class of Rearrangeable Networks",

*IEEE Transactions on Computers*, vol.43, no. 11, pp. 1270-1280, November 1994, doi:10.1109/12.324560