Languages and compilers for parallel computing : 7th International Workshop, Ithaca, NY, USA, August 8 10, 1994 : proceedings
This volume presents revised versions of the 32 papers accepted for the Seventh Annual Workshop on Languages and Compilers for Parallel Computing, held in Ithaca, NY in August 1994. The 32 papers presented report on the leading research activities in languages and compilers for parallel computing an...
Spremljeno u:
| Autor kompanije: | |
|---|---|
| Daljnji autori: | , , |
| Format: | Livre numérique |
| Jezik: | Anglais |
| Izdano: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serija: | Lecture notes in computer science
892 |
| Teme: | |
| Online pristup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Bilješka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Languages and compilers for parallel computing, proceedings, 7th International Workshop, Ithaca, NY, USA, August 1994, Heidelberg, Springer-Verlag, 1995, 1 vol. (XI-496 p.), Lecture notes in computer science, 3-540-58868-X • Languages and Compilers for Parallel Computing, Texte imprimé, 9783662207024 |
Sadržaj:
- Fine-grain scheduling under resource constraints
- Mutation scheduling: A unified approach to compiling for fine-grain parallelism
- Compiler techniques for fine-grain execution on workstation clusters using PAPERS
- Solving alignment using elementary linear algebra
- Detecting and using affinity in an automatic data distribution tool
- Array distribution in data-parallel programs
- Communication-free parallelization via affine transformations
- Finding legal reordering transformations using mappings
- A new algorithm for global optimization for parallelism and locality
- Polaris: Improving the effectiveness of parallelizing compilers
- A formal approach to the compilation of data-parallel languages
- The data partitioning graph: Extending data and control dependencies for data partitioning
- Detecting value-based scalar dependence
- Minimal data dependence abstractions for loop transformations
- Differences in algorithmic parallelism in control flow and call multigraphs
- Flow-insensitive interprocedural alias analysis in the presence of pointers
- Incremental generation of index sets for array statement execution on distributed-memory machines
- A unified data-flow framework for optimizing communication
- Interprocedural communication optimizations for distributed memory compilation
- Analysis of event synchronization in parallel programs
- Computing communication sets for control parallel programs
- Optimizing parallel SPMD programs
- An overview of the Opus language and runtime system
- SIMPLE performance results in ZPL
- Cid: A parallel, shared-memory C for distributed-memory machines
- EQ: Overview of a new language approach for prototyping scientific computation
- Reshaping access patterns for generating sparse codes
- Evaluating two loop transformationsfor reducing multiple-writer false sharing
- Parallelizing tree algorithms: Overhead vs. parallelism
- Autoscheduling in a distributed shared-memory environment
- Optimizing array distributions in data-parallel programs
- Automatic reduction tree generation for fine-grain parallel architectures when iteration count is unknown.