Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Optimal speedup for backtrack search on a butterfly network
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Coding theory, hypercube embeddings, and fault tolerance
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Tight bounds for on-line tree embeddings
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Branch-and-bound and backtrack search on mesh-connected arrays of processors
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Dynamic tree embeddings in butterflies and hypercubes
SIAM Journal on Computing
Taking random walks to grow trees in hypercubes
Journal of the ACM (JACM)
Randomized parallel algorithms for backtrack search and branch-and-bound computation
Journal of the ACM (JACM)
Performance evaluation of probabilistic tree embedding in cube-connected cycles
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Maintenance of tree structured computations on parallel and distributed computer systems
SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
On dynamic tree growing in hypercubes
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Determining the Expected Load of Dynamic Tree Embeddings in Hypercubes
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Performance analysis for dynamic tree embedding in k-partite networks by random walk
ISPAN '97 Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Analysis of randomized load distribution for reproduction trees in linear arrays and rings
Theoretical Computer Science
| Hi-index | 0.01 |
The problem of dynamic tree embedding in static networks is studied in this paper. We provide a unified framework for studying the performance of randomized tree embedding algorithms which allow a newly created tree node to take a random walk of a short distance to reach a processor nearby. In particular, we propose simple randomized algorithms on several most common and important static networks, including d-dimensional meshes, d-dimensional tori, and hypercubes. It is shown that these algorithms, which have a small constant dilation, are asymptotically optimal. Our analysis technique is based on random walks on static networks. Hence, analytical expressions jor expected load on all the processors are available.