Rapidly Mixing Random Walks on Hypercubes with Application to Dynamic Tree Evolution

Authors:
Keqin Li
Affiliations:
State University of New York
Venue:
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Year:
2005

Citing 17
Cited 1

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 analysis for dynamic tree embedding in k-partite networks by a random walk

Journal of Parallel and Distributed Computing - Special issue on irregular problems in supercomputing applications
Lower bounds for dynamic tree embedding in bipartite networks

Journal of Parallel and Distributed Computing
Randomized load distribution of arbitrary trees in distributed networks

SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Efficient Dynamic Embedding of Arbitrary Binary Trees into Hypercubes

IRREGULAR '96 Proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems
On the performance of randomized embedding of reproduction trees in static networks

International Journal of Parallel Programming
Analysis of randomized load distribution for reproduction trees in linear arrays and rings

Theoretical Computer Science
Performance evaluation of a random-walk-based algorithm for embedding dynamically evolving trees in hypercubic networks: Research Articles

Concurrency and Computation: Practice & Experience - Systems Performance Evaluation
Design and analysis of asymptotically optimal randomized tree embedding algorithms in static networks

Performance Evaluation - Performance modelling and evaluation of high-performance parallel and distributed systems

Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In many tree-structured parallel computations, the size and shape of a tree that represents a parallel computation is unpredictable at compile-time. The tree evolves gradually during the course of the computation. When such an application is executed on a static network, the dynamic tree evolution problem is to distribute the tree nodes to the processors of the network such that all the processors receive roughly the same amount of load and that communicating nodes are assigned to neighboring processors. The main contribution of the paper is to describe a simple randomwalk-based asymptotically optimal dynamic tree evolution algorithm on hypercubes and analyze the speed at which the performance ratio converges to the optimal. Our strategy is to prove that the Markov chain of the random walk on a hypercube is rapidly mixing.