Languages and Compilers for Parallel Computing 15th Workshop, LCPC 2002, College Park, MD, USA, July 25-27, 2002. Revised Papers /
The 15th Workshop on Languages and Compilers for Parallel Computing was held in July 2002 at the University of Maryland, College Park. It was jointly sponsored by the Department of Computer Science at the University of Ma- land and the University of Maryland Institute for Advanced Computer Studies (...
Συγγραφή απο Οργανισμό/Αρχή: | |
---|---|
Άλλοι συγγραφείς: | , |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2005.
|
Σειρά: | Lecture Notes in Computer Science,
2481 |
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- Memory-Constrained Communication Minimization for a Class of Array Computations
- Forward Communication Only Placements and Their Use for Parallel Program Construction
- Hierarchical Parallelism Control for Multigrain Parallel Processing
- Compiler Analysis and Supports for Leakage Power Reduction on Microprocessors
- Automatic Detection of Saturation and Clipping Idioms
- Compiler Optimizations with DSP-Specific Semantic Descriptions
- Combining Performance Aspects of Irregular Gauss-Seidel Via Sparse Tiling
- A Hybrid Strategy Based on Data Distribution and Migration for Optimizing Memory Locality
- Compiler Optimizations Using Data Compression to Decrease Address Reference Entropy
- Towards Compiler Optimization of Codes Based on Arrays of Pointers
- An Empirical Study on the Granularity of Pointer Analysis in C Programs
- Automatic Implementation of Programming Language Consistency Models
- Parallel Reductions: An Application of Adaptive Algorithm Selection
- Adaptively Increasing Performance and Scalability of Automatically Parallelized Programs
- Selector: A Language Construct for Developing Dynamic Applications
- Optimizing the Java Piped I/O Stream Library for Performance
- A Comparative Study of Stampede Garbage Collection Algorithms
- Compiler and Runtime Support for Shared Memory Parallelization of Data Mining Algorithms
- Performance Analysis of Symbolic Analysis Techniques for Parallelizing Compilers
- Efficient Manipulation of Disequalities During Dependence Analysis
- Removing Impediments to Loop Fusion Through Code Transformations
- Near-Optimal Padding for Removing Conflict Misses
- Fine-Grain Stacked Register Allocation for the Itanium Architecture
- Evaluating Iterative Compilation.