Optimal parallel algorithms for expression tree evaluation and list ranking
Two related results are presented. The first is a simple n/log n processor, O(log n) time parallel algorithm for list ranking. The second is a general parallel algorithmic technique for computations on trees; it yields the first n/log n processor, O(log n) time deterministic parallel algorithm for expression tree evaluation, and solves many other tree problems within the same complexity bounds.
Unable to display preview. Download preview PDF.
- [AM-88]R.J. Anderson and G.L. Miller, Optimal parallel algorithms for list ranking, this proceedings.Google Scholar
- [CV-86b]R. Cole and U. Vishkin, Approximate and exact parallel scheduling with applications to list, tree and graph problems, Proc. 27th Symp. on Foundations of Computer Science, 1986, 478–491.Google Scholar
- [CV-86c]R. Cole and U. Vishkin, The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time, Computer Science Department Technical Report #242, Courant Institute, 1986.Google Scholar
- [CV-87]R. Cole and U. Vishkin, "Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time", to appear, SIAM Journal on Computing.Google Scholar
- [GPS-87]A. Goldberg, S. Plotkin, and G. Shannon, "Parallel symmetry-breaking in sparse graphs", Nineteenth Annual ACM Symp. on Theory of Computing, 315–224.Google Scholar
- [GMT-87]H. Gazit, G. Miller and S. H. Teng, Optimal tree contraction in EREW model, manuscript, Computer Science Department, University of Southern California.Google Scholar
- [GR-86]A. Gibbons and W. Rytter, An optimal parallel algorithm for dynamic tree expression evaluation and its applications, Research Report 77, Dept. of Computer Science, Univ. of Warwick, Coventry, CV4 7AL, England, 1986.Google Scholar
- [H-86]X. He, The general tree algebraic computations and its applications in parallel algorithms design, preprint, 1986, Dept. of Computer and Information Science, Ohio State University, Columbus, OH 43210.Google Scholar
- [MR-85]G.L. Miller and J.H. Reif, Parallel tree contraction and its applications, Proc. 26th Symp. on Foundations of Computer Science, 1985, 478–489.Google Scholar
- [R-85]J.H. Reif, An optimal parallel algorithm for integer sorting, Proc. 26th Symp. on Foundations of Computer Science, 1985, 496–503, to appear SIAM J. Comput.Google Scholar
- [Vi-83]U. Vishkin, Synchronous parallel computation — a survey, TR 71, Dept. of Computer Science, Courant Institute, New York University, 1983.Google Scholar
- [W-79]J.C. Wyllie, "The Complexity of Parallel Computation", Ph.D. thesis, TR 79-387, Dept. of Computer Science, Cornell Univ., Ithaca, NY, 1979.Google Scholar