Compiler optimizations for scalable parallel systems : languages, compilation techniques, and run time systems
Scalable parallel systems or, more generally, distributed memory systems offer a challenging model of computing and pose fascinating problems regarding compiler optimization, ranging from language design to run time systems. Research in this area is foundational to many challenges from memory hierar...
Enregistré dans:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Livre numérique |
| 語言: | Anglais |
| 出版: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| 叢編: | Lecture notes in computer science
1808 |
| 主題: | |
| 在線閱讀: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| 提示: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Compiler optimizations for scalable parallel systems, languages, compilation techniques, and run time systems, Santosh Pande, Dharma P. Agrawal (eds.), 2001, Berlin, Springer, 1 vol. (XXVII-778 p.), Lecture notes in computer science, 3-540-41945-4 • Compiler Optimizations for Scalable Parallel Systems, Texte imprimé, 9783662196052 |
書本目錄:
- Languages
- High Performance Fortran 2.0
- The Sisal Project: Real World Functional Programming
- HPC++ and the HPC++Lib Toolkit
- A Concurrency Abstraction Model for Avoiding Inheritance Anomaly in Object-Oriented Programs
- Analysis
- Loop Parallelization Algorithms
- Array Dataflow Analysis
- Interprocedural Analysis Based on Guarded Array Regions
- Automatic Array Privatization
- Communication Optimizations
- Optimal Tiling for Minimizing Communication in Distributed Shared-Memory Multiprocessors
- Communication-Free Partitioning of Nested Loops
- Solving Alignment Using Elementary Linear Algebra
- A Compilation Method for Communication-Efficient Partitioning of DOALL Loops
- Compiler Optimization of Dynamic Data Distributions for Distributed-Memory Multicomputers
- A Framework for Global Communication Analysis and Optimizations
- Tolerating Communication Latency through Dynamic Thread Invocation in a Multithreaded Architecture
- Code Generation
- Advanced Code Generation for High Performance Fortran
- Integer Lattice Based Methods for Local Address Generation for Block-Cyclic Distributions
- Task Parallelism, Dynamic Data Structures and Run Time Systems
- A Duplication Based Compile Time Scheduling Method for Task Parallelism
- SPMD Execution in the Presence of Dynamic Data Structures
- Supporting Dynamic Data Structures with Olden
- Runtime and Compiler Support for Irregular Computations.