Sciweavers

119 search results - page 4 / 24
» A New Method for Compiling Parallel Replacement Rules
Sort
View
ICS
2009
Tsinghua U.
14 years 5 months ago
MPI-aware compiler optimizations for improving communication-computation overlap
Several existing compiler transformations can help improve communication-computation overlap in MPI applications. However, traditional compilers treat calls to the MPI library as ...
Anthony Danalis, Lori L. Pollock, D. Martin Swany,...
BIRTHDAY
2006
Springer
14 years 2 months ago
Verification by Parallelization of Parametric Code
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal software verification, because correctness proofs over such control structures generall...
Tobias Gedell, Reiner Hähnle
IFL
2001
Springer
142views Formal Methods» more  IFL 2001»
14 years 3 months ago
A Compilation Scheme for a Hierarchy of Array Types
In order to achieve a high level of abstraction, array-oriented languages provide language constructs for defining array operations in a shape-invariant way. However, when trying ...
Dietmar Kreye
PPAM
2007
Springer
14 years 4 months ago
A Container-Iterator Parallel Programming Model
There are several parallel programming models available for numerical computations at different levels of expressibility and ease of use. For the development of new domain speci...
Gerhard W. Zumbusch
ICPP
1993
IEEE
14 years 2 months ago
Activity Counter: New Optimization for the Dynamic Scheduling of SIMD Control Flow
SIMD or vector computers and collection-oriented languages, like C , are designed to perform the same computation on each data item or on just a subset of the data. Subsets of pro...
Ronan Keryell, Nicolas Paris