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
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
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
Tight Bounds for On-Line Tree Embeddings
SIAM Journal on Computing
Introduction to Algorithms: A Creative Approach
Introduction to Algorithms: A Creative Approach
Efficient Dynamic Embedding of Arbitrary Binary Trees into Hypercubes
IRREGULAR '96 Proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems
FRONTIERS '99 Proceedings of the The 7th Symposium on the Frontiers of Massively Parallel Computation
Determining the Expected Load of Dynamic Tree Embeddings in Hypercubes
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Asymptotically Optimal Randomized Tree Embedding in Static Networks
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
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 |
In many tree-structured parallel computations, the size and structure 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 a computation is performed on a static network, the dynamic tree embedding 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. Furthermore, when a new tree node is generated, it should be immediately assigned to a processor for execution without any information on the further evolving of the tree; and load distribution is performed by all processors in a totally distributed fashion.We study the problem of embedding dynamically evolving trees in butterflies. We evaluate the performance of a random-walk-based algorithm. Our performance data demonstrate that butterflies have comparable performance with hypercubes in supporting tree-structured parallel computations.