This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A New Routing Algorithm for a Class of Rearrangeable Networks
November 1994 (vol. 43 no. 11)
pp. 1270-1280

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.

[1] C. L. Wu and T. Feng, "On a class of multistage interconnection networks,"IEEE Trans. Comput., vol. C-29, pp, 694-702, Aug. 1980.
[2] D. H. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. C-24, pp. 1145-1155, Dec. 1975.
[3] T. Feng, "Data manipulating functions in parallel processors and implementations,"IEEE Trans. Comput., vol. C-23, pp. 309-318, Mar. 1974.
[4] K. E. Batcher, "The flip network in STARAN," inProc. Int. Conf. on Parallel Processing, 1976, pp. 65-71.
[5] L. R. Goke and G. J. Lipovski, "Banyan networks for partitioning multiprocessor systems," inProc. 1st Annu. Symp. Comput. Architecture, Dec. 1973, pp. 21-28.
[6] D. C. Opferman and N. T. Tsao-Wu, "On a class of rearrangeable switching networks,"Bell Syst. Tech. J., vol. 50, no. 5, 1971.
[7] S. Andresen, "The looping algorithm extended to base 2trearrangeable switching networks,"IEEE Trans. Commun., vol. COM-25, no. 10, pp. 1057-1063, Oct. 1977.
[8] Y.-M. Yeh and T. Feng, "On a class of rearrangeable networks,,"IEEE Trans. Comput., vol. 41, pp. 1361-1379, Nov. 1992.
[9] C. Clos, "A Study of non-blocking switching network,"Bell Syst. Tech. J., vol. 32, pp. 406-424, 1953.
[10] V. Benes,Mathematical Theory of Connecting Networks. New York: Academic Press, 1965.
[11] D. Nassimi and S. Sahni, "Parallel algorithms to set up the benes permutation network,"IEEE Trans. Comput., vol. C-31, pp. 148-154, Feb. 1982.

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, Nov. 1994, doi:10.1109/12.324560
Usage of this product signifies your acceptance of the Terms of Use.