Congestion-free routings of linear complement permutations

SIAM Journal on Discrete Mathematics

Volumn 11, Issue 3, 1998, Pages 487-500

  Ramras, Mark ^a  

^a NORTHEASTERN UNIVERSITY   (United States)

Author keywords

Congestion free; Hypercube; Linear complement permutation; Routing

Indexed keywords

EID: 11744264158     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480196301461     Document Type: Article

References (9)

1. R. BOPPANA AND C. RAGHAVENDRA, Optimal self-routing of linear complement permutations in hypercubes, in Proc. 5th Distributed Memory Computing Conf., IEEE Computer Society, Los Alamitos, CA, April 1990, pp. 800-808.
2. F. T. LEIGHTON, Introduction to Parallel Algorithms and Architectures: Arrays · Trees · Hypercubes, Morgan-Kaufmann, San Mateo, CA, 1992.
3. Z. LIU, AND J-H. YOU, Conflict-free routing for BPC-permutations on synchronous hypercubes, Parallel Comput., 19 (1993), pp. 323-342.
4. D. NASSIMI AND S. SAHNI, A self-routing Beneš network and parallel permutation algorithms, IEEE Trans. Comput., C-30 (1981), pp. 332-340.
5. D. NASSIMI AND S. SAHNI, Optimal BPC permutations on a cube connected SIMD computer, IEEE Trans. Comput., C-31 (1982), pp. 338-341.
6. M. RAMRAS, Routing permutations on a graph, Networks, 23 (1993), pp. 391-398.
7. M. RAMRAS, Congestion-free optimal routings of hypercube automorphisms, SIAM J. Discrete Math., 10 (1997), pp. 201-208.
8. G. STRANG, Linear Algebra and Its Applications, Harcourt, Brace, and Jovanovich, Orlando, FL, 1988.
9. K. ZEMOUDEH AND A. SENGUPTA, Routing frequently used bisections on hypercube, in Proc. 5th Distributed Memory Computing Conf., IEEE Computer Society, Los Alamitos, CA, April 1990, pp. 824-832.