Sciweavers

835 search results - page 15 / 167
» On optimal slicing of parallel programs
Sort
View
PLDI
2010
ACM
14 years 21 days ago
Finding low-utility data structures
Many opportunities for easy, big-win, program optimizations are missed by compilers. This is especially true in highly layered Java applications. Often at the heart of these misse...
Guoqing Xu, Nick Mitchell, Matthew Arnold, Atanas ...
CONCUR
1993
Springer
13 years 11 months ago
Loop Parallelization in the Polytope Model
During the course of the last decade, a mathematical model for the parallelization of FOR-loops has become increasingly popular. In this model, a (perfect) nest of r FOR-loops is r...
Christian Lengauer
IPPS
2005
IEEE
14 years 1 months ago
Optimal Mapping of a Parallel Application Processes onto Heterogeneous Platform
The paper is devoted to analysis of a strategy of computation distribution on heterogeneous parallel systems. According to this strategy processes of parallel program are distribu...
Alexey Kalinov, Sergey Klimov
EUROPAR
2007
Springer
13 years 11 months ago
Domain-Specific Optimization Strategy for Skeleton Programs
Skeletal parallel programming enables us to develop parallel programs easily by composing ready-made components called skeletons. However, a simplycomposed skeleton program often l...
Kento Emoto, Kiminori Matsuzaki, Zhenjiang Hu, Mas...
IPPS
1998
IEEE
13 years 12 months ago
Predicting the Running Times of Parallel Programs by Simulation
Predicting the running time of a parallel program is useful for determining the optimal values for the parameters of the implementation and the optimal mapping of data on processo...
Radu Rugina, Klaus E. Schauser