Hypercube permutations routable under all dimension orderings

Information Processing Letters

Volumn 59, Issue 4, 1996, Pages 185-189

  Panaite, Petrişor ^a  

^a Laboratoire Interdisciplinaire des Sciences du Numérique   (France)

Author keywords

Combinatorial problems; Greedy routings; Hypercube; Permutation routings

Indexed keywords

EID: 0039163203     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00109-3     Document Type: Article

References (8)

1. W.D. Hillis, The Connection Machine (MIT Press, Cambridge, MA, 1985).
2. J. Lenfant, Parallel permutations of data: A Benes network control algorithm for frequently used permutations, IEEE Trans. Comput. 27 (7) (1978) 637-647.
3. W. Lin, A dimension-scrambling approach to fast hypercube data permutations, in: Proc. Internat. Conf. on Parallel Processing (1990) 119-122.
4. D. Nassimi and S. Sahni, A self-routing Benes network and parallel permutation algorithms, IEEE Trans. Comput. 30 (5) (1981) 332-340.
5. D. Nassimi and S. Sahni, Optimal BPC permutations on a cube connected SIMD computer, IEEE Trans. Comput. 31 (4) (1982) 338-341.
6. D. Nassimi, A fault-tolerant routing algorithm for BPC permutations on multistage interconnection networks, in: Proc. of Internat. Conf. on Parallel Processing, Vol. 1 (1989) 278-287.
7. M.C. Pease, The indirect binary n-cube microprocessor array, IEEE Trans. Comput. 26 (5) (1977) 458-473.
8. K. Zemoudeh and A. Sengupta, Routing frequently used bijections on hypercube, in: Proc. 5th Distributed Memory Computing Conf. (1990) 824-832.