This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Hamiltonian Cycles in the Shuffle-Exchange Network
May 1989 (vol. 38 no. 5)
pp. 745-750
The usefulness of the shuffle-exchange network in parallel processing applications is well established. The optimal embedding of a shuffle-exchange network of a given size depends on the number of cycles of the shuffle permutation of that size. The cost of one method of adding fault-tolerance through reconfigurability depends upon the number of such cycles, and the manner in which they can be c

[1] H. Stone, "Parallel processing with perfect shuffle,"IEEE Trans. Comput., vol. C-20, pp. 153-161, Feb. 1971.
[2] M. Pease, "The indirect binaryN-cube processor,"IEEE Trans. Comput., vol. C-26, pp. 458-473, May 1977.
[3] D. Parker, "Notes on shuffle-exchange type switching networks,"IEEE Trans. Comput., vol. C-29, pp. 213-221, Mar. 1980.
[4] T. Etzion and A. Lempel, "An efficient algorithm for generating linear transformations in a shuffle-exchange network,"SIAM J. Comput., vol. 15, no. 1, pp. 216-221, Feb. 1986.
[5] T. H. Hildebrandt, W.-T. Liu, and R. Cavin III, "Matrix decompositions on two-dimensional shuffle-exchange processors," in review.
[6] W. Liu and G. Mei, "A class of two-dimensional problems: Algorithms and architectures," inProc. ICCD86, Oct. 1986, invited paper.
[7] C.-L. Wu and T.-Y. Feng, "The universality of the shuffle-exchange network,"IEEE Trans. Comput., vol. C-30, pp. 324-332, May 1981.
[8] D. Kleitman, F. T. Leighton, M. Lepley, and G. L. Miller, "New layouts for the shuffle exchange graph," inProc. ACM Symp. Theory Computing, 1981, pp. 278-292.
[9] F. Leighton and G. Miller, "Optimal layouts for small shuffle-exchange graphs,"J. VLSI, pp. 289-299, 1981.
[10] K. Padmanabhan and D. Lawrie, "Fault-tolerance schemes in shuffle-exchange type interconnection networks," inProc. 12th Symp. Comput. Architecture, 1985.
[11] C. Chen and J. Abraham, "Reconfiguration techniques for shuffle-exchange processor arrays," Tech. Rep. 86-5, Comput. Syst. Group, Coordinated Sci. Lab., Univ. of Illinois at Urbana-Champaign, pp. 16- 24 (Jan. 1986).

Index Terms:
Hamiltonian cycles; shuffle-exchange network; parallel processing; optimal embedding; shuffle permutation; fault-tolerance; reconfigurability; exact equation; shuffle-exchange connected array; spare processors; redundancy; directed graphs; fault tolerant computing; multiprocessor interconnection networks.
Citation:
W. Liu, T.H. Hildebrandt, R. Cavin, III, "Hamiltonian Cycles in the Shuffle-Exchange Network," IEEE Transactions on Computers, vol. 38, no. 5, pp. 745-750, May 1989, doi:10.1109/12.24277
Usage of this product signifies your acceptance of the Terms of Use.