Sciweavers

1536 search results - page 81 / 308
» DPS - Dynamic Parallel Schedules
Sort
View
PPOPP
2009
ACM
15 years 12 months ago
Application-aware management of parallel simulation collections
This paper presents a system deployed on parallel clusters to manage a collection of parallel simulations that make up a computational study. It explores how such a system can ext...
Siu Yau, Vijay Karamcheti, Denis Zorin, Kostadin D...
IPPS
1998
IEEE
15 years 3 months ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
Peter R. Cappello, Ömer Egecioglu
EUROPAR
2010
Springer
14 years 11 months ago
A Fast 5/2-Approximation Algorithm for Hierarchical Scheduling
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
Marin Bougeret, Pierre-François Dutot, Klau...
IPPS
2005
IEEE
15 years 5 months ago
Monitoring and Debugging Parallel Software with BCS-MPI on Large-Scale Clusters
Buffered CoScheduled (BCS) MPI is a novel implementation of MPI based on global synchronization of all system activities. BCS-MPI imposes a model where all processes and their com...
Juan Fernández, Fabrizio Petrini, Eitan Fra...
IRREGULAR
1995
Springer
15 years 2 months ago
Run-Time Parallelization of Irregular DOACROSS Loops
Dependencies between iterations of loop structures cannot always be determined at compile-time because they may depend on input data which is known only at run-time. A prime examp...
V. Prasad Krothapalli, Thulasiraman Jeyaraman, Mar...