Symbolic analysis techniques for program parallelization

Future Generation Computer Systems

Volumn 13, Issue 4-5, 1998, Pages 385-396

  Fahringer, Thomas ^a  

^a UNIVERSITY OF VIENNA   (Austria)

Author keywords

Comparing symbolic expressions; Compilers; Non linear expressions; Program analysis; Program unknowns; Simplifying symbolic expressions; Solutions to systems of constraints; Symbolic dependence analysis; Symbolic expression bounds

Indexed keywords

CODES (SYMBOLS); COMPUTER SOFTWARE; CONSTRAINT THEORY; DATA REDUCTION; PARALLEL PROCESSING SYSTEMS;

NONLINEAR EXPRESSIONS; PARALLELIZING COMPILERS; PROGRAM ANALYSIS; PROGRAM UNKNOWNS; SYMBOLIC DEPENDENCE ANALYSIS; SYMBOLIC EXPRESSION BOUNDS;

PROGRAM COMPILERS;

EID: 0032021545     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-739x(97)00039-3     Document Type: Article

References (10)

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, H.P. Zima, Vienna Fortran Compilation System - Version 2.0 - User's Guide, October 1995.
2. M. Berry et al., The PERFECT club benchmarks: Effective performance evaluation of supercomputers, Int. J. Supercomput. Appl. 3 (3) (1989) 5-40.
3. W. Blume, Symbolic analysis techniques for effective automatic parallelization, Ph.D. Thesis, Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign, June 1995.
4. T. Fahringer, Estimating and optimizing performance for parallel programs, IEEE Comput. 28 (11) (1995) 47-56. Postscript file available via http://www.par.univie.ac.at/∼tf/papers/p3t/ieee-mag.ps.
5. T. Fahringer, Automatic Performance Prediction of Parallel Programs, Kluwer Academic Publishers, Boston, ISBN 0-7923-9708-8, March 1996.
6. T. Fahringer, Toward symbolic performance prediction of parallel programs, in: IEEE Proceedings of the 1996 International Parallel Processing Symposium, Honolulu, Hawaii, 1996, pp. 474-478.
7. T. Fahringer, Symbolic expression evaluation to support parallelizing compilers, in: IEEE Proceedings of the 5th Euromicro Workshop on Parallel and Distributed Processing, London, 1997, pp. 22-24.
8. M. Haghighat, C. Polychronopoulos, Symbolic Analysis for Parallelizing Compilers, ACM Trans. Programming Languages Syst. (TOPLAS) 18 (4) (1996) 477-518.
9. W. Pugh, Counting solutions to presburger formulas: How and why, in: ACM SIGPLAN'94 Conference on Programming Language Design and Implementation, Orlando, FL, 1994, pp. 121-134.
10. N. Tawbi, Estimation of nested loop execution time by integer arithmetic in convex polyhedra, in: Proceedings of the 1994 International Parallel Processing Symposium, April 1994.