The strict time lower bound and optimal schedules for parallel prefix with resource constraints

IEEE Transactions on Computers

Volumn 45, Issue 11, 1996, Pages 1257-1271

  Wang, Haigeng ^b   Nicolau, Alexandru ^a,c   Siu, Kai Yeng S ^a,d  

^a IEEE

^b TIBCO Software Inc   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d Massachusetts Institute of Technology Cambridge   (United States)

Author keywords

Associative operations; Combinatorial optimization; Loop parallelization; Loop carried dependences; Parallel prefix computation; Pascal's Triangle; Scan operator resource constrained parallel algorithms; Strict time optimal schedules; Tree height reduction

Indexed keywords

OPTIMIZATION; PARALLEL ALGORITHMS; RANDOM ACCESS STORAGE; STORAGE ALLOCATION (COMPUTER);

COMBINATORIAL OPTIMIZATION; LOOP PARALLELIZATION; PARALLEL PREFIX COMPUTATION; PASCAL TRIANGLE; STRICT TIME OPTIMAL SCHEDULES; TREE HEIGHT REDUCTION;

PARALLEL PROCESSING SYSTEMS;

EID: 0030284192     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.544482     Document Type: Article

References (19)

1. R.K. Agarwal, "Computational Fluid Dynamics on Parallel Processors," tutorial, McDonnell Douglas Research Laboratories, Proc. Sixth ACM SigArch Int'l Conf. Supercomputing, Washington, D.C., July 1992.
2. A. Aho, R. Sethi, and J. Ullman, Compilers-Principles, Techniques, and Tools. Addison Wesley, 1986.
3. G. Almasi and A. Gottlieb, Highly Parallel Computing, chap. 4. Benjamin/Cummings, 1989.
4. U. Banerjee, R. Eigenmann, A. Nicolau, and D. Padua, "Automatic Program Parallelization," Proc. IEEE, vol. 81, no. 2, pp. 211-243, Feb. 1993.
5. A. Bilgory and D. Gajski, "A IIeuristic for Suffix Solutions," IEEE Trans. Computers, vol. 35, no. 1, Jan. 1986.
6. R. Cole and U. Vishkin, "Faster Optimal Parallel Prefix Sums and List Ranking," Information and Control, vol. 81, pp. 334-352, 1989.
7. O. Egecioglu and C.K. Koc, "Parallel Prefix Computation with Few Processors," Computers and Mathematics with Applications, vol. 24, no. 4, pp. 77-84, 1992.
8. F.E. Fich, "New Bounds for Parallel Prefix Circuits," Proc. 15th ACM STOC, pp. 100-109, 1983.
9. C. Kruskal, L. Rudolph, and M. Snir, "The Power of Parallel Prefix," IEEE Trans. Computers, vol. 34, no. 10, Oct. 1985.
10. D. Kuck, The Structure of Computers and Computations, vol. 1. John Wiley & Sons, 1978.
11. P. Kogge and H. Stone, "A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations," IEEE Trans. Computers, vol. 22, no. 8, Aug. 1973.
12. R. Ladner and M. Fischer, "Parallel Prefix Computation," J. ACM, vol. 27, no. 4, pp. 831-838, Oct. 1980.
13. S. Lakshmivarahan and S.K. Dhall, Parallel Computing Using the Prefix Problem. Oxford Univ. Press, 1994.
14. F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes. San Mateo, Calif.: Morgan Kaufmann Publishers, 1992.
15. Y. Muraoka, "Parallelism Exposure and Exploitation in Programs," PhD thesis, Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign, Report No. 424, Feb. 1971.
16. A. Nicolau and H. Wang, "Optimal Schedules for Parallel Prefix Computation with Bounded Resources," Proc. ACM Symp. Principles and Practice of Parallel Programming, Williamsburg, Va., Apr. 21-24, 1991.
17. Y. Ofman, "On the Algorithmic Complexity of Discrete Functions," Cybernetics and Control Theory, Soviet Physics Doklady, vol. 7, no. 7, pp. 589-591, Jan. 1963.
18. M. Snir, "Depth-Size Trade-Offs for Parallel Prefix Computation," J. Algorithms, vol. 7, pp. 185-201, 1986.
19. H. Wang, "Parallelization of Programs Containing Loop-Carried Dependences with Resource Constraints," PhD thesis, Dept. of Information and Computer Science, Univ. of California, Irvine, Sept. 1994.