Tight bounds for on-line tree embeddings

Authors:
Sandeep Bhatt;David Greenberg;Tom Leighton;Pangfeng Liu
Affiliations:
Department of Computer Science, Yale Univ., New Haven, CT and Computer Science Department, 256-80 Caltech, Pasadena, CA;Department of Computer Science, Yale Univ., New Haven, CT;Mathematics Department and Laboratory for Computer Science, MIT, Cambridge, MA;Department of Computer Science, Yale Univ., New Haven, CT
Venue:
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Year:
1991

Citing 1
Cited 13

Dynamic tree embeddings in butterflies and hypercubes

SPAA '89 Proceedings of the first 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
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
Optimal dynamic scheduling of task tree on constant-dimensional architectures

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Space-efficient scheduling of multithreaded computations

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of 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
Asymptotically Optimal Randomized Tree Embedding in Static Networks

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
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

Quantified Score

Hi-index	0.00

Tight bounds for on-line tree embeddings

Quantified Score

Visualization

Abstract