Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Interprocedural Analysis for Parallelization Mary W. Hally,

Summary: Interprocedural Analysis for Parallelization
Mary W. Hally,
Brian R. Murphy, Saman P. Amarasinghe,
Shih­Wei Liao, Monica S. Lam
Computer Systems Laboratory
Stanford University
Stanford, CA 94305
yComputer Science Dept.
California Institute of Technology
Pasadena, CA 91125
Abstract. This paper presents an extensive empirical evaluation of an
interprocedural parallelizing compiler, developed as part of the Stanford
SUIF compiler system. The system incorporates a comprehensive and
integrated collection of analyses, including privatization and reduction
recognition for both array and scalar variables, and symbolic analysis of
array subscripts. The interprocedural analysis framework is designed to
provide analysis results nearly as precise as full inlining but without its
associated costs. Experimentation with this system on programs from
standard benchmark suites demonstrate that an integrated combination
of interprocedural analyses can substantially advance the capability of


Source: Amarasinghe, Saman - Computer Science and Artificial Intelligence Laboratory & Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (MIT)


Collections: Computer Technologies and Information Sciences