A group of permutations with edge-disjoint paths on hypercubes
Arch D. Robison · 2002
The operation of permuting data among the vertices of a hypercube computer induces a set of paths from senders to receivers. Sets of edge-disjoint paths are desirable for efficient communication. This paper introduces a group of permutations that induce edge-disjoint paths for the commercially popular 'e-cube' routing algorithm. In particular, proof is given that any permutation routed thusly has edge-disjoint paths if it is computed solely from some combination of addition, subtraction, multiplication, and bitwise boolean operations.>