Determining the Expected Load of Dynamic Tree Embeddings in Hypercubes

Authors:
Keqin Li
Affiliations:
-
Venue:
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Year:
1997

Citing 0
Cited 4

Performance evaluation of probabilistic tree embedding in cube-connected cycles

SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
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
An Augmented k-ary Tree Multiprocessor with Real-Time Fault-Tolerant Capability

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The main contribution of this paper is to use recurrence relations in analyzing the performance of a dynamic tree embedding algorithm in hypercubes. These recurrence relations characterize the expected load on each processor in a randomized tree embedding, and enable us to evaluate expected loads numerically and analytically. As a matter of fact, our methodology does not depend on the hypercube topology, and can be applied to study dynamic tree growing in other networks.