| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 427954 | Information Processing Letters | 2010 | 7 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
