Congestion-free optimal routings of hypercube automorphisms

SIAM Journal on Discrete Mathematics

Volumn 10, Issue 2, 1997, Pages 201-208

  Ramras, Mark ^a  

^a NORTHEASTERN UNIVERSITY   (United States)

Author keywords

Automorphism; BPC permutation; Hypercube; Routing

Indexed keywords

EID: 3943082718     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480194275175     Document Type: Article

References (8)

1. W. Y. C. CHEN, Induced cycle structures of the hyperoctahedral group, SIAM J. Discrete Math., 6 (1993), pp. 353-362.
2. W. Y. C. CHEN AND R. STANLEY, Derangements on the n-cube, Discrete Math., 115 (1993), pp. 65-75.
3. S. LATIFI, An effective approach to fast data permutations in hypercube multiprocessors, Congr. Numer., 84 (1991), pp. 119-127.
4. F. T. LEIGHTON, Introduction to Parallel Algorithms and Architectures: Arrays · Trees · Hypercubes, Morgan Kaufmann, San Mateo, CA, 1992.
5. Z. LIU AND J.-H. YOU, Conflict-free routing for BPC-permutations on synchronous hypercubes, Parallel Comput., 19 (1993), pp. 323-342.
6. D. NASSIMI AND S. SAHNI, A self-routing Beneš network and parallel permutation algorithms, IEEE Trans. Comput., C-30, (1981), pp. 332-340.
7. D. NASSIMI AND S. SAHNI, Optimal BPC permutations on a cube connected SIMD computer, IEEE Trans. Comput., C-31, (1982), pp. 338-341.
8. M. RAMRAS, Routing permutations on a graph, Networks, 23 (1993), pp. 391-398.