Interprocedural dependence analysis and parallelization

ACM SIGPLAN Notices

Volumn 39, Issue 4, 2004, Pages 139-140

  Burke, Michael G ^a   Cytron, Ron K ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); DATA STORAGE EQUIPMENT; FUNCTIONS; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; OPTIMIZATION; VECTORS;

DIRECTION VECTORS; PARALLEL RESOURCES; PARALLELIZATION;

COMPUTER SCIENCE;

EID: 3142692758     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/989393.989411     Document Type: Conference Paper

References (4)

1. M. W. Hall, S. Amarasinghe, B. Murphy, S. Liao, and M. Lam. Detecting coarse-grain parallelism using an interprocedural parallelizing compiler. Proceedings of Supercomputing '95, 1995.
2. Michael Hind, Michael Burke, Paul Carini, and Sam Midkiff. An Empirical Study of Precise Interprocedural Array Analysis. Scientific Programming, 3(3), 1994.
3. Maydan, Hennessy, and Lam. Efficient and exact data dependence analysis. PLDI, 1991.
4. Michael J. Wolfe. Optimizing Supercompilers for Supercomputers. Pitman, London and The MIT Press, Cambridge, Massachusetts, 1989. In the series, Research Monographs in Parallel and Distributed Computing This monograph is a revised version of the author's Ph.D. dissertation published as Technical Report UIUCDCS-R-82-1105, U. Illinois at Urbana-Champaign, 1982.