Dynamic tree embeddings in butterflies and hypercubes

Authors:
F. T. Leighton;Mark J. Newman;Abhiram G. Ranade;Eric J. Schwabe
Affiliations:
Massachusetts Institute of Technology, Cambridge;Temple, Barker, and Sloane, Inc., Lexington, MA;Univ. of California, Berkeley;Carnegie Mellon Univ., Pittsburgh, PA
Venue:
SIAM Journal on Computing
Year:
1992

Citing 0
Cited 17

Improved Compressions of Cube-Connected Cycles Networks

IEEE Transactions on Parallel and Distributed Systems
Using Emulations to Enhance the Performance of Parallel Architectures

IEEE Transactions on Parallel and Distributed Systems
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
Deterministic parallel backtrack search

Theoretical Computer Science
Embedding graphs with bounded treewidth into their optimal hypercubes

Journal of Algorithms
Efficient dynamic embeddings of binary trees into hypercubes

Journal of Algorithms
Performance Evaluation of a Random-Walk-Based Algorithm for Embedding Dynamically Evolving Trees in Butterflies

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Asymptotically Optimal Randomized Tree Embedding in Static Networks

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
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
Rapidly Mixing Random Walks on Hypercubes with Application to Dynamic Tree Evolution

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
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
On distributed computation rate optimization for deploying cloud computing programming frameworks

ACM SIGMETRICS Performance Evaluation Review

Quantified Score

Hi-index	0.00

Visualization

Abstract