Run-time parallelization: Its time has come

Parallel Computing

Volumn 24, Issue 3-4, 1998, Pages 527-556

  Rauchwerger, Lawrence ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

Compiler; Debugging; Inspector executor; Irregular applications; Parallelization; Pointer aliasing; Run time; Scheduling; Speculative; Subsripted scripts

Indexed keywords

COMPUTER SIMULATION; COMPUTER SYSTEMS PROGRAMMING; DATA REDUCTION; PROGRAM COMPILERS; PROGRAM DEBUGGING; RESPONSE TIME (COMPUTER SYSTEMS);

DATA DEPENDENCE ANALYSIS; POINTER ALIASING;

PARALLEL PROCESSING SYSTEMS;

EID: 0032066426     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(98)00024-6     Document Type: Article

References (49)

1. W. Blume, R. Eigenmann, J. Hoeflinger, D. Padua, P. Petersen, L. Rauchwerger, P. Tu, Automatic detection of parallelism: a grand challenge for high-performance computing, IEEE Parallel Distributed Technol. 2 (3) (1994) 37-47.
2. D.A. Padua, M.J. Wolfe, Advanced compiler optimizations for supercomputers, Commun. ACM 29 (1986) 1184-1201.
3. M. Wolfe, Optimizing Compilers for Supercomputers, MIT Press, Boston, MA, 1989.
4. K. Kennedy, Compiler technology for machine-independent programming, Int. J. Paral. Prog. 22 (1) (1994) 79-98.
5. W. Blume, R. Eigenmann, Performance analysis of parallelizing compilers on the perfect Benchmarks™ programs, IEEE Trans. Parallel Distributed Syst. 3 (6) (1992) 643-656.
6. W.J. Camp, S.J. Plimpton, B.A. Hendrickson, R.W. Leland, Massively parallel methods for engineering and science problems, Commun. ACM 37 (4) (1994) 31-41.
7. R. Eigenmann, J. Hoeflinger, Z. Li, D. Padua, Experience in the automatic parallelization of four perfect-benchmark programs, Lecture Notes in Computer Science 589, in: Proceedings of the Fourth Workshop on Languages and Compilers for Parallel Computing, Santa Clara, CA, August 1991, pp. 65-83.
8. U. Banerjee, Dependence Analysis for Supercomputing, Kluwer, Boston, MA, 1988.
9. D.J. Kuck, R.H. Kuhn, D.A. Padua, B. Leasure, M. Wolfe, Dependence graphs and compiler optimizations, in: Proceedings of the 8th ACM Symposium on Principles of Programming Languages, January 1981, pp. 207-218.
10. H. Zima, Supercompilers for Parallel and Vector Computers, ACM Press, New York, NY, 1991.
11. M. Burke, R. Cytron, J. Ferrante, W. Hsieh, Automatic generation of nested, fork-join parallelism, J. Supercomput. (1989) 71-88.
12. Z. Li, Array privatization for parallel execution of loops, in: Proceedings of the 19th International Symposium on Computer Architecture, 1992, pp. 313-322.
13. D.E. Maydan, S.P. Amarasinghe, 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.
14. P. Tu, D. Padua, Array privatization for shared and distributed memory machines, in: Proceedings 2nd Workshop on Languages, Compilers and Run-Time Environments for Distributed Memory Machines, September 1992.
15. P. Tu, D. Padua, Automatic array privatization, in: Proceedings 6th Annual Workshop on Languages and Compilers for Parallel Computing, Portland, OR, August 1993.
16. C. Kruskal, Efficient parallel algorithms for graph problems, in: Proceedings of the 1985 International Conference on Parallel Processing, August 1985.
17. C. Kruskal, Efficient parallel algorithms for graph problems, in: Proceedings of the 1986 International Conference on Parallel Processing, August 1986, pp. 869-876.
18. F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann, 1992.
19. S. Midkiff, D. Padua, Compiler algorithms for synchronization, IEEE Trans. Comput. C 36 (12) (1987) 1485-1495.
20. C. Zhu, P.C. Yew, A scheme to enforce data dependence on large multiprocessor systems, IEEE Trans. Soft. Eng. 13 (6) (1987) 726-739.
21. L. Rauchwerger, N. Amato, D. Padua, A scalable method for run-time loop parallelization, IJPP 26 (6) (1995) 537-576.
22. M. Byler, J. Davies, C. Huson, B. Leasure, M. Wolfe, Multiple version loops, in: Proc. of 1987 Int'l. Conf. on Parallel Processing, St. Charles, IL, 1987.
23. D.K. Chen, P.C. Yew, J. Torrellas, An efficient algorithm for the run-time parallelization of doacross loops, in: Proceedings of Supercomputing 1994, Nov. 1994, pp. 518-527.
24. V. Krothapalli, P. Sadayappan, An approach to synchronization of parallel computing, in: Proceedings of the 1988 International Conference on Supercomputing, June 1988, pp. 573-581.
25. S. Leung, J. Zahorjan, Improving the performance of runtime parallelization, in: 4th PPOPP, May 1993, pp. 83-91.
26. C. Polychronopoulos, Compiler optimizations for enhancing parallelism and their impact on architecture design, IEEE Trans. Comput. C 37 (8) (1988) 991-1004.
27. J. Saltz, R. Mirchandaney, The preprocessed doacross loop, in: H.D. Schwetman (Ed.), Proceedings of the 1991 International Conference on Parallel Processing, Vol. II - Software, CRC Press, 1991, pp. 174-178.
28. J. Saltz, R. Mirchandaney, K. Crowley, Run-time parallelization and scheduling of loops, IEEE Trans. Comput. 40 (5) (1991) .
29. L. Rauchwerger, D. Padua, The privatizing doall test: A run-time technique for doall loop identification and array privatization, in: Proceedings of the 1994 International Conference on Supercomputing, July 1994, pp. 33-43.
30. L. Rauchwerger, D. Padua, The LRPD test: speculative run-time parallelization of loops with privatization and reduction parallelization, Technical Report 1390, Univ. of Illinois at Urbana-Champaign, Cntr. for Supercomputing Res. and Dev., November 1994.
31. H. Berryman, J. Saltz, A manual for PARTI runtime primitives, Interim Report 90-13, ICASE, 1990.
32. J. Saltz, R. Mirchandaney, K. Crowley, The doconsider loop, in: Proceedings of the 1989 International Conference on Supercomputing, June 1989, pp. 29-40.
33. J. Wu, J. Saltz, S. Hiranandani, H. Berryman, Runtime compilation methods for multicomputers, in: H.D. Schwetman (Ed.), Proceedings of the 1991 International Conference on Parallel Processing, Vol. II - Software, CRC Press, 1991, pp. 26-30.
34. L. Rauchwerger, N. Amato, D. Padua, Run-time methods for parallelizing partially parallel loops, in: Proceedings of the 1995 International Conference on Supercomputing, Barcelona, Spain, July 1995, pp. 137-146.
35. A. Nicolau, Run-time disambiguation: coping with statically unpredictable dependencies, IEEE Trans. Comput. 38 (5) (1989) 663-678.
36. A.S. Huang, G. Slavenburg, J.P. Shen, Speculative disambiguation: A compilation technique for dynamic memory disambiguation, in: Proceedings of the 21st Annual International Symposium on Computer Architecture, Chicago, IL, April 1994, pp. 200-210.
37. D.M. Gallagher, W.Y. Chen, S.A. Malke, J.G. Gyllenhaal, W.W. Hwu, Dynamic memory disambiguation using the memory conflict buffer, in: Proc. 21st Ann. Int'l. Symp. Computer Architecture, Chicago, IL, April 1994, pp. 183-195.
38. L. Rauchwerger, D.A. Padua, The LRPD test: speculative run-time parallelization of loops with privatization and reduction parallelization, in: Proceedings of the SIGPLAN 1995 Conference on Programming Language Design and Implementation, La Jolla, CA, June 1995, pp. 218-232.
39. Alliant Computer Systems, FX/Series Architecture Manual, 1986.
40. Alliant Computers Systems, Alliant FX/2800 Series System Description, 1991.
41. 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, 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.
42. T. Allen, D.A. Padua, Debugging fortran on a shared-memory machine, in: Proceedings of the 1987 International Conference on Parallel Processing, St. Charles, IL, 1987, pp. 721-727.
43. P.A. Emrath, S. Ghosh, D.A. Padua, Detecting nondeterminacy in parallel programs, IEEE Soft., January 1992,
44. E. Schonberg, On-the-fly detection of access anomalies, in: Proceedings of the SIGPLAN 1989 Conference on Programming Language Design and Implementation, Portland, OR, 1989, pp. 285-297.
45. A. Dinning, E. Schonberg, An empirical comparison of monitoring algorithms for access anomaly detection, in: Proc. of 2nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP), 1990, pp. 1-10.
46. I. Nudler, L. Rudolph, Tools for the efficient development of efficient parallel programs, in: Proc. 1st Israeli Conference on Computer System Engineering, 1988.
47. J. Mellor-Crummey, On-the-fly detection of data races for programs with nested fork-join parallelism, in: Proceedings of Supercomputing 1991, Albuquerque, NM, Nov. 1991, pp. 24-33.
48. J. Mellor-Crummey, Compile-time support for efficient data race detection in shared-memory parallel programs, in: Proc. of the ACM/ONR Workshop on Parallel and Distributed Debugging, San Diego, CA, May 1993, pp. 129-139.
49. D.R. Jefferson, Virtual time , ACM Trans. Programming Languages Syst. 7 (3) (1985) 404-425.