Languages and Compilers for Parallel Computing (eBook, PDF)

19th International Workshop, LCPC 2006, New Orleans, LA, USA, November 2-4, 2006, Revised Papers
Redaktion: Almási, Gheorghe; Wu, Peng; Cascaval, Calin

• Format: PDF

Produktbeschreibung

This book constitutes the thoroughly refereed post-proceedings of the 19th International Workshop on Languages and Compilers for Parallel Computing, LCPC 2006, held in New Orleans, LA, USA in November 2006.

The 24 revised full papers presented together with two keynote talks cover programming models, code generation, parallelism, compilation techniques, data structures, register allocation, and memory management.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer Berlin Heidelberg
• Seitenzahl: 366
• Erscheinungstermin: 11. Juni 2007
• Englisch
• ISBN-13: 9783540725213
• Artikelnr.: 44122735

Autorenporträt

Gheorghe Almási, IBM Watson Research Center, Yorktown Hights, NY, USA / Calin Cascaval, IBM Watson Research Center, Yorktown Hights, NY, USA / Peng Wu, IBM Watson Research Center, Yorktown Hights, NY, USA

Inhaltsangabe

Keynote I.- Compilation Techniques for Partitioned Global Address Space Languages.- Session 1: Programming Models.- Can Transactions Enhance Parallel Programs?.- Design and Use of htalib - A Library for Hierarchically Tiled Arrays.- SP@CE - An SP-Based Programming Model for Consumer Electronics Streaming Applications.- Session 2: Code Generation.- Data Pipeline Optimization for Shared Memory Multiple-SIMD Architecture.- Dependence-Based Code Generation for a CELL Processor.- Expression and Loop Libraries for High-Performance Code Synthesis.- Applying Code Specialization to FFT Libraries for Integral Parameters.- Session 3: Parallelism.- A Characterization of Shared Data Access Patterns in UPC Programs.- Exploiting Speculative Thread-Level Parallelism in Data Compression Applications.- On Control Signals for Multi-Dimensional Time.- Keynote II.- The Berkeley View: A New Framework and a New Platform for Parallel Research.- Session 4: Compilation Techniques.- An Effective Heuristic for Simple Offset Assignment with Variable Coalescing.- Iterative Compilation with Kernel Exploration.- Quantifying Uncertainty in Points-To Relations.- Session 5: Data Structures.- Cache Behavior Modelling for Codes Involving Banded Matrices.- Tree-Traversal Orientation Analysis.- UTS: An Unbalanced Tree Search Benchmark.- Session 6: Register Allocation.- Copy Propagation Optimizations for VLIW DSP Processors with Distributed Register Files.- Optimal Bitwise Register Allocation Using Integer Linear Programming.- Register Allocation: What Does the NP-Completeness Proof of Chaitin et al. Really Prove? Or Revisiting Register Allocation: Why and How.- Session 7: Memory Management.- Custom Memory Allocation for Free.- Optimizing the Use of Static Buffers for DMA on a CELL Chip.- Runtime AddressSpace Computation for SDSM Systems.- A Static Heap Analysis for Shape and Connectivity: Unified Memory Analysis: The Base Framework.