103 search results - page 2 / 21 » Online weighted flow time and deadline scheduling |
APPROX
2000
Springer
13 years 10 months ago
2000
Springer
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized ...
SODA
2004
ACM
13 years 7 months ago
2004
ACM
In this paper we consider multiprocessor scheduling with hard deadlines and investigate the cost of eliminating migration in the online setting. Let I be any set of jobs that can ...
AIPS
2000
13 years 7 months ago
2000
1 We consider the problem of scheduling an unknown sequence of tasks for a single server as the tasks arrive with the goal off maximizing the total weighted value of the tasks serv...
ICDCS
1992
IEEE
13 years 10 months ago
1992
IEEE
In a distributed system or communication network tasks may need to be executed on more than one processor. For time-critical tasks, the timing constraints are typically given as e...
INFOCOM
2005
IEEE
13 years 11 months ago
2005
IEEE
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...