Schedule for In-Class Discussions

• Partial Redundancy Elimination
  • Knoop, J., Ruething, O., and Steffen, B. ``Lazy Code Motion,'' in PLDI, pages 224-234, June 1992.
  • Fred C. Chow, Sun Chan, Robert Kennedy, Shin-Ming Liu, Raymond Lo, and Peng Tu. ``A New Algorithm for Partial Redundancy Elimination Based on SSA Form,'' in PLDI, pages 273-286, June 1997. Primary

• Pointer Analysis
  • Ghiya, Lavery, and Sehr, "On the importance of points-to analysis and other memory disambiguation methods for C programs" PLDI 2001 Primary
  • Nevin Heintze and Olivier Tardieu, "Ultra-fast aliasing analysis using CLA: a million lines of C code in a second" PLDI 2001
  • Rakesh Ghiya and Laurie J. Hendren. ``Putting Pointer Analysis to Work,'' in Proceedings of the 25th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Diego, California, pages 121-133, January 1998.
  • Rakesh Ghiya and Laurie J. Hendren. ``Is it a Tree, a DAG, or a Cyclic Graph? A Shape Analysis for Heap-Directed Pointers in C,'' in Proceedings of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, St. Petersburg, Florida, pages 1-15, January 1996. Secondary
  • Maryam Emami, Rakesh Ghiya, and Laurie J. Hendren. ``Context-Sensitive Interprocedural Points-to Analysis in the Presence of Function Pointers,'' in Proceedings of the ACM SIGPLAN '94 Conference on Programming Language Design and Implementation, pages 242-256, June 1994.
  • Robert P. Wilson and Monica S. Lam. ``Efficient Context-Sensitive Pointer Analysis for C Programs,'' in Proceedings of the ACM SIGPLAN'95 Conference on Programming Language Design and Implementation, pages 1-12, June 1995.

• Eliminating Memory References
  • Rastislav Bodik, Rajiv Gupta and Mary Lou Soffa. ``Load-Reuse Analysis: Design and Evaluation,'' in Proceedings of the ACM SIGPLAN '99 Conference on Programming Language Design and Implementation, pages 64-76. May 1999. Primary
  • Raymond Lo, Fred Chow, Robert Kennedy, Shin-Ming Liu and Peng Tu. ``Register Promotion by Sparse Partial Redundancy Elimination of Loads and Stores,'', in Proceedings of the ACM SIGPLAN '98 Conference on Programming Language Design and Implementation, pages 26-37, June 1998. Secondary
  • John Lu, Keith D. Cooper, Register promotion in C programs, PLDI 1997

• Profiling Techniques
  • Thomas Ball and James R. Laurus. ``Efficient Path Profiling,'' in Proceedings of the 29th Annual IEEE/ACM International Symposium on Microarchitecture, pages 46-57, December 1996.
  • James R. Larus. ``Whole Program Paths,'' in Proceedings of the ACM SIGPLAN '99 Conference on Programming Language Design and Implementation, pages 259-269, May 1999. Primary
  • Jennifer M. Anderson, Lance M. Berc, Jeffrey Dean, Sanjay Ghemawat, Monika R. Henzinger, Shun-Tak A. Leung, Richard L. Sites, Mark T. Vandevoorde, Carl A. Waldspurger and William E. Weihl. ``Continuous Profiling: Where Have All the Cycles Gone?,'', in Proceedings of the Sixteenth ACM Symposium on Operating Systems Principles, pages 1-14, October 1997. Secondary

• Dynamic Optimizations
  • Vasanth Bala, Evelyn Duesterwald and Sanjeev Banerjia. ``Dynamo: a Transparent Dynamic Optimization System,'' in Proceedings of the ACM SIGPLAN '00 Conference on Programming Language Design and Implementation, pages 1-12, June 2000. Primary
  • Brian Grant, Matthai Philipose, Markus Mock, Craig Chambers and Susan J. Eggers. ``An Evaluation of Staged Run-Time Optimizations in DyC,'' in Proceedings of the ACM SIGPLAN '99 Conference on Programming Language Design and Implementation, pages 293-304, May 1999. Secondary
  • Matthew Arnold, Stephen Fink, David Grove, Michael Hind and Peter F. Sweeney. ``Adaptive Optimization in the Jalapeno JVM,'' in Proceedings of the Conference on Object-Oriented Programming, Systems, Languages, and Applications, pages 47-65, October 2000.
  • Alexander Klaiber. ``The Technology Behind Crusoe Processors,'' Transmeta Corporation,
    http://www.transmeta.com/crusoe/technology.html.
  • Matthew C. Merten, Andrew R. Trick, Erik M. Nystrom, Ronald D. Barnes, and Wen-mei W. Hwu. ``A Hardware Mechanism for Dynamic Extraction and Relayout of Program Hot Spots,'' in Proceedings of the 27th International Symposium on Computer Architecture, pages 59-70, June 2000.

• Improving Data Cache Performance
  • T. Chilimbi, "Efficient representations and abstractions for quantifying and exploiting data reference locality" PLDI 2001 Primary
  • Trishul M. Chilimbi, Bob Davidson, and James R. Larus. ``Cache-Conscious Structure Definition,'' in Proceedings of the ACM SIGPLAN '99 Conference on Programming Language Design and Implementation, pages 13-24, May 1999.
  • Trishul M. Chilimbi, Mark D. Hill, and James R. Larus, ``Cache-Conscious Structure Layout,'' in Proceedings of the ACM SIGPLAN '99 Conference on Programming Language Design and Implementation, pages 1-12, May 1999.
  • C. Ding, K. Kennedy, "Improving Cache Performance in Dynamic Applications through Data and Computation Reorganization at Run Time" PLDI 1999 Secondary

• Register Allocation
  • A Appel and L George, Optimal Spilling for CISC Machines with Few Registers, PLDI 2001
  • Guei-Yuan Lueh, Thomas Gross, Call-cost directed register allocation, PLDI 1997
  • Peter Bergner, Peter Dahl, David Engebretsen, Matthew O'Keefe, Spill code minimization via interference region spilling, PLDI 1997