LCPC 2006: New Orleans, Louisiana, USA

Keynote I

• Katherine A. Yelick:
  Compilation Techniques for Partitioned Global Address Space Languages. 1
  

Programming Models

• Troy A. Johnson, Sang Ik Lee, Seung-Jai Min, Rudolf Eigenmann:
  Can Transactions Enhance Parallel Programs? 2-16
  
• Ganesh Bikshandi, Jia Guo, Christoph von Praun, Gabriel Tanase, Basilio B. Fraguela, María Jesús Garzarán, David A. Padua, Lawrence Rauchwerger:
  Design and Use of htalib - A Library for Hierarchically Tiled Arrays. 17-32
  
• Ana Lucia Varbanescu, Maik Nijhuis, Arturo González-Escribano, Henk J. Sips, Herbert Bos, Henri E. Bal:
  SP@CE - An SP-Based Programming Model for Consumer Electronics Streaming Applications. 33-48
  

Code Generation

• Weihua Zhang, Tao Bao, Binyu Zang, Chuanqi Zhu:
  Data Pipeline Optimization for Shared Memory Multiple-SIMD Architecture. 49-63
  
• Yuan Zhao, Ken Kennedy:
  Dependence-Based Code Generation for a CELL Processor. 64-79
  
• Christopher Mueller, Andrew Lumsdaine:
  Expression and Loop Libraries for High-Performance Code Synthesis. 80-95
  
• Minhaj Ahmad Khan, Henri-Pierre Charles:
  Applying Code Specialization to FFT Libraries for Integral Parameters. 96-110
  

Parallelism

• Christopher Barton, Calin Cascaval, José Nelson Amaral:
  A Characterization of Shared Data Access Patterns in UPC Programs. 111-125
  
• Shengyue Wang, Antonia Zhai, Pen-Chung Yew:
  Exploiting Speculative Thread-Level Parallelism in Data Compression Applications. 126-140
  
• DaeGon Kim, Gautam Gupta, Sanjay V. Rajopadhye:
  On Control Signals for Multi-Dimensional Time. 141-155
  

Keynote II

• David Patterson:
  The Berkeley View: A New Framework and a New Platform for Parallel Research. 156-157
  

Compilation Techniques

• Hassan Salamy, J. Ramanujam:
  An Effective Heuristic for Simple Offset Assignment with Variable Coalescing. 158-172
  
• Denis Barthou, Sébastien Donadio, Alexandre Duchateau, William Jalby, E. Courtois:
  Iterative Compilation with Kernel Exploration. 173-189
  
• Constantino G. Ribeiro, Marcelo Cintra:
  Quantifying Uncertainty in Points-To Relations. 190-204
  

Data Structures

• Diego Andrade, Basilio B. Fraguela, Ramon Doallo:
  Cache Behavior Modelling for Codes Involving Banded Matrices. 205-219
  
• Kevin Andrusky, Stephen Curial, José Nelson Amaral:
  Tree-Traversal Orientation Analysis. 220-234
  
• Stephen Olivier, Jun Huan, Jinze Liu, Jan Prins, James Dinan, P. Sadayappan, Chau-Wen Tseng:
  UTS: An Unbalanced Tree Search Benchmark. 235-250
  

Register Allocation

• Chung-Ju Wu, Sheng-Yuan Chen, Jenq Kuen Lee:
  Copy Propagation Optimizations for VLIW DSP Processors with Distributed Register Files. 251-266
  
• Rajkishore Barik, Christian Grothoff, Rahul Gupta, Vinayaka Pandit, Raghavendra Udupa:
  Optimal Bitwise Register Allocation Using Integer Linear Programming. 267-282
  
• Florent Bouchez, Alain Darte, Christophe Guillon, Fabrice Rastello:
  Register Allocation: What Does the NP-Completeness Proof of Chaitin et al. Really Prove? Or Revisiting Register Allocation: Why and How. 283-298
  

Memory Management

• Alin Jula, Lawrence Rauchwerger:
  Custom Memory Allocation for Free. 299-313
  
• Tong Chen, Zehra Sura, Kathryn M. O'Brien, John K. O'Brien:
  Optimizing the Use of Static Buffers for DMA on a CELL Chip. 314-329
  
• Jairo Balart, Marc González, Xavier Martorell, Eduard Ayguadé, Jesús Labarta:
  Runtime Address Space Computation for SDSM Systems. 330-344
  
• Mark Marron, Deepak Kapur, Darko Stefanovic, Manuel V. Hermenegildo:
  A Static Heap Analysis for Shape and Connectivity: Unified Memory Analysis: The Base Framework. 345-363