64 search results - page 6 / 13 » Preemptive Scheduling of Equal-Length Jobs in Polynomial Tim... |
DATE
2008
IEEE
15 years 3 months ago
2008
IEEE
This paper presents two fully polynomial-time sufficient feasibility tests for EDF when considering periodic tasks with arbitrary deadlines and preemptive scheduling on uniproces...
75
Voted
ATS
2003
IEEE
15 years 2 months ago
2003
IEEE
1 In this paper, we show that the scheduling of tests on the test access mechanism (TAM) is equivalent to independent job scheduling on identical machines and we make use of an exi...
COR
2008
14 years 9 months ago
2008
In many realistic situations, a job processed later consumes more time than the same job when it is processed earlier; this phenomenon is known as deteriorating jobs. However, job...
87
Voted
SWAT
2004
Springer
15 years 2 months ago
2004
Springer
It is well known that the Earliest-Deadline-First (EDF) and the Least-Laxity-First (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arr...
73
Voted
SIAMCOMP
2010
14 years 4 months ago
2010
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...