This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Frames: A Simple Characterization of Permutations Realized by Frequently Used Networks
May 1995 (vol. 44 no. 5)
pp. 695-697

Abstract—Rearrangeable multistage networks such as the Benes network realize any permutation, yet their routing algorithms are not cost-effective. On the other hand, there exist inexpensive routing algorithms for nonrearrangeable networks, but no simple technique exists to characterize all the permutations realized on these networks. This paper introduces the concept of frame and shows how it can be used to characterize all the permutations realized on various multistage interconnection networks. They include subnetworks of baseline, Benes, and cascaded baseline and shuffle-exchange networks.

[1] V.E. Benes,Mathematical Theory of Connecting Networks and Telephone Traffic.New York: Academic Press, 1965.
[2] C. Wu and T. Feng,“On a class of multistage interconnection networks,” IEEE Trans. Computers, vol. 29, pp. 696-702, 1980.
[3] D.H. Lawrie, “Access and alignment of data in an array processor,” IEEE Trans. Computers, vol. 24, pp. 1,145-1,155, Dec. 1975.
[4] H.S. Stone,“Parallel processing with the perfect shuffle,” IEEE Trans. Computers, Vol. 20, pp. 153-161, Feb. 1971.
[5] N. Linial and M. Tarsi,“Interpolation between bases and the Shuffle-Exchange network,” Europ. J. Combinatorics, vol. 10, pp. 29-39, 1989.
[6] K.Y. Lee,“On the rearrangeability of 2(log N)-1 stage permutation networks,” IEEE Trans. Computers, vol. 34, pp. 412-425, May 1985.
[7] S.T. Huang and S.F. Tripathi,“Finite state model and compatibility theory: New analysis tools for permutation networks,” IEEE Trans. Computers, vol. 35, pp. 591-601, July 1986.
[8] H. Cam and J.A.B. Fortes,“A simple characterization of permutations realized by frequently used networks,” Technical Report, Purdue Univ., TR-EE 92-32, July 1992.

Index Terms:
Network, permutations, rearrangeability, topological equivalence, balanced matrices, frames.
Citation:
Jose? A.B. Fortes, Hasan Cam, "Frames: A Simple Characterization of Permutations Realized by Frequently Used Networks," IEEE Transactions on Computers, vol. 44, no. 5, pp. 695-697, May 1995, doi:10.1109/12.381954
Usage of this product signifies your acceptance of the Terms of Use.