Sciweavers

206 search results - page 7 / 42
» Parallel Job Scheduling with Overhead: A Benchmark Study
Sort
View
JSSPP
2009
Springer
14 years 2 months ago
Competitive Two-Level Adaptive Scheduling Using Resource Augmentation
Abstract. As multi-core processors proliferate, it has become more important than ever to ensure efficient execution of parallel jobs on multiprocessor systems. In this paper, we s...
Hongyang Sun, Yangjie Cao, Wen-Jing Hsu
JSSPP
2009
Springer
14 years 2 months ago
Scheduling Restartable Jobs with Short Test Runs
In this paper, we examine the concept of giving every job a trial run before committing it to run until completion. Trial runs allow immediate job failures to be detected shortly a...
Ojaswirajanya Thebe, David P. Bunde, Vitus J. Leun...
GRID
2007
Springer
13 years 7 months ago
A Tool for Prioritizing DAGMan Jobs and its Evaluation
It is often difficult to perform efficiently a collection of jobs with complex job dependencies due to temporal unpredictability of the grid. One way to mitigate the unpredictabili...
Grzegorz Malewicz, Ian T. Foster, Arnold L. Rosenb...
JSSPP
2001
Springer
14 years 39 min ago
Metrics for Parallel Job Scheduling and Their Convergence
The arrival process of jobs submitted to a parallel system is bursty, leading to fluctuations in the load at many time scales. In particular, rare events of extreme load may occu...
Dror G. Feitelson
JSSPP
2004
Springer
14 years 28 days ago
Are User Runtime Estimates Inherently Inaccurate?
Computer system batch schedulers typically require information from the user upon job submission, including a runtime estimate. Inaccuracy of these runtime estimates, relative to ...
Cynthia Bailey Lee, Yael Schwartzman, Jennifer Har...