Sciweavers

3148 search results - page 43 / 630
» On the Dynamic Initialization of Parallel Computers
Sort
View
EUROPAR
1998
Springer
15 years 1 months ago
A Lower Bound for Dynamic Scheduling of Data Parallel Programs
Instruction Balanced Time Slicing IBTS allows multiple parallel jobs to be scheduled in a manner akin to the well-known gang scheduling scheme in parallel computers. IBTS however a...
Fabrício Alves Barbosa da Silva, Luis Migue...
IPPS
1999
IEEE
15 years 2 months ago
Reducing Parallel Overheads Through Dynamic Serialization
If parallelism can be successfully exploited in a program, significant reductions in execution time can be achieved. However, if sections of the code are dominated by parallel ove...
Michael Voss, Rudolf Eigenmann
HPDC
2008
IEEE
15 years 4 months ago
Harmony: an execution model and runtime for heterogeneous many core systems
The emergence of heterogeneous many core architectures presents a unique opportunity for delivering order of magnitude performance increases to high performance applications by ma...
Gregory F. Diamos, Sudhakar Yalamanchili
EUROPAR
2006
Springer
15 years 1 months ago
Applicability of Load Balancing Strategies to Data-Parallel Embedded Runge-Kutta Integrators
Abstract. Embedded Runge-Kutta methods are among the most popular methods for the solution of non-stiff initial value problems of ordinary differential equations (ODEs). We investi...
Matthias Korch, Thomas Rauber
SBACPAD
2003
IEEE
138views Hardware» more  SBACPAD 2003»
15 years 3 months ago
Finite Difference Simulations of the Navier-Stokes Equations Using Parallel Distributed Computing
 This paper discusses the implementation of a numerical algorithm for simulating incompressible fluid flows based on the finite difference method and designed for parallel compu...
João Paulo De Angeli, Andréa M. P. V...