E-Books durchsuchen

Languages and Compilers for Parallel Computing [1995]

1
Fine-grain scheduling under resource constraints
16
Mutation scheduling: A unified approach to compiling for fine-grain parallelism
31
Compiler techniques for fine-grain execution on workstation clusters using PAPERS
46
Solving alignment using elementary linear algebra
61
Detecting and using affinity in an automatic data distribution tool
92
Communication-free parallelization via affine transformations
107
Finding legal reordering transformations using mappings
125
A new algorithm for global optimization for parallelism and locality
141
Polaris: Improving the effectiveness of parallelizing compilers
155
A formal approach to the compilation of data-parallel languages
170
The data partitioning graph: Extending data and control dependencies for data partitioning
186
Detecting value-based scalar dependence
201
Minimal data dependence abstractions for loop transformations
217
Differences in algorithmic parallelism in control flow and call multigraphs
234
Flow-insensitive interprocedural alias analysis in the presence of pointers
251
Incremental generation of index sets for array statement execution on distributed-memory machines
266
A unified data-flow framework for optimizing communication
283
Interprocedural communication optimizations for distributed memory compilation
300
Analysis of event synchronization in parallel programs
316
Computing communication sets for control parallel programs
331
Optimizing parallel SPMD programs
346
An overview of the Opus language and runtime system
361
SIMPLE performance results in ZPL
376
<Emphasis Type="Italic">Cid</Emphasis>: A parallel, “shared-memory” C for distributed-memory machines
391
EQ: Overview of a new language approach for prototyping scientific computation
406
Reshaping access patterns for generating sparse codes
421
Evaluating two loop transformations for reducing multiple-writer false sharing
438
Parallelizing tree algorithms: Overhead vs. parallelism
453
Autoscheduling in a distributed shared-memory environment
470
Optimizing array distributions in data-parallel programs
485
Automatic reduction tree generation for fine-grain parallel architectures when iteration count is unknown
Feedback