Sciweavers

239 search results - page 12 / 48
» On-line scheduling of parallel jobs on two machines
Sort
View
APPROX
2000
Springer
107views Algorithms» more  APPROX 2000»
14 years 7 days ago
Online real-time preemptive scheduling of jobs with deadlines
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized ...
Bhaskar DasGupta, Michael A. Palis
SCHEDULING
2011
13 years 2 months ago
On robust online scheduling algorithms
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs...
Michael Gatto, Peter Widmayer
PDP
2010
IEEE
13 years 11 months ago
Malleable-Lab: A Tool for Evaluating Adaptive Online Schedulers on Malleable Jobs
—The emergence of multi-core computers has led to explosive development of parallel applications and hence the need of efficient schedulers for parallel jobs. Adaptive online sc...
Yangjie Cao, Hongyang Sun, Wen-Jing Hsu, Depei Qia...
JSSPP
1995
Springer
13 years 11 months ago
A Microeconomic Scheduler for Parallel Computers
We describe a scheduler based on the microeconomic paradigm for scheduling on-line a set of parallel jobs in a multiprocessor system. In addition to increasing the system throughpu...
Ion Stoica, Hussein M. Abdel-Wahab, Alex Pothen
JSSPP
2005
Springer
14 years 1 months ago
Modeling User Runtime Estimates
User estimates of job runtimes have emerged as an important component of the workload on parallel machines, and can have a significant impact on how a scheduler treats different ...
Dan Tsafrir, Yoav Etsion, Dror G. Feitelson