Sciweavers

835 search results - page 37 / 167
» On optimal slicing of parallel programs
Sort
View
MPC
1995
Springer
150views Mathematics» more  MPC 1995»
13 years 11 months ago
Architecture Independent Massive Parallelization of Divide-and-Conquer Algorithms
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...
Klaus Achatz, Wolfram Schulte
ICFP
2007
ACM
14 years 7 months ago
Feedback directed implicit parallelism
In this paper we present an automated way of using spare CPU resources within a shared memory multi-processor or multi-core machine. Our approach is (i) to profile the execution o...
Tim Harris, Satnam Singh
IPPS
1999
IEEE
13 years 12 months ago
Regularity Considerations in Instance-Based Locality Optimization
Instance based locality optimization 6 is a semi automatic program restructuring method that reduces the number of cache misses. The method imitates the human approach of consideri...
Claudia Leopold
VECPAR
2004
Springer
14 years 1 months ago
Domain Decomposition Methods for PDE Constrained Optimization Problems
Abstract. Optimization problems constrained by nonlinear partial differential equations have been the focus of intense research in scientific computing lately. Current methods for...
Ernesto E. Prudencio, Richard H. Byrd, Xiao-Chuan ...
ISPDC
2007
IEEE
14 years 1 months ago
Selection of Optimal Computing Platforms through the Suitability Measure
Selection of spaceborne computing platforms requires balance among several competing factors. Traditional performance analysis techniques are illsuited for this purpose due to the...
Shean T. McMahon, Isaac D. Scherson