LCPC 2008: Edmonton, Alberta, Canada

• Sain-Zee Ueng, Melvin Lathara, Sara S. Baghsorkhi, Wen-mei W. Hwu:
  CUDA-Lite: Reducing GPU Programming Complexity. 1-15
  
• John A. Stratton, Sam S. Stone, Wen-mei W. Hwu:
  MCUDA: An Efficient Implementation of CUDA Kernels for Multi-core CPUs. 16-30
  
• Nikola Vujic, Marc González, Xavier Martorell, Eduard Ayguadé:
  Automatic Pre-Fetch and Modulo Scheduling Transformations for the Cell BE Architecture. 31-46
  
• Mario Méndez-Lojo, Ondrej Lhoták, Manuel V. Hermenegildo:
  Efficient Set Sharing Using ZBDDs. 47-63
  
• Behnam Robatmili, Katherine E. Coons, Doug Burger, Kathryn S. McKinley:
  Register Bank Assignment for Spatially Partitioned Processors. 64-79
  
• Nissa Osheim, Michelle Mills Strout, Dave Rostron, Sanjay V. Rajopadhye:
  Smashing: Folding Space to Tile through Time. 80-93
  
• Mark Marron, Darko Stefanovic, Deepak Kapur, Manuel V. Hermenegildo:
  Identification of Heap-Carried Data Dependence Via Explicit Store Heap Models. 94-108
  
• Martin Burtscher, Milind Kulkarni, Dimitrios Prountzos, Keshav Pingali:
  On the Scalability of an Automatically Parallelized Irregular Application. 109-123
  
• Tushar Kumar, Romain Cledat, Jaswanth Sreeram, Santosh Pande:
  Statistically Analyzing Execution Variance for Soft Real-Time Applications. 124-140
  
• Yuan Zhang, Vugranam C. Sreedhar, Weirong Zhu, Vivek Sarkar, Guang R. Gao:
  Minimum Lock Assignment: A Method for Exploiting Concurrency among Critical Sections. 141-155
  
• Cosmin E. Oancea, Alan Mycroft:
  Set-Congruence Dynamic Analysis for Thread-Level Speculation (TLS). 156-171
  
• Nicholas D. Matsakis, Thomas R. Gross:
  Thread Safety through Partitions and Effect Agreements. 172-186
  
• Alexandre Duchateau, Albert Sidelnik, María Jesús Garzarán, David A. Padua:
  P-Ray: A Software Suite for Multi-core Architecture Characterization. 187-201
  
• Xipeng Shen, Jonathan Shaw:
  Scalable Implementation of Efficient Locality Approximation. 202-216
  
• Xiaoming Gu, Tongxin Bai, Yaoqing Gao, Chengliang Zhang, Roch Archambault, Chen Ding:
  P-OPT: Program-Directed Optimal Cache Management. 217-231
  
• Peng Wu, Arun Kejariwal, Calin Cascaval:
  Compiler-Driven Dependence Profiling to Guide Program Parallelization. 232-248
  
• Ken Hironaka, Hideo Saito, Kei Takahashi, Kenjiro Taura:
  gluepy: A Simple Distributed Python Programming Framework for Complex Grid Environments. 249-263
  
• Xiao-Feng Li, Ligang Wang, Chen Yang:
  A Fully Parallel LISP2 Compactor with Preservation of the Sliding Properties. 264-278
  
• Sayantan Chakravorty, Aaron Becker, Terry Wilmarth, Laxmikant V. Kalé:
  A Case Study in Tightly Coupled Multi-paradigm Parallel Programming. 279-291
  
• Russell Meyers, Zhiyuan Li:
  ASYNC Loop Constructs for Relaxed Synchronization. 292-303
  
• Antal A. Buss, Timmie G. Smith, Gabriel Tanase, Nathan L. Thomas, Mauro Bianco, Nancy M. Amato, Lawrence Rauchwerger:
  Design for Interoperability in stapl: pMatrices and Linear Algebra Algorithms. 304-315
  
• Silvius Rus, Maikel Pennings, Lawrence Rauchwerger:
  Implementation of Sensitivity Analysis for Automatic Parallelization. 316-330
  
• Guangming Tan, Vugranam C. Sreedhar, Guang R. Gao:
  Just-In-Time Locality and Percolation for Optimizing Irregular Applications on a Manycore Architecture. 331-342
  
• Qing Yi, Apan Qasem:
  Exploring the Optimization Space of Dense Linear Algebra Kernels. 343-355