This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Benes-Like Theorem for the Shuffle-Exchange Graph
December 1992 (vol. 41 no. 12)
pp. 1627-1630

One of the first theorems on permutation routing, proved by V.E. Benes (1965), shows that give a set of source-destination pairs in an N-node butterfly network with at most a constant number of sources or destinations in each column of the butterfly, there exists a set of paths of lengths O(log N) connecting each pair such that the total congestion is constant. An analogous theorem yielding constant-congestion paths for off-line routing in the shuffle-exchange graph is proved here. The necklaces of the shuffle-exchange graph play the same structural role as the columns of the butterfly in the Benes theorem.

[1] E. Annexstein, M. Baumslag, and A. L. Rosenberg, "Group action graphs and parallel architectures,"SIAM J. Comput., vol. 19, pp. 544-569, 1990.
[2] V. E. Benes, "Mathematical theory of connecting networks,"Mathematics in Science and Engineering, vol. 17, New York: Academic, 1965.
[3] R. Koch, T. Leighton, B. Magga, S. Rao, and A. Rosenberg, "Work-preserving emulations of fixed-connection networks," inProc. 21st Annu. ACM Symp. Theory Comput., 1989, pp. 227-240.
[4] F. T. Leighton,Complexity Issues in VLSI: Optimal Layouts for the Shuffle-Exchange Graph and Lower Bound Techniques for VLSI. Cambridge, MA: M.I.T. Press, 1983.
[5] A. Raghunathan and H. Saran, "Is the shuffle-exchange better than the butterfly?" inProc. 2nd Int. Symp. Algorithms, 1991, to be published.
[6] E. J. Schwabe, "Normal hypercube algorithms can be simulated on a butterfly with only constant slowdown," submitted for publication, 1989.
[7] E. J. Schwabe, "On the computational equivalence of hypercube-derived networks," inProc. 2nd Annu. ACM Symp. Parallel Algorithms and Architectures, 1990, pp. 388-397.
[8] A. Waksman, "A permutation network,"J. ACM, vol. 15, no. 1, 1968.

Index Terms:
shuffle-exchange graph; permutation routing; source-destination pairs; butterfly network; sources; destinations; total congestion; constant-congestion paths; off-line routing; necklaces; Benes theorem; computational complexity; graph theory; multiprocessor interconnection networks; parallel algorithms.
Citation:
E.J. Schwabe, "A Benes-Like Theorem for the Shuffle-Exchange Graph," IEEE Transactions on Computers, vol. 41, no. 12, pp. 1627-1630, Dec. 1992, doi:10.1109/12.214674
Usage of this product signifies your acceptance of the Terms of Use.