Sciweavers

5 search results - page 1 / 1
» Dynamic Malleability in Iterative MPI Applications
Sort
View
CCGRID
2007
IEEE
13 years 10 months ago
Dynamic Malleability in Iterative MPI Applications
Malleability enables a parallel application’s execution system to split or merge processes modifying granularity. While process migration is widely used to adapt applications to...
Kaoutar El Maghraoui, Travis J. Desell, Boleslaw K...
EUROPAR
2004
Springer
13 years 9 months ago
Scheduling of MPI Applications: Self-co-scheduling
Scheduling parallel jobs has been an active investigation area. The scheduler has to deal with heterogeneous workloads and try to obtain throughputs and response times such that en...
Gladys Utrera, Julita Corbalán, Jesú...
ICPP
2009
IEEE
13 years 11 months ago
LeWI: A Runtime Balancing Algorithm for Nested Parallelism
Abstract—We present LeWI: a novel load balancing algorithm, that can balance applications with very different patterns of imbalance. Our algorithm can balance fine grain imbalan...
Marta Garcia, Julita Corbalán, Jesús...
IPPS
2007
IEEE
13 years 10 months ago
iC2mpi: A Platform for Parallel Execution of Graph-Structured Iterative Computations
Parallelization of sequential programs is often daunting because of the substantial development cost involved. Various solutions have been proposed to address this concern, includ...
Harnish Botadra, Qiong Cheng, Sushil K. Prasad, Er...
PPOPP
2006
ACM
13 years 10 months ago
Optimizing irregular shared-memory applications for distributed-memory systems
In prior work, we have proposed techniques to extend the ease of shared-memory parallel programming to distributed-memory platforms by automatic translation of OpenMP programs to ...
Ayon Basumallik, Rudolf Eigenmann