A unified symbolic evaluation framework for parallelizing compilers

IEEE Transactions on Parallel and Distributed Systems

Volumn 11, Issue 11, 2000, Pages 1105-1125

  Fahringer, Thomas ^a   Scholz, Bernhard ^b  

^a UNIVERSITY OF VIENNA   (Austria)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Compiler optimizations; Data flow and control flow analysis; Parallel systems; Parallelizing compilers; Program context; Symbolic analysis; Symbolic dependence testing; Symbolic evaluation

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL METHODS; COMPUTER AIDED SOFTWARE ENGINEERING; CONSTRAINT THEORY; DATA FLOW ANALYSIS; FORMAL LOGIC; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS;

CONTROL FLOW ANALYSIS; PARALLELIZING COMPILERS; PROGRAM CONTEXTS; SYMBOLIC EVALUATION FRAMEWORK;

PROGRAM COMPILERS;

EID: 0034314943     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.888633     Document Type: Review

References (57)

1. C. Addison, J. Allwright, N. Binsted, N. Bishop, B. Carpenter, P. Dalloz, D. Gee, V. Getov, A. Hey, R. Hockney, M. Lemke J. Merlin, M. Pinches, C. Scott, and I. Wolton, "The GENESIS Distributed-Memory Benchmarks. Part 1: Methodology and General Relativity Benchmark with Results for the SUPRENUM Computer," Concurrency Practice and Experience, G. Fox, ed., vol. 5, no. 1, pp. 1-22, 1993.
2. A. Aho, R. Sethi, and J. Ullman, Compilers, Principles, Techniques and Tools. Addison-Wesley, 1988.
3. R. Ballance, A. Maccabe, and K. Ottenstein, "The Program Dependence Web: A Representation Supporting Control-, Data-, and Demand Driven Interpretation of Imperative Languages," Proc. SIGPLAN 90 Conf. Program Language Design and Implementation, pp. 257-271, June 1990.
4. D. Barthou, J.-F. Collard, and P. Feautrier, "Fuzzy Array Dataflow Analysis," J. Parallel and Distributed Computing, vol. 40, no. 2, pp. 210-226, Feb. 1997.
5. S. Benkner, "VFC: The Vienna Fortran Compiler," Scientific Programming, vol. 7, no. 1, pp. 67-81, 1999.
6. 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," Int'l J. Supercomputing Applications, vol. 3, no. 3, pp. 5-40, 1989.
7. P. Blaha, K. Schwarz, P. Dufek, and R. Augustyn, "Wien95, A Full-Potential, Linearized Augmented Plane Wave Program for Calculating Crystal Properties," technical report, Inst. of Technical Electrochemistry, Vienna Univ. of Technology, Vienna, Austria, 1995.
8. J. Blieberger, T. Fahringer, and B. Scholz, "Symbolic Cache Analysis for Real-Time Systems," Real-Time Systems, vol. 18, nos. 2/3, pp. 181-215, 2000.
9. W. Blume and R. Eigenmann, "Performance Analysis of Parallelizing Compilers on the Perfect Benchmark Programs," IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 6, pp. 643-656, Nov. 1992.
10. W. Blume and R. Eigenmann, "An Overview of Symbolic Analysis Techniques Needed for the Effective Parallelization of the Perfect Benchmarks," Proc. Int'l Conf. Parallel Processing, 1994.
11. W. Blume and R. Eigenmann, "The Range Test: A Dependence Test for Symbolic, Non-linear Expressions," CSRD (Center for Research on Parallel Computation) Report 1345, Center for Supercomputing Research and Development, Univ. of Illinois at Urbana-Champaign, Apr. 1994.
12. W. Blume and R. Eigenmann, "Demand-Driven, Symbolic Range Propagation," Proc. Eighth Workshop Languages and Compilers for Parallel Computing, Aug. 1995.
13. W. Blume, R. Eigenmann, K. Faigin, J. Grout, J. Hoeflinger, D.A. Padua, P. Petersen, B. Pottenger, L. Rauchwerger, P. Tu, and S. Weatherford, "Polaris: The Next Generation in Parallelizing Compilers," Proc. Seventh Workshop Languages and Compilers for Parallel Computing, pp. 10.1-10.18, Aug. 1994.
14. B. Chapman, T. Fahringer, and H. Zima, "Automatic Support for Data Distribution," Proc. Sixth Int'l Workshop Languages and Compilers for Parallel Computing, U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, eds., pp. 184-199, Aug. 1993.
15. T.E. Cheatham, G.H. Holloway, and J.A. Townley, "Symbolic Evaluation and the Analysis of Programs," IEEE Trans. Software Eng., vol. 5, no. 4, pp. 402-417, 1979.
16. A. Cimitile, A. De Lucia, and M. Munro, "Qualifying Reusable Functions Using Symbolic Execution," Proc. Second Working Conf. Reverse Eng., Aug. 1995.
17. A. Coen-Porisini, F. De Paoli, C. Ghezzi, and D. Mandrioli, "Software Specialization Via Symbolic Execution," IEEE Trans. Software Eng., vol. 17, no. 9, pp. 884-899, Sept. 1991.
18. P. Cousot and R. Cousot, "Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints," Proc. Fourth Ann. ACM Symp. Principles of Programming Languages, pp. 238-252, Jan. 1977.
19. P. Cousot and N. Halbwachs, "Automatic Discovery of Linear Restraints among Variables of a Program," Proc. Fifth Ann. ACM Symp. Principles of Programming Languages, pp. 84-97, Jan. 1978.
20. B. Creusillet and F. Irigoin, "Interprocedural Array Region Analyses," Int'l J. Parallel Programming, vol. 24, no. 6, pp. 513-546, Dec. 1996.
21. R. Cytron, J. Ferrante, B.K. Rosen, M.N. Wegman, and F.K. Zadeck, "Efficiently Computing Static Single Assignment Form and the Control Dependence Graph," ACM Trans. Programming Languages and Systems, vol. 13, no. 4, pp. 451-490, Oct. 1991.
22. R. Cytron, J. Ferrante, and V. Sarkar, "Experience Using Control Dependence in PTRAN," Languages and Compilers for Parallel Computing, D. Gelernter, A. Nicolau, and D. Padua, eds., MIT Press, 1990.
23. B. DiMartino, "Algorithmic Concept Recognition Support for Automatic Parallelization: A Case Study for Loop Optimization and Parallelization," J. Information Science and Eng., Mar. 1998.
24. T. Fahringer, "Estimating and Optimizing Performance for Parallel Programs," Computer, vol. 28, no. 11, pp. 47-56, Nov. 1995.
25. T. Fahringer, Automatic Performance Prediction of Parallel Programs. Boston: Kluwer Academic, Mar. 1996.
26. T. Fahringer, "Toward Symbolic Performance Prediction of Parallel Programs," IEEE Proc. 1996 Int'l Parallel Processing Symp., pp. 474-478, Apr. 1996.
27. T. Fahringer, "Efficient Symbolic Analysis for Parallelizing Compilers and Performance Estimators" J. Supercomputing, vol. 12, no. 3, pp. 227-252, May 1998.
28. T. Fahringer, "Symbolic Analysis Techniques for Program Parallelization," J. Future Generation Computer Systems, vol. 13, nos. 1,997/1,998, pp. 385-396, Mar. 1998.
29. T. Fahringer, E. Mehofer, "Buffer-Safe and Cost-Driven Communication Optimization," J. Parallel and Distributed Computing, vol. 57, no. 1, pp. 33-63, Apr. 1999.
30. M.P. Gerlek, E. Stoltz, and M. Wolfe, "Beyond Induction Variables: Detecting and Classifying Sequences Using a Demand-Driven SSA Form," ACM Trans. Programming Languages and Systems (TOPLAS), vol. 17, no. 1, pp. 85-122, Jan. 1995.
31. J. Gu, Z. Li, and G. Lee., "Experience with Efficient Array Data Flow Analysis for Array Privatization," Proc. Sixth ACM SIGPLAN Symp. Principles and Practice of Parallel Programming, pp. 157-167, June 1997.
32. M. Gupta, "Automatic Data Partitioning on Distributed Memory Multicomputers," PhD thesis, Univ. of Illinois at Urbana-Champaign, 1992.
33. M. Haghighat and C. Polychronopoulos, "Symbolic Analysis for Parallelizing Compilers," ACM Trans. Programming Languages and Systems (TOPLAS), vol. 18, no. 4, pp. 477-518, July 1996.
34. M.R. Haghighat, Symbolic Analysis for Parallelizing Compilers. Kluwer Academic, 1995.
35. M.W. Hall, J.M. Anderson, S.P. Amarasinghe, B.R. Murphy, S.-W. Liao, E. Bugnion, and M. Lam, "Maximizing Multiprocessor Performance with the SUIF Compiler," Computer, vol. 29, no. 12, pp. 84-89, Dec. 1996.
36. P. Havlak, "Interprocedural Symbolic Analysis," PhD thesis, Dept. of Computer Science, Rice Univ., 1994.
37. M.S. Hecht, Flow Analysis of Computer Programs. North-Holland: Elsevier, 1977.
38. "High Performance Fortran Forum, High Performance Fortran Language Specification, Version 1.1.δ," Technical Report, Rice Univ., Nov. 1994.
39. K. Kennedy, K. McKinley, and C.-W. Tseng, "Interactive Parallel Programming Using the ParaScope Editor," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 3, pp. 329-341, July 1991.
40. J.C. King, "Symbolic Execution and Program Testing," Comm. ACM, vol. 19, no. 7, pp. 385-394, July 1976.
41. G.S. Lueker, "Some Techniques for Solving Recurrences," ACM Computing Surveys, vol. 12, no. 4, pp. 419-435, Dec. 1980.
42. V. Maslov, "Delinearization: An Efficient Way to Break Multiloop Dependence Equations," Proc. Conf. Programming Language Design and Implementation (PLDI), vol. 27, pp. 152-161, July 1992.
43. V. Maslov and W. Pugh, "Simplifying Polynomial Constraints over Integers to Make Dependence Analysis More Precise," Technical Reports, UMIACS-TR-93-68. 1 and CS-TR-3109. 1, Dept. of Computer Science, Univ. of Maryland, Feb. 1994.
44. M. Metcalf and J. Reid, Fortran 90/95 Explained. Oxford Science Publications, 1996.
45. C.D. Polychronopoulos, M. Girkar, M.R. Haghighat, C.L. Lee, B. Leung, and D. Schouten, "Parafrase-2: An Environment for Parallelizing, Paritioning, Synchronizing, and Scheduling Programs on Multiprocessors," Proc. Int'l Conf. Parallel Processing, vol. II, pp. 39-48, Aug. 1989.
46. A. Pozgaj and T. Fahringer, "P3T+: A Performance Estimator for Parallel and Distributed Systems," AURORA Technical Report TR2000-03, Inst. for Software Science, Univ. of Vienna, Feb. 2000.
47. W. Pugh, "The Omega Test: A Fast and Practical Integer Programming Algorithm for Dependence Analysis," Comm. ACM, vol. 8, pp. 102-114, Aug. 1992.
48. W. Pugh and D. Wonnacott, "An Exact Method for Analysis of Value-Based Array Data Dependences," Lecture Notes in Computer Science, vol. 768, pp. 546-??, 1994.
49. W. Pugh and D. Wonnacott, "Nonlinear Array Dependence Analysis," Proc. Third Workshop Languages, Compilers, and Run-Time Systems for Scalable Computers, May 1995.
50. B.K. Rosen, M.N. Wegman, and F.K. Zadeck, "Global Value Numbers and Redundant Computations," Proc. 15th Ann. ACM SIGACT-SIGPLAN Symp. Principles of Programming Languages, pp. 12-27, Jan. 1988.
51. B. Scholz, J. Blieberger, and T. Fahringer, "Symbolic Pointer Analysis for Detecting Memory Leaks," Proc. Workshop Partial Evaluation and Semantics-Based Program Manipulation, pp. 104-113, Jan. 2000.
52. E. Su, A. Lain, S. Ramaswamy, D. Palermo, E. Hodges, and P. Banerjee, "Advanced Compilation Techniques in the Paradigm Compiler for Distributed-Memory Multicomputers," Proc. Ninth ACM Int'l Conf. Supercomputing, July 1995.
53. P. Tu and D. Padua, "Gated SSA-Based Demand-Driven Symbolic Analysis for Parallelizing Compilers," Proc. Ninth ACM Int'l Conf. Supercomputing, pp. 414-423, July 1995.
54. P. Tu, "Automatic Array Privatization and Demand-Driven Symbolic Analysis," PhD thesis, Univ. of Illinois at Urbana-Champaign, 1995.
55. S. Wolfram, Mathematica - A System for Doing Mathematics by Computer. Addison-Wesley, 1991.
56. D. Wonnacott, "Constraint-Based Array Dependence Analysis," PhD thesis, Univ. of Maryland, 1995.
57. H. Zima and B. Chapman, Supercompilers for Parallel and Vector Computers. Addison-Wesley, 1990.