The privatizing DOALL test: Technique for DOALL loop identification and array privatization

Proceedings of the International Conference on Supercomputing

Volumn Part F129421, Issue , 1994, Pages 33-43

  Rauchwerger, Lawrence ^a   Padua, David ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

COST BENEFIT ANALYSIS; EMBEDDED SYSTEMS; INTELLIGENT CONTROL; PRIVATIZATION; PROGRAM COMPILERS; PROGRAM DEBUGGING;

ACCESS PATTERNS; CONTROL FLOWS; ITS DATA; PARALLEL LOOPS; PARALLEL PROGRAM; PARALLELIZING COMPILER; RUNTIMES;

TESTING;

EID: 84976735460     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/181181.181254     Document Type: Conference Paper

References (30)

1. Alliant Computer Systems Corporation. 42 Nagog Park, Acton, Massachusetts 01720. FX/Series Architecture Manual, 1986. Part Number: 300-00001-B.
2. Alliant Computers Systems Corporation. Alliant FX/2800 Series System Description, 1991.
3. U. Banerjee. Dependence Analysis for Supercomputing. Kluwer. Boston, MA., 1988.
4. M. Berry, D. Chen, P. Koss, D. Kuck, S. Lo, Y. Pang, R. Roloff, A. Sameh, E. Clementi, S. Chin, D. Schneider, G. Fox, P. Messina, D. Walker, C. Hsiung, J. Schwarzmeier, 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.
5. H. Berryman and J. Saltz. A manual for PARTI runtime primitives. Interim Report 90-13, ICASE, 1990.
6. W. Blume and R. Eigenmann. Performance Analysis of Parallelizing Compilers on the Perfect Benchmarks™ Programs. IEEE Trans, of Parallel and Distributed Systems, 3(6):643-656, November 1992.
7. M. Burke, R. Cytron, J. Ferrante, and W. Hsieh. Automatic generation of nested, fork-join parallelism. Journal of Super-computing, pages 71-88, 1989.
8. R. Eigenmann and W. Blume. An effectiveness study of parallelizing compiler techniques. In Proc. of the 1991 Int'l. Conf. on Parallel Processing, pages 17-25, August 1991.
9. P. A. Emrath, S. Ghosh, and D. A. Padua. Detecting nonde-terminacy in parallel programs. IEEE Software, pages 69-77, January 1992.
10. M. Guzzi, D. Padua, J. Hoeflinger, and D. Lawrie. Cedar fortran and other vector and parallel fortran dialects. Journal of Supercomputing, 4(1):37-62, March 1990.
11. D. J. Kuck, R. H. Kuhn, D. A. Padua, B. Leasure, and M. Wolfe. Dependence graphs and compiler optimizations. In Proc. of the 8th ACM Symp. on Principles of Programming Languages, pages 207-218, January 1981.
12. F. Thomson Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kauf-mann, 1992.
13. S. Leung and J. Zahorjan. Improving the performance of runtime parallelization. In Proc. Jfih ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming (PPOPP), pages 83-91, May 1993.
14. Z. Li. Array privatization for parallel execution of loops. In Proc. of the 19th Int'l. Symp. on Computer Architecture, pages 313-322, 1992.
15. D. E. Maydan, S. P. Amarasinghe, and M. S. Lam. Data dependence and data-flow analysis of arrays. In Proc. 5th Workshop on Programming Languages and Compilers for Parallel Computing, August 1992.
16. S. Midkiff and D. Padua. Compiler algorithms for synchronization. IEEE Trans. Comput., C-36(12):1485-1495,1987.
17. D. A. Padua and M. J. Wolfe. Advanced compiler optimizations for supercomputers. Commun. of the ACM, 29:11841201, December 1986.
18. C. Polychronopoulos. Compiler Optimizations for Enhancing Parallelism and Their Imp act on Architecture Design. IEEE Trans, on Comput., C-37(8):991-1004, August 1988.
19. J. Saltz and R. Mirchandaney. The preprocessed doacross loop. In Dr. H.D. Schwetman, editor, Proc. of the 1991 Int'l. Conf. on Parallel Processing, St. Charles, Illinois, August 1216, pages 174-178. CRC Press, Inc., 1991. Vol. II-Software.
20. J. Saltz, R. Mirchandaney, and K. Crowley. The doconsider loop. In Proc. of the 1989 ACM Int'l. Conf. on Supercomputting, Crete, Greece, pages 29-40, June 1989.
21. J. Saltz, R. Mirchandaney, and K. Crowley. Run-time parallelization and scheduling of loops. IEEE Trans. Comput., 40(5), May 1991.
22. E. Schonberg. On-the-fly detection of access anomalies. In Proc. SigPlan Conf. Programming Languages Design and Implementation (PLDI)., pages 285-297. ACM Press, New York, 1989.
23. J. E. Thornton. Design of a Computer-.The Control Data 6600. Scott, Foresman, Glenview, Illinois, 1971.
24. R. M. Tomasulo. An efficient algorithm for exploiting multiple arithmetic units. IBM Journal of Research and Development, 11:25-33, January 1967.
25. P. Tu and D. Padua. Array privatization for shared and distributed memory machines. In Proc. 2nd Workshop on Languages, Compilers, and Run-Time Environments for Distributed Memory Machines, September 1992.
26. P. Tu and D. Padua. Automatic array privatization. In Proc. 6th Annual Workshop on Languages and Compilers for Parallel Computing, Portland, OR, August 1992.
27. M. Wolfe. Optimizing Compilers for Supercomputers. The MIT Press, Boston, MA, 1989.
28. J. Wu, J. Saltz, S. Hiranandani, and H. Berryman. Runtime compilation methods for multicomputers. In Dr. H.D. Schwetman, editor, Proc. of the 1991 Int'l. Conf. on Parallel Processing, St. Charles, Illinois, August. 12-16, pages 26-30. CRC Press, Inc., 1991. Vol. II-Software.
29. C. Zhu and P. Yew. A scheme to enforce data dependence on large multiprocessor systems. IEEE Trans. Softw. Eng., 13(6):726-739, June 1987.
30. H. Zima. Supercompilers for Parallel and Vector Computers. ACM Press, New York, New York, 1991.