LCPC 2000: Yorktown Heights, NY, USA

Presented Papers

• Francisco Corbera, Rafael Asenjo, Emilio L. Zapata:
  Accurate Shape Analysis for Recursive Data Structures. 1-15
  
• John O'Donnell, Thomas Rauber, Gudula Rünger:
  Cost Hierarchies for Abstract Parallel Machines. 16-33
  
• Radu Rugina, Martin C. Rinard:
  Recursion Unrolling for Divide and Conquer Programs. 34-48
  
• Matthew Arnold, Michael Hind, Barbara G. Ryder:
  An Empirical Study of Selective Optimization. 49-67
  
• George S. Almasi, David A. Padua:
  MaJIC: A Matlab Just-In-time Compiler. 68-81
  
• Lawrence Rauchwerger, Nancy M. Amato, Josep Torrellas:
  SmartApps: An Application Centric Approach to High Performance Computing. 82-96
  
• David Wonnacott:
  Extending Scalar Optimizations for Arrays. 97-111
  
• Jeremy R. Johnson, Robert W. Johnson, David A. Padua, Jianxin Xiong:
  Searching for the Best FFT Formulas with the SPL Compiler. 112-126
  
• Daniel J. Rosenkrantz, Lenore M. R. Mullin, Harry B. Hunt III:
  On Materializations of Array-Valued Temporaries. 127-141
  
• Mahmut T. Kandemir, Narayanan Vijaykrishnan, Mary Jane Irwin, Hyun Suk Kim:
  Experimental Evaluation of Energy Behavior of Iteration Space Tiling. 142-157
  
• Sunil Atri, J. Ramanujam, Mahmut T. Kandemir:
  Improving Offset Assignment for Embedded Processors. 158-172
  
• Hwansoo Han, Chau-Wen Tseng:
  Improving Locality for Adaptive Irregular Scientific Codes. 173-188
  
• Hironori Kasahara, Motoki Obata, Kazuhisa Ishizaka:
  Automatic Coarse Grain Task Parallel Processing on SMP Using OpenMP. 189-207
  
• Vikram S. Adve, Rizos Sakellariou:
  Compiler Synthesis of Task Graphs for Parallel Program Performance Prediction. 208-226
  
• Samuel Z. Guyer, Calvin Lin:
  Optimizing the Use of High Performance Software Libraries. 227-243
  
• Henry G. Dietz, Timothy Mattox:
  Compiler Techniques for Flat Neighborhood Networks. 244-258
  
• Pramod G. Joisha, Prithviraj Banerjee:
  Exploiting Ownership Sets in HPF. 259-273
  
• Seon Wook Kim, Insung Park, Rudolf Eigenmann:
  A Performance Advisor Tool for Shared-Memory Parallel Programming. 274-288
  
• Jay Hoeflinger, Yunheung Paek:
  A Comparative Analysis of Dependence Testing Mechanisms. 289-303
  
• D. K. Arvind, T. A. Lewis:
  Safe Approximation of Data Dependencies in Pointer-Based Structures. 304-323
  
• Marc González, José Oliver, Xavier Martorell, Eduard Ayguadé, Jesús Labarta, Nacho Navarro:
  OpenMP Extensions for Thread Groups and Their Run-Time Support. 324-338
  
• Renato Ferreira, Gagan Agrawal, Ruoming Jin, Joel H. Saltz:
  Compiling Data Intensive Applications with Spatial Coordinates. 339-354
  

Posters

• Will Denissen, Henk J. Sips:
  Efficient Dynamic Local Enumeration for HPF. 355-358
  
• Peter Faber, Martin Griebl, Christian Lengauer:
  Issues of the Automatic Generation of HPF Loop Programs. 359-362
  
• A. J. Field, Thomas L. Hansen, Paul H. J. Kelly:
  Run-Time Fusion of MPI Calls in a Parallel C++ Library. 363-366
  
• Thomas Rauber, Robert Reilein, Gudula Rünger:
  Set Operations for Orthogonal Processor Groups. 367-371
  
• Srivatsan Narasimhan, Santosh Pande:
  Compiler Based Scheduling of Java Mobile Agents. 372-376
  
• Jian-Zhi Wu, Jenq Kuen Lee:
  A Bytecode Optimizer to Engineer Bytecodes for Performance. 377-382
  

Last update Sat May 18 19:15:12 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page