Name
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 automatic parallelization technology. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1007/BFb0014192 | LCPC |
Keywords | Field | DocType |
interprocedural analysis,automatic parallelization,symbolic analysis | Computer science,Parallel computing,Scalar (physics),Call graph,Compiler,Transfer function,Symbolic data analysis,Automatic parallelization | Conference |
ISBN | Citations | PageRank |
3-540-60765-X | 34 | 1.99 |
References | Authors | |
14 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mary W. Hall | 1 | 2328 | 263.34 |
| Brian R. Murphy | 2 | 608 | 84.68 |
| Saman P. Amarasinghe | 3 | 4734 | 395.55 |
| Shih-wei Liao | 4 | 703 | 92.73 |
| Monica S. Lam | 5 | 5585 | 705.61 |