The LRPD Test: Speculative Run—Time Parallelization of Loops with Privatization and Reduction Parallelization

ACM SIGPLAN Notices

Volumn 30, Issue 6, 1995, Pages 218-232

  Rauchwerger, Lawrence ^a   Padua, David ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976823223     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/223428.207148     Document Type: Article

References (39)

1. S. Abraham. Private communication, 1994.
2. J. R. Allen, K. Kennedy, C. Porterfield, and J. Warren. Conversion of control dependence to data dependence. In Proceedings of the 10th ACM Symposium on Principles of Programming Languages, pages 177–789, January 1983.
3. Alliant Computer Systems Corporation. FX/Series Architecture Manual 1986.
4. Alliant Computers Systems Corporation. Alliant FKI2800 Series System Description, 1991.
5. R. Ballance, A. Maccabe, and K. Ottenstein. The Program Dependence Web: a Representation Supporting Control- Data- and Demand-Driven Interpretation of Imperative Languages. In Proceedings of the S!GPLAN'90 Conference on Programming Language Design and Implementation, pages 257–271, June 1990.
6. U. Banerjee. Dependence Analysis for Supercomputing, Kluwer. Boston, MA., 1988.
7. M. Berry, D. Chen, P., Koss, D. Kuck, S. Lo, Y., Pang, R. Roloff, A. Sameh, E. dementi, S. Chin, D. Schneider, G. Fox, P. Messina, D. Walker, C. Hsiung, J. Schwatzmeier, K. Lue, S. Orzag, F. Seidl, O. Johnson, G. Swanson, R. Goodrum, and J. Martin. The perfect club benchmarks: Effective performance evaluation of supercomputers. Technical Report CSRD-827, Center for Supercomputing Research and Development, University of Illinois, Urbana, IL, May 1989.
8. H. Berryman and J. Saltz. A manual for PARTI runtime primitives. Interim Report 90–113, ICASE, 1990.
9. W. Blume and R. Eigenmann. Performance Analysis of Parallelizing Compilers on the Perfect Benchmarks™ Programs. IEEE Transactions on Parallel and Distributed Systems, 3(6):643-656, November 1992.
10. M. Burke, R., Cytron, J. Ferrante, and W. Hsieh. Automatic generation of nested, fork-join parallelism. Journal of Supercomputing, pages 71-88,1989.
11. W. J. Camp, S. J. Plimpton, B. A. Hendrickson, and R. W. Leland. Massively parallel methods for engineering and science problems. Comm ACM, 37(4):3l-41, April 1994.
12. D. K. Chen, P. C. Yew, and J. Torrellas. An efficient algorithm for the run-time parallelization of doacross loops. In Proceedings of Supercomputing 1994, pages 518–527, Nov. 1994.
13. A. Dinning and E. Schonberg. An empirical comparison of monitoring algorithms for access anomaly detection. In Proc. of 2-nd ACM SIG-PLAN Symposium on Principles & Practice of Parallel Programming (PPOPP), pages 1-10,1990.
14. R. Eigenmann, J. Hoeflinger, Z. Li, and D. Padua. Experience in the Automatic Parallelization of Four Perfect-Benchmark Programs. Lecture Notes in Computer Science 589. Proceedings of the Fourth Workshop on Languages and Compilers for Parallel Computing, Santa Clara, CA, pages 65–83, August 1991.
15. V. Krothapalli and P. Sadayappan. An approach to synchronization of parallel computing. In Proceedings of the 2988 International Conference on Supercomputing, pages 573–581, June 1988.
16. C. Kruskal. Efficient parallel algorithms for graph problems. In Proceedings of the 2985 International Conference on Parallel Processing, August 1985.
17. C. Kruskal. Efficient parallel algorithms for graph problems, In Proceedings of the 2986 International Conference on Parallel Processing, pages 869–876, August 1986.
18. D. J. Kuck, R, H. Kuhn, D. A. Padua, B. Leasure, and M. Wolfe. Dependence graphs and compiler optimizations. In Proceedings of the 8th ACM Symposium on Principles of Programming Languages, pages 207–218, January 1981.
19. F. Thomson Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, 1992.
20. S. Leung and J. Zahorjan. Improving the performance of runtime parallelization, In 4th PPOPP, pages 83-91,May 1993.
21. Zhiyuan Li. Array privatization for parallel execution of loops. In Proceedings of the 2 9th International Symposium on Computer Architecture, pages 313-322,1992.
22. D. E. Maydan, S. P. Amarasmghe, and M. S. Lam. Data dependence and data-flow analysis of arrays. In Proceedings 5th Workshop on Programming Languages and Compilers for Parallel Computing, August 1992.
23. S. Midkiff and D. Padua. Compiler algorithms for synchronization. IEEE Trans. Comput., C-36(12):1485-1495, 1987.
24. I. Nudler and L. Rudolph. Tools for the efficient developement of efficient parallel programs. In Proc. 1st Israeli Conference on Computer System Eng inee ring, 1988.
25. D. A. Padua and M. J. Wolfe. Advanced compiler optimizations for supercomputers. Communications of the ACM, 29:1184-1201, December 1986.
26. L., Rauchwerger and D. Padua. The privatizing doall test: A runtime technique for doall loop identification and array privatization. In Proceedings of the 1994 International Conference on Supercomputing, pages 33–43, July 1994.
27. Lawrence Rauchwerger and David A. Padua. Parallelizing WHILE Loops for Multiprocessor Systems. In Proceedings of 9th International Parallel Processing Symposium, April 1995.
28. J. Saltz and R., Mirchandaney. The preprocessed doacross loop. In Dr. H.D. Schwetman, editor, Proceedings of the 1991 International Conference on Parallel Processing, pages 174–178. CRC Press, Inc., 1991. Vol. II - Software.
29. J. Saltz, R. Mirchandaney, and K. Crowley. The doconsider loop. In Proceedings of the 1989 International Conference on Supercomputing, pages 29–40, June 1989.
30. J., Saltz, R. Mirchandaney, and K. Crowley. Run-time parallelization and scheduling of loops. IEEE Trans. Comput, 40(5), May 1991.
31. E. Schonberg. On-the-fly detection of access anomalies. In Proceedings of the SIGPLAN 1989 Conference on Programming Language Design and Implementation, pages 285–297, Portland, Oregon, 1989.
32. P. Tu and D. Padua. Array privatization for shared and distributed memory machines. In Proceedings 2 nd Workshop on Languages, Compilers, and Run-Time Environments for Distributed Memory Machines, September 1992.
33. P. Tu and D. Padua. Automatic array privatization. In Proceedings 6th Annual Workshop on Languages and Compilers for Parallel Computing, Portland, OR, August 1993.
34. Peng Tu and David Padua. GSA based demand-driven symbolic analysis. Technical Report 1339, University of Illinois at Urbana-Champaign, Centre for Supercomputing Rns & Dev, February 1994.
35. A. Viadimirescu. LSI Circuit Simulation on Vector Computers. PhD thesis, Electronics Research Laboratory, University of California, Berkeley, October 1982. Technical Rept. No. UCB/ERL M82/75,
36. M. Wolfe. Optimizing Compilers for Supercomputers. The MIT Press, Boston, MA, 1989.
37. J. Wu, J. Saltz, S. Hiranandam, and H. Berryman. Runtime compilation methods for multicomputers. In Dr. H.D. Schwetman, editor, Proceedings of the 1991 International Conference on Parallel Processing, pages 26–30. CRC Press, Inc., 1991. Vol. II - Software.
38. C. Zhu and P. C. Yew. A scheme to enforce data dependence on large multiprocessor systems. IEEE Trans. Softw. Eng., 13(6):726-739,June 1987.
39. H. Zima. Supercompilers for Parallel and Vector Computers. ACM Press, New York, New York, 1991.