论文信息 - Realization of an Arbitrary Permutation on a Hypercube

Realization of an Arbitrary Permutation on a Hypercube

Abstract We present an explicit combinatorial algorithm for constructing a 2-realization for any given permutation on a circuit-switched d-dimensional hypercube (d-cube) such that the total number of directed edges used in the realization (counting every repetition) is bounded by d2d, the total number of directed edges in the d-cube. As a corollary, this result implies a (2d−3) step realization on a packet-switched d-cube (d⩾3).

[1] W. Daniel Hillis,et al. The connection machine , 1985 .

[2] Ted Sztnabski. A fiber optic hypermesh for SIMD/MIMD machines , 1990, Supercomputing '90.

[3] Krishnan Padmanabhan,et al. Performance of the Direct Binary n-Cube Network for Multiprocessors , 1989, IEEE Trans. Computers.

[4] Tse-yun Feng,et al. A Survey of Interconnection Networks , 1981, Computer.

[5] Robert J. McMillen,et al. The Multistage Cube: A Versatile Interconnection Network , 1981, Computer.

[6] Ted H. Szymanski,et al. On the Permutation Capability of a Circuit-Switched Hypercube , 1989, International Conference on Parallel Processing.

[7] Dirk Grunwald,et al. Hyperswitch network for the hypercube computer , 1988, ISCA '88.

[8] Gerald M. Masson,et al. A Sampler of Circuit Switching Networks , 1979, Computer.

[9] Anna Lubiw,et al. Counterexample to a Conjecture of Szymanski on Hypercube Routing , 1990, Inf. Process. Lett..

[10] Howard Jay Siegel,et al. Interconnection networks for large-scale parallel processing: theory and case studies (2nd ed.) , 1985 .