Papers for CS612

Roman Chariots/Concurrent SSA

• Optimal Control Dependence and the Roman Chariots Problem. Pingali and Bilardi. [ps]
• The Static Single Assignment Form and its Computation. Pingali and Bilardi. [ps]
• Automatic construction of sparse data flow evaluation graphs. Ferrante. POPL '91. [ps]
• Basic Compiler Algorithms for Parallel Programs. Lee, Padua, and Midkiff. [ps]

Array Analysis

• The Omega Test: a fast and practical integer programming algorithm for dependence analysis. Pugh. [ps]
• Access Normalization: Loop Restructuring for NUMA Compilers. Li and Pingali. [ps]
• Data-centric Multi-level Blocking. Kodukula, Ahmed, and Pingali. [ps]
• From Flops to MegaFlops: Java for Technical Computing. Moreira, Midkiff, and Gupta. [ps]
• Closing the Performance Gap between Java and Fortran in Technical Computing. slides from a talk. Moreira. [ps]
• Just-in-time optimization for high-performance Java programs. Cierniak and Li. [ps]

Region-based Allocation

• Stack Allocating Objects in Java. Gay and Steensgard. Microsoft Research TR. [ps]
• Memory Management with Explicit Regions. Gay and Aiken. PLDI'98. [pdf]

Recursive Data-Structure Analysis

• Putting pointer analysis to work. Ghiya and Hendren. [ps]
• A General Data Dependence Test for Dynamic Pointer-based Data Structures. Hummel, Hendren, and Nicolau, [ps]
• Is it a tree, DAG, or Cyclic Graph? A shape analysis for heap-directed pointers in C. Ghiya and Hendren. [ps]
• Interprocedural May-alias Analysis for Pointers: Beyond k-limiting. A. Deutsch. [ps]
• A survey paper on stack analysis techniques (and some extensions to heap analysis) Hind, et. al. [ps]
• Using Generational Garbage Collection To Implement Cache-Conscious Data Placement, Chilimbi and Larus, International Symposium on Memory Management, October 1998. [ps]
• Cache-Conscious Structure Layout. Chilimbi, Larus, and Hill. to appear, PLDI '99. [ps]
• Cache-Conscious Structure Definition. Chilimbi, Davidson, Larus. to appear, PLDI '99. [ps]
• Locality Optimization in JavaParty by Means of Static Type Analysis. Philippsen and Haumacher. [ps]
• Programs with Recursively Defined Data Structures Using Pointers. Sagiv, et al., Dagstuhl Workshop on Generic Programming, April 1998. [ps]
• External Memory Algorithms and Data Structures. Jeffrey Vitter. In the book, External Memory Algorithms, edited by Abello and Vitter. [ps]

Interprocedural Analysis and Optimization

• Whole Program Analysis. Chambers, Dean and Grove. University of Washington, Department of Computer Science and Engineering Technical Report UW-CSE-96-06-02. [ps]
• Precise Concrete Type Inference for Object-Oriented Lnaguages. Plevyak and Chien. OOPSLA '94 [ps]
• Reducing indirect function call overhead in C++ programs. Calder and Grunweld. POPL '94 [ps]
• Simple and Effective Analysis of Statically-typed Object-Oriented Programs. Diwan, Moss and McKinley. OOPSLA '96 [ps]
• There are a number of papers that discuss interprocedural analysis and optimization. See Pingali for these references.

Parallelism in Java

• Speculative Parallel Execution on JVM. Yoshizoe, Matsumoto, and Hiraki. [ps]

Miscellaneous

• Compiling Java to a Typed Lambda-Calculus: A Preliminary Report. Wright, Jagannathan, Ungureanu and Hertzmann. [ps]
• Marmot: an Optimizing Compiler for Java, Knoblock, et al. Microsoft Research Technical Report [pdf]