Sciweavers

71 search results - page 1 / 15
» Improved Approximations for Multiprocessor Scheduling Under ...
Sort
View
CORR
2008
Springer
96views Education» more  CORR 2008»
13 years 4 months ago
Improved Approximations for Multiprocessor Scheduling Under Uncertainty
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
Christopher Y. Crutchfield, Zoran Dzunic, Jeremy T...
CORR
2007
Springer
131views Education» more  CORR 2007»
13 years 4 months ago
Approximation Algorithms for Multiprocessor Scheduling under Uncertainty
Motivated by applications in grid computing and projects management, we study multiprocessor scheduling in scenarios where there is uncertainty in the successful execution of jobs...
Guolong Lin, Rajmohan Rajaraman
RTSS
2005
IEEE
13 years 10 months ago
Tardiness Bounds under Global EDF Scheduling on a Multiprocessor
We consider the scheduling of a sporadic real-time task system on an identical multiprocessor. Though Pfair algorithms are theoretically optimal for such task systems, in practice...
UmaMaheswari C. Devi, James H. Anderson
EUROPAR
2004
Springer
13 years 9 months ago
Scheduling Under Conditions of Uncertainty: A Bayesian Approach
The efficient execution of irregular parallel applications on shared distributed systems requires novel approaches to scheduling, since both the application requirements and the sy...
Luís Paulo Santos, Alberto José Proe...
ECRTS
2006
IEEE
13 years 10 months ago
Task Reweighting under Global Scheduling on Multiprocessors
We consider schemes for enacting task share changes—a process called reweighting—on real-time multiprocessor platforms. Our particular focus is reweighting schemes that are de...
Aaron Block, James H. Anderson, UmaMaheswari C. De...