Sciweavers

187 search results - page 1 / 38
» Approximation Algorithms for Multiprocessor Scheduling under...
Sort
View
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
CORR
2008
Springer
96views Education» more  CORR 2008»
13 years 5 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...
DATE
2006
IEEE
110views Hardware» more  DATE 2006»
13 years 11 months ago
Multiprocessor synthesis for periodic hard real-time tasks under a given energy constraint
The energy-aware design for electronic systems has been an important issue in hardware and/or software implementations, especially for embedded systems. This paper targets a synth...
Heng-Ruey Hsu, Jian-Jia Chen, Tei-Wei Kuo
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
DSN
2008
IEEE
13 years 11 months ago
Scheduling algorithms for unpredictably heterogeneous CMP architectures
In future large-scale multi-core microprocessors, hard errors and process variations will create dynamic heterogeneity, causing performance and power characteristics to differ amo...
Jonathan A. Winter, David H. Albonesi