On dynamic tree growing in hypercubes

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 1997, Pages 496-503

  Li, Keqin ^a  

^a STATE UNIVERSITY OF NEW YORK   (United States)

Author keywords

Dynamic load distribution; Hypercube; Probabilistic analysis; Random walk; Randomized tree embedding; Recurrence relation

Indexed keywords

DYNAMIC LOADS; GEOMETRY; PARALLEL PROCESSING SYSTEMS; RANDOM PROCESSES; TREES (MATHEMATICS);

DYNAMIC LOAD DISTRIBUTION; HYPERCUBE; PROBABILISTIC ANALYSIS; RANDOM WALK; RANDOMIZED TREE EMBEDDING; RECURRENCE RELATIONS;

FORESTRY;

EID: 0040750100     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/331697.332338     Document Type: Conference Paper

References (15)

1. W. Aiello and F.T. Leighton, "Coding theory, hypercube embeddings, and fault tolerance, " Proc. 3rd ACM Symp. on Parallel Algorithms and Architectures, 1991.
2. S. Bhatt and J.-Y. Cai, "Taking random walks to grow trees in hypercubes, " J ACM, vol.40, no.3, pp.741-764, 1993.
3. S.N. Bhatt, F.R.K. Chung, F.T. Leighton, and A.L. Rosenberg, "Efficient embeddings of trees in hypercubes, " SIAM J. Comput., vol.21, no.1, pp.151-162, 1992.
4. S. Bhatt, D. Greenberg, T. Leighton, and P. Liu, "Tight bounds for on-line tree embeddings, " Proc. and ACM-SIAM Symp. on Discrete Algorithms, pp.344-350, 1991.
5. W. Dally, "Performance analysis of k-sty n-cube interconnection networks, " IEEE Trans. Comput., vol.39, no.6, pp.775- 785, 1990.
6. W. Feller, An Introduction to Probability Theory and Its Applications, Vol.1, 3rd Ed., John Wiley & Sons, 1968.
7. T. Harris, The Theory of Branching Processes, Springer, Berlin, 1963.
8. K. Hwang, Advanced Computer Architecture: Parallelism, Scalability, Programmability, McGraw-Hill, Inc., 1993.
9. R.M. Karp and Y. Zhang, "Randomized parallel algorithms for backtrack search and branch-and-bound computation, " J ACM, vol.40, no.3, pp.765-789, 1993.
10. F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays • Trees • Hypercubes, Morgan Kanfmann Publishers, Inc., San Mateo, CA, 1992.
11. F.T. Leighton, et al., "Dynamic tree embeddings in butterflies and hypercubes, " SIAM J. Comput., vol.21, no.4, pp.639-654, 1992.
12. K. Li, "Maintenance of tree structured computations on parallel and distributed computer systems, " Proc. of 11th A CM Symp. on Applied Computing, pp.337-343, 1996.
13. J. Pearl, Heuristics: Intelligent Search Strategies for Computer Problem Solving, Addison-Wesley, 1984.
14. A.G. Ranade, "Optimal speedup for backtrack search on a butterfly network, " Proc. of the 3rd A CM Syrup. on Parallel Algorithms and Architectures, pp.40-48, 1991.
15. A. Wagner and D.S. Corneil, "Embedding trees in a hypercube is NP-complete" SIAM J. Comput., vol.19, no.4, pp.570-590, 1990.