Issue No.05 - May (1989 vol.38)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.24277
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
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.
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