Tree-based parallel algorithm design

Algorithmica (New York)

Volumn 19, Issue 4, 1997, Pages 369-389

  Miller, G L ^a   Teng, S H ^b  

^a Carnegie Mellon University   (United States)

^b University of Minnesota   (United States)

Author keywords

Algebraic computing; Code optimization; List ranking; Parallel algorithms; Parallel prefix sum; Parallel tree contraction

Indexed keywords

EID: 0011520845     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009179     Document Type: Article

References (29)

1. K. Abahamson, N. Dadoun, D. K. Kirkpatrick, and T. Przytycka. A simple parallel tree contraction algorithm. Journal of Algorithms, 10(2):287-302, 1989.
2. R. J. Anderson and G. L. Miller. A simple randomized parallel algorithm for list-ranking. Information Processing Letters, 33(5):269-273, January 1990.
3. R. P. Brent. The parallel evaluation of general arithmetic expressions. Journal of the Association for Computing Machinery, 21(2):201-208, April 1974.
4. R. Cole and U. Vishkin. Approximate and exact parallel scheduling with applications to list, tree, and graph problems. In Proceedings of the 21th Annual Symposium on Foundations of Computer Science, pages 478-491, IEEE, Toronto, October 1986.
5. R. Cole and U. Vishkin. Deterministic coin tossing with applications to optimal list ranking. Information and Control, 70(1):32-53, 1986.
6. S. A. Cook. Towards a complexity theory of synchronous parallel computation. In Internationales Symposium uber Logik und Algorithmik zu Enren von Professor Hort Specker, pages 11-20, February 1980.
7. E. Dekel, S. Ntafos, and S.-T. Peng. Parallel Tree Techiques and Code Opimization, pages 205-216. Lecture Notes in Computer Science, Volume 227, Springer-Verlag, Berlin, 1986.
8. C. Dwork, P. C. Kanellakis, and J. C. Mitchell. On the sequential nature of unification. Journal of Logic Programming, 1:35-50, 1984.
9. D. D. Gajski and J. K. Peir. Essentail issues in multiprocessors systems. IEEE Transactions on Computers, 18(6):9-27, 1985.
10. H. Gazit. An optimal randomized parallel algorithm for finding connected components in a graph. In Proceedings of the 21th Annual Symposium on Foundations of Computer Science, pages 492-501, IEEE, Toronto, October 1986.
11. H. Gazit, G. L. Miller, and S.-H. Teng. Optimal tree contraction in an EREW model. Proceedings of the 1987 Princeton Workshop on Algorithm, Architecture and Technology: Issues for Models of Concurrent Computation, pages 139-156, 1987.
12. A. Gibbons and W. Rytter. An optimal parallel algorithm for dynamic evaluation and its applications. In Proceedings of the 6th Conference on Foundations of Software Technology and Theoretical Computer Science, pages 453-469. Lecture Notes in Computer Science, Volume 241, Springer-Verlag, Berlin, 1986.
13. P. B. Gibbons, R. M. Karp, G. L. Miller, and D. Soroker. Subtree isomorphism is in random NC. In VLSI Algorithms and Architectures: 3rd Aegean Workshop on Computing, AWOC 88, ed. J. H. Reif, pages 43-52. Lecture Notes in Computer Science, Volume 319, Springer-Verlag, Berlin, 1988.
14. L. M. Goldschlager, R. A. Shaw, and J. Staples. The maximum flow problem is log space complete for P. Theoretical Computer Science, 21:105-111, 1982.
15. X. He and Y. Yesha. Binary tree algebraic comptations and parallel algorithms for simple graphs. Journal of Algorithms, 9(1):92-113, 1988.
16. X. He and Y. Yesha. Nearly optimal algorithms for r-dominating set and p-center problems on trees. Algorithmica, 5:129-145, 1990.
17. J. Jaja. An Introduction to Parallel Algorithms. Addison-Wesley, Reading, MA, 1992.
18. R. M. Karp and V. Ramachandran. A survey of parallel algorithms for shared-memory machines. Report UCB/CSD 88/408, 1988.
19. P. Klein and J. Reif. An efficient parallel algorithm for planarity. In Proceedings of the 27th Annual Symposium on Foundations of Computer Science, pages 465-477, IEEE, October 1986.
20. S. R. Kosaraju and A. L. Delcher. Optimal parallel evaluation of tree-structured computation by raking (extended abstract). In VLSI Algorithms and Architectures: 3rd Aegean Workshop on Computing, AWOC 88, ed. J. H. Reif, pages 101-110. Lecture Notes in Computer Science, Volume 319, Springer-Verlag, Berlin, 1988.
21. R. E. Ladner. The circuit value problem is log space complete for P. SIGACT News, 7(1):18-20, 1975.
22. G. L. Miller and J. H. Reif. Parallel tree contraction and its applications. In Proceedings of the 26th Symposium on Foundations of Computer Science, pages 478-489, IEEE, Portland, OR, 1985.
23. G. L. Miller, V. Ramachandran, and E. Kaltofen. Efficient parallel evaluation of straight-line code and arithmetic circuits. SIAM Journal on Computing, 17(4):687-695, August 1988.
24. G. L. Miller and S.-H. Teng. Dynamic parallel complexity of computational circuits. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pages 254-264, ACM, New York, May 1987.
25. G. L. Miller and S.-H. Teng. Systematic methods for tree based parallel algorithm development. In Proceedings of the Second International Conference on Supercomputing, pages 392-403, Santa Clara, CA, May 1987.
26. M. Reid-Miller, G. L. Miller, and F. Modugno. List ranking and parallel tree contraction. In Synthesis of Parallel Algorithms, ed. J. R. Reif, pages 115-194. Morgan-Kaufmann, Los Altos, CA, 1993.
27. R. Sethi and J. D. Ullman. The generation of optimal code for arithmetic expressions. Journal of the Association for Computing Machinery, 17(4):715-728, October 1970.
28. S.-H. Teng and B. Wang. Parallel algorithms for message decomposition. Journal of Parallel and Distributed Computing, 4:231-249, June 1987.
29. L. G. Valiant and G. J. Brebner. Universal schemes for parallel communication. In Proceedings of the 13th Annual ACM Symposium on Theory of Computing, pages 263-277, ACM, New York, 1981.