LCPC 2002: College Park, MD, USA

• Daniel Cociorva, Gerald Baumgartner, Chi-Chung Lam, P. Sadayappan, J. Ramanujam:
  Memory-Constrained Communication Minimization for a Class of Array Computations. 1-15
  
• Martin Griebl, Paul Feautrier, Armin Größlinger:
  Forward Communication Only Placements and Their Use for Parallel Program Construction. 16-30
  
• Motoki Obata, Jun Shirako, Hiroki Kaminaga, Kazuhisa Ishizaka, Hironori Kasahara:
  Hierarchical Parallelism Control for Multigrain Parallel Processing. 31-44
  
• Yi-Ping You, Chingren Lee, Jenq Kuen Lee:
  Compiler Analysis and Supports for Leakage Power Reduction on Microprocessors. 45-60
  
• Aart J. C. Bik, Milind Girkar, Paul M. Grey, Xinmin Tian:
  Automatic Detection of Saturation and Clipping Idioms. 61-74
  
• Yung-Chia Lin, Yuan-Shin Hwang, Jenq Kuen Lee:
  Compiler Optimizations with DSP-Specific Semantic Descriptions. 75-89
  
• Michelle Mills Strout, Larry Carter, Jeanne Ferrante, Jonathan Freeman, Barbara Kreaseck:
  Combining Performance Aspects of Irregular Gauss-Seidel Via Sparse Tiling. 90-110
  
• Ismail Kadayif, Mahmut T. Kandemir, Alok N. Choudhary:
  A Hybrid Strategy Based on Data Distribution and Migration for Optimizing Memory Locality. 111-125
  
• Henry G. Dietz, Timothy Mattox:
  Compiler Optimizations Using Data Compression to Decrease Address Reference Entropy. 126-141
  
• Francisco Corbera, Rafael Asenjo, Emilio L. Zapata:
  Towards Compiler Optimization of Codes Based on Arrays of Pointers. 142-156
  
• Tong Chen, Jin Lin, Wei-Chung Hsu, Pen-Chung Yew:
  An Empirical Study on the Granularity of Pointer Analysis in C Programs. 157-171
  
• Zehra Sura, Chi-Leung Wong, Xing Fang, Jaejin Lee, Samuel P. Midkiff, David A. Padua:
  Automatic Implementation of Programming Language Consistency Models. 172-187
  
• Hao Yu, Francis H. Dang, Lawrence Rauchwerger:
  Parallel Reductions: An Application of Adaptive Algorithm Selection. 188-202
  
• Jaejin Lee, H. D. K. Moonesinghe:
  Adaptively Increasing Performance and Scalability of Automatically Parallelized Programs. 203-217
  
• Pedro C. Diniz, Bing Liu:
  Selector: A Language Construct for Developing Dynamic Applications. 218-232
  
• Ji Zhang, Jaejin Lee, Philip K. McKinley:
  Optimizing the Java Piped I/O Stream Library for Performance. 233-248
  
• Hasnain A. Mandviwala, Nissim Harel, Kathleen Knobe, Umakishore Ramachandran:
  A Comparative Study of Stampede Garbage Collection Algorithms. 249-264
  
• Xiaogang Li, Ruoming Jin, Gagan Agrawal:
  Compiler and Runtime Support for Shared Memory Parallelization of Data Mining Algorithms. 265-279
  
• Hansang Bae, Rudolf Eigenmann:
  Performance Analysis of Symbolic Analysis Techniques for Parallelizing Compilers. 280-294
  
• Robert Seater, David Wonnacott:
  Efficient Manipulation of Disequalities During Dependence Analysis. 295-308
  
• Bob Blainey, Christopher Barton, José Nelson Amaral:
  Removing Impediments to Loop Fusion Through Code Transformations. 309-328
  
• Xavier Vera, Josep Llosa, Antonio González:
  Near-Optimal Padding for Removing Conflict Misses. 329-343
  
• Alban Douillet, José Nelson Amaral, Guang R. Gao:
  Fine-Grain Stacked Register Allocation for the Itanium Architecture. 344-361
  
• Grigori Fursin, Michael F. P. O'Boyle, Peter M. W. Knijnenburg:
  Evaluating Iterative Compilation. 362-376