64 search results - page 4 / 13 » Preemptive Scheduling of Equal-Length Jobs in Polynomial Tim... |
CORR
2010
Springer
13 years 15 days ago
2010
Springer
Algorithms based on semi-partitioned scheduling have been proposed as a viable alternative between the two extreme ones based on global and partitioned scheduling. In particular, ...
ESA
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
ICPPW
2005
IEEE
13 years 11 months ago
2005
IEEE
Abstract— In the sporadic task model, a task is characterized by three parameters — an execution requirement, a relative deadline, and a period parameter — and has the interp...
RTAS
2011
IEEE
12 years 9 months ago
2011
IEEE
The partitioned preemptive EDF scheduling of implicitdeadline sporadic task systems on an identical multiprocessor platform is considered. Lookup tables, at any selected degree of...
JCO
1998
13 years 5 months ago
1998
We consider the problem of scheduling n jobs with release dates on m identical parallel machines to minimize the average completion time of the jobs. We prove that the ratio of the...