835 search results - page 89 / 167 » On optimal slicing of parallel programs |
108
Voted
EUROPAR
2008
Springer
15 years 5 months ago
2008
Springer
Performance of distributed applications largely depends on the mapping of their components on the underlying architecture. On one mponent-based approaches provide an abstraction su...
122
click to vote
APLAS
2005
ACM
15 years 9 months ago
2005
ACM
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
116
click to vote
EUROPAR
2009
Springer
15 years 10 months ago
2009
Springer
Moore’s Law suggests that the number of processing cores on a single chip increases exponentially. The future performance increases will be mainly extracted from thread-level par...
118
Voted
CGO
2010
IEEE
15 years 10 months ago
2010
IEEE
Tiling, a key transformation for optimizing programs, has been widely studied in literature. Parameterized tiled code is important for auto-tuning systems since they often execute...
110
Voted
LCPC
1999
Springer
15 years 7 months ago
1999
Springer
The traditional target machine of a parallelizing compiler can execute code sections either serially or in parallel. In contrast, targeting the generated code to a speculative para...