IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Analysis of randomized load distribution for reproduction trees in linear arrays and rings
Theoretical Computer Science
Performance Evaluation - Performance modelling and evaluation of high-performance parallel and distributed systems
Hi-index | 0.00 |
We show two asymptotically optimal probabilistic tree embedding algorithms in hypercubes with constant dilation. These algorithms are slight extension of the random walk algorithm. The first algorithm allows a tree node to have a stay option during each step of a random walk. The second algorithm permits varying length of random walks. Numerical data are given to demonstrate performance improvement.