Sciweavers

474 search results - page 32 / 95
» Search-based Job Scheduling for Parallel Computer Workloads
Sort
View
IPPS
2005
IEEE
14 years 2 months ago
Improving and Stabilizing Parallel Computer Performance Using Adaptive Backfilling
The scheduler is a key component in determining the overall performance of a parallel computer, and as we show here, the schedulers in wide use today exhibit large unexplained gap...
David Talby, Dror G. Feitelson
EUROPAR
2010
Springer
13 years 8 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...
PPOPP
2006
ACM
14 years 2 months ago
Predicting bounds on queuing delay for batch-scheduled parallel machines
Most space-sharing parallel computers presently operated by high-performance computing centers use batch-queuing systems to manage processor allocation. In many cases, users wishi...
John Brevik, Daniel Nurmi, Richard Wolski
ICPP
1999
IEEE
14 years 24 days ago
Efficient Techniques for Distributed Implementation of Search-Based AI Systems
We study the problem of exploiting parallelism from search-based AI systems on distributed machines. We propose stack-splitting, a technique for implementing orparallelism, which ...
Gopal Gupta, Enrico Pontelli
GRID
2008
Springer
13 years 8 months ago
Statistical Analysis and Modeling of Jobs in a Grid Environment
The existence of good probabilistic models for the job arrival process and the delay components introduced at different stages of job processing in a Grid environment is important ...
Kostas Christodoulopoulos, Vasileios Gkamas, Emman...