Efficient Symbolic Analysis for Parallelizing Compilers and Performance Estimators

Journal of Supercomputing

Volumn 12, Issue 3, 1998, Pages 227-252

  Fahringer, Thomas ^a  

^a UNIVERSITY OF VIENNA   (Austria)

Author keywords

Comparing symbolic expressions; Program analysis; Simplifying constraints; Symbolic dependence testing; Symbolic expression bounds; Symbolic expressions

Indexed keywords

CONSTRAINT THEORY; FLOWCHARTING; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS); COMPUTER PROGRAMMING; DATA REDUCTION; MATHEMATICAL MODELS; PARAMETER ESTIMATION; PROBLEM SOLVING;

SYMBOLIC ANALYSIS; COMPARING SYMBOLIC EXPRESSIONS; PROGRAM ANALYSIS; SIMPLIFYING CONSTRAINTS; SYMBOLIC DEPENDENCE TESTING; SYMBOLIC EXPRESSION BOUNDS; SYMBOLIC EXPRESSIONS;

PROGRAM COMPILERS; CODES (SYMBOLS);

EID: 0032073381     PISSN: 09208542     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008013906463     Document Type: Article

References (23)

1. S. Benkner, S. Andel, R. Blasko, P. Brezany, A. Celic, B. Chapman, M. Egg, T. Fahringer, J. Hulman, Y. Hou, E. Kelc, E. Mehofer, H. Moritsch, M. Paul, K. Sanjari, V. Sipkova, B. Velkov, B. Wender, and H.P. Zima. Vienna Fortran Compilation System - Version 2.0 - User's Guide, October 1995.
2. 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. International Journal of Supercomputing Applications, pages 3(3): 5-40, 1989.
3. W. Blume and R. Eigenmann. An Overview of Symbolic Analysis Techniques Needed for the Effective Parallelization of the Perfect Benchmarks. In Proceedings of the 1994 International Conference on Parallel Processing, St. Charles, IL, 1994.
4. William Blume. Symbolic Analysis Techniques for Effective Automatic Parallelization. PhD thesis, Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign, June 1995.
5. I. Bronstein and K. Semendjajev. Taschenbuch der Mathematik. Verlag Harri Deutsch, Frankfurt, Germany, ISBN 3 87144492 8, 1989.
6. M.J. Clement and M.J. Quinn. Symbolic Performance Prediction of Scalable Parallel Programs. In Proc. of 9th International Parallel Processing Symposium, St. Barbara, CA, April 1995.
7. T. Fahringer. Estimating and Optimizing Performance for Parallel Programs. IEEE Computer, 28(11):47 - 56, November 1995. Postscript file available via http://www.par.univie.ac.at/~ tf/papers/p3t/ieee-mag.ps.
8. T. Fahringer. Automatic Performance Prediction of Parallel Programs. Kluwer Academic Publishers, Boston, USA, ISBN 0-7923-9708-8, March 1996.
9. T. Fahringer. Automatic Estimation of Communication Costs for Data Parallel Programs. Journal of Parallel and Distributed Computing, Academic Press, 39(1):46-65, Nov. 1996. Postscript file available via http://www.par.univie.ac.at/~ tf/papers/p3t/comm.ps.
10. 3T: A Static Performance Estimator. Concurrency Practice and Experience (Ed. Geoffrey Fox), Wiley, 8(4):261 - 282, May 1996. Postscript file available via http://www.par.univie.ac.at/~ tf/papers/p3t/workd.ps.
11. T. Fahringer. Toward Symbolic Performance Prediction of Parallel Programs. In IEEE Proc. of the 1996 International Parallel Processing Symposium, pages 474-478, Honolulu, Hawaii, April 15 - 19, 1996.
12. T. Fahringer and E. Mehofer. Buffer-Safe Communication Optimization based on Data Flow Analysis and Performance Prediction. In Proc. of the 1997 International Conference on Parallel Architectures and Compilation Techniques (PACT'97), pages 189-200, San Francisco, USA, November 11-15 1997.
13. T. Fahringer and B. Scholz. Symbolic Evaluation for Parallelizing Compilers. In Proc. of the 11th ACM International Conference on Supercomputing, Vienna, Austria, July 1997.
14. R. Graham, D. Knuth, and O. Patashnik. Concrete Mathematics - A foundation for Computer Science. Addison-Wesley Publishing Company, ISBN 0-201-14236-8, 1988.
15. M. Haghighat and C. Polychronopoulos. Symbolic Analysis for Parallelizing Compilers. ACM Transactions on Programming Languages and Systems (TOPLAS), pages 18(4):477-518, July 1996.
16. Paul Havlak. Interprocedural Symbolic Analysis. PhD thesis, Department of Computer Science, Rice University, 1994.
17. High Performance FORTRAN Language Specification. Technical Report, Version 2.0.δ, Rice University, Houston, TX, October 1996.
18. Vadim Maslov and William Pugh. Simplifying Polynomial Constraints Over Integers to Make Dependence Analysis More Precise. UMIACS-TR-93-68.1 and CS-TR-3109.1, Univ. of Maryland, Dept. of Computer Science, February 1994.
19. William Pugh. Counting Solutions to Presburger Formulas: How and Why. In ACM SIGPLAN'94 Conference on Programming Language Design and Implementation, pages 121-134, Orlando, FL, June 20-24 1994.
20. M. Scheibl, A. Celic, and T. Fahringer. Interfacing Mathematica from the Vienna Fortran Compilation System. Technical Report, Institute for Software Technology and Parallel Systems, Univ. of Vienna, December 1996.
21. E. Su, A. Lain, S. Ramaswamy, D. Palermo, E. Hodges, and P. Banerjee. Advanced Compilation Techniques in the Paradigm Compiler for Distributed-Memory Multicomputers. In Proc. of the 9th ACM International Conference on Supercomputing, Barcelona, Spain, July 1995.
22. N. Tawbi. Estimation of nested loop execution time by integer arithmetic in convex polyhedra. In Proc. of the 1994 International Parallel Processing Symposium, April 1994.
23. P. Tu and D. Padua. Gated SSA-Based Demand-Driven Symbolic Analysis for Parallelizing Compilers. In 9th ACM International Conference on Supercomputing, pages 414-423, Barcelona, Spain, July 1995.