Title :
A group of permutations with edge-disjoint paths on hypercubes
Author :
Robison, Arch D.
Author_Institution :
Bellaire Res. Center, Shell Development Co., Houston, TX, USA
Abstract :
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
Keywords :
hypercube networks; telecommunication network routing; bitwise boolean operations; data permuting; edge-disjoint paths; group of permutations; hypercubes; permutations; routing algorithm; Algebra; Bandwidth; Communication channels; Computer networks; Distributed computing; Equations; Hypercubes; Inspection; Routing; Tail;
Conference_Titel :
Parallel and Distributed Processing, 1991. Proceedings of the Third IEEE Symposium on
Conference_Location :
Dallas, TX
Print_ISBN :
0-8186-2310-1
DOI :
10.1109/SPDP.1991.218188
