103 search results - page 6 / 21 » Online weighted flow time and deadline scheduling |
ORL
2006
13 years 8 months ago
2006
We show that the greedy Highest Density First (HDF) algorithm is (1+ )-speed O(1)-competitive for the problem of minimizing the p norms of weighted flow time on m identical machin...
DATE
2010
IEEE
14 years 1 months ago
2010
IEEE
—The admission control problem is concerned with determining whether a new task may be accepted by a system consisting of a set of running tasks, such that the already admitted a...
SWAT
2004
Springer
14 years 1 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...
DATE
2004
IEEE
14 years 9 days ago
2004
IEEE
This report addresses the problem of scheduling for real-time systems that include both hard and soft tasks. In order to capture the relative importance of soft tasks and how the ...
ECRTS
2004
IEEE
14 years 8 days ago
2004
IEEE
In this paper, we explore the feasibility and performance optimization problems for real-time systems that must remain functional during an operation/mission with a fixed, initial...