Routing automorphisms of the hypercube

Authors:
Paulin Melatagia Yonta;Maurice Tchuente;René Ndoundam
Affiliations:
Département d'Informatique, UMI 209, UMMISCO, Faculté des Sciences, Université de Yaoundé I, B.P. 812 Yaoundé, Cameroon;Département d'Informatique, UMI 209, UMMISCO, Faculté des Sciences, Université de Yaoundé I, B.P. 812 Yaoundé, Cameroon and IRD, UMI 209, UMMISCO, 32 avenue Henri Varagnat ...;Département d'Informatique, UMI 209, UMMISCO, Faculté des Sciences, Université de Yaoundé I, B.P. 812 Yaoundé, Cameroon
Venue:
Information Processing Letters
Year:
2010

Citing 6
Cited 0

Topological Properties of Hypercubes

IEEE Transactions on Computers
Hypercube permutations routable under all dimension orderings

Information Processing Letters
Congestion-free Optimal Routings of Hypercube Automorphisms

SIAM Journal on Discrete Mathematics
Packet routing in fixed-connection networks: a survey

Journal of Parallel and Distributed Computing
Optimal BPC Permutations on a Cube Connected SIMD Computer

IEEE Transactions on Computers
A Self-Routing Benes Network and Parallel Permutation Algorithms

IEEE Transactions on Computers

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present an online algorithm for routing the automorphisms (BPC permutations) of the queueless MIMD hypercube. The routing algorithm has the virtue of being executed by each node of the hypercube without knowing the state of the others nodes. The algorithm is also vertex and link-contention free. We show, using the proposed algorithm, that BPC permutations are arbitrarily routable in the considered communication model.