%0 Journal Article
%9 ACL : Articles dans des revues avec comité de lecture répertoriées par l'AERES
%A Yonta, P. M.
%A Tchuente, Maurice
%A Ndoundam, R.
%T Routing automorphisms of the hypercube
%D 2010
%L fdi:010049038
%G ENG
%J Information Processing Letters
%@ 0020-0190
%K Graph algorithms ; Hypercube ; Queueless MIMD ; BPC permutation ; Arbitrarily routable
%M ISI:000281457000003
%N 20
%P 854-860
%R 10.1016/j.ipl.2010.07.002
%U https://www.documentation.ird.fr/hor/fdi:010049038
%> https://www.documentation.ird.fr/intranet/publi/2010/09/010049038.pdf
%V 110
%W Horizon (IRD)
%X 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.
%$ 122