Alexandru Nicolau
- 1 Aho, A., Sethi, P#., Ullman, J., "Compilers- Principles, Techniques, and Tools", Addison Wesley, 1986. Google Scholar
Digital Library
- 2 Aiken, A., Nicolau, A., "Perfect Pipelining: A New Loop Parallelization Technique", Proceedings of ESOP, France, Springer-Verlag, 1988. Google ScholarDigital Library
- 3 Chen, S. C., "Speedup of Iterative Programs in Multiprocessing Systems", Report No. UIUCDCS- R-75-694, January 1975.Google Scholar
- 4 Cole, R., Vishkin, U., "Faster Optimal Parallel Prefix Sums and List Ranking", Information and Control, 81, pp. 334-352, 1989. Google ScholarDigital Library
- 5 Kruskal, C. P., Rudolph, L., Snir, M., "The Power of Parallel Prefix", IEEE Trans. on Computers, Vol., c-34, No. 10, October 1985.Google Scholar
- 6 Kuck, D., "The Structure of Computers and Computations", Vol. 1, John Wiley & Sons, Inc., 1978. Google ScholarDigital Library
- 7 Ladner, R., Fischer, M., "Parallel Prefix Computation", JACM, Vol. 27, No.4, October 1980, pp. 831-838. Google ScholarDigital Library
- 8 Nicolau, A., "Optimal Loop Parallelization", Proceedings of the SIGPLAN '88 Conf. on Language Design and Implementation, Atlanta, Georgia, June 22-24, 1988. Google ScholarDigital Library
- 9 Nicolau, A., Wang, H. G., "Optimal Schedules for Parallel Prefix Computation with Bounded Resources", Teeh. Rep., Information and Computer Science, University of California Irvine, September 1990.Google Scholar
- 10 Padua, D., Wolfe, M., "Advanced Compiler Optimizations for Supercomputers", CACM, Vol. 29, No. 12, December 1986. Google ScholarDigital Library
- 11 Snir, M., "Depth-size Trade-offs for Parallel Prefix Computation", Journal of Algorithms 7, 185-201, 1986. Google ScholarDigital Library
Index Terms
- Optimal schedules for parallel prefix computation with bounded resources
Recommendations
Optimal schedules for parallel prefix computation with bounded resources
PPOPP '91: Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programmingHow small are shifts required in optimal preemptive schedules?
An event in a schedule is a job start, interruption, resumption or completion time. A shift in a schedule is an non-idling interval between two events that does not contain other events. If a scheduling problem with a regular criterion has only integer ...
The Strict Time Lower Bound and Optimal Schedules for Parallel Prefix with Resource Constraints
Prefix computation is a basic operation at the core of many important applications, e.g., some of the Grand Challenge problems, circuit design, digital signal processing, graph optimizations, and computational geometry.1 In this paper, we present new ...
Comments