Maintenance of tree structured computations on parallel and distributed computer systems

Proceedings of the ACM Symposium on Applied Computing

Volumn Part F128723, Issue , 1996, Pages 337-343

  Li, Keqin ^a  

^a STATE UNIVERSITY OF NEW YORK   (United States)

Author keywords

Dynamic load distribution; Performance analysis; Randomized tree growing algorithm; Recurrence relation

Indexed keywords

DYNAMIC LOADS; ELECTRIC POWER PLANT LOADS; FORESTRY; PARALLEL PROCESSING SYSTEMS; TREES (MATHEMATICS);

AVERAGE CASE PERFORMANCE; CLOSED FORM SOLUTIONS; DYNAMIC LOAD DISTRIBUTION; PARALLEL AND DISTRIBUTED COMPUTING; PERFORMANCE ANALYSIS; RANDOMIZED TREES; RECURRENCE RELATIONS; TREE STRUCTURED COMPUTATIONS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 85002097472     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/331119.331203     Document Type: Conference Paper

References (10)

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," Journal of the ACM, vol.40, no.3, pp.741-764, 1993.
3. S. Bhatt, D. Greenberg, T. Leighton, P. Liu, "Tight bounds for on-line tree embeddings," Proc. 2nd ACM-SIAM Symp. on Discrete Algorithms, pp.344-350, 1991.
4. T. Harris, The Theory of Branching Processes, Springer, Berlin, 1963.
5. K. Hwang, Advanced Computer Architecture-Parallelism, Scalability, Programmability, McGraw-Hill, Inc., 1993.
6. R.M. Karp and Y. Zhang, "Randomized parallel algorithms for backtrack search and branch-and-bound computation," Journal of the ACM, vol.40, no.3, pp.765-789, 1993.
7. F.T. Leighton, M.J. Newman, A.G. Ranade, E.J. Schwabe, "Dynamic tree embeddings in butterflies and hypercubes," SIAM Journal on Computing, vol.21, no.4, pp.639-654, 1992.
8. K. Li "Determining the expected load of dynamic tree embeddings in hypercubes," submitted to IEEE Transactions on Parallel and Distributed Systems.
9. J. Pearl, Heuristics: Intelligent Search Strategies for Computer Problem Solving, Addison-Wesley, 1984.
10. A.G. Ranade, "Optimal speedup for backtrack search on a butterfly network," Proc. of the 3rd ACM Symp. on Parallel Algorithms and Architectures, pp.40-48, 1991.