Conference paper
Efficient submesh permutations in wormhole-routed meshes
Ching-Tien Ho, Ming-Yang Kao
IPDPS 1994
We consider the problem of broadcasting on an n-dimensional hypercube with worm-hole e-cube routing, intermediate reception capability, and one-port communication. We give an algorithm, optimal to within a multiplicative constant, that broadcasts in this model in Θ(n/log2(n + 1)) routing steps. We also give routing algorithms that achieve tight time bounds for n-cubes where n ≤ 6.
Ching-Tien Ho, Ming-Yang Kao
IPDPS 1994
Ching-Tien Ho, J. Bruck, et al.
SIGMOD/PODS/ 1997
J. Bruck, Luc de Coster, et al.
IPDPS 1994
Ching-Tien Ho, Ming-Yang Kao
IPDPS 1994