80 search results - page 14 / 16 » A tight lower bound for job scheduling with cancellation |
BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
SIGMETRICS
2008
ACM
13 years 7 months ago
2008
ACM
Motivated by the optimality of Shortest Remaining Processing Time (SRPT) for mean response time, in recent years many computer systems have used the heuristic of "favoring sm...
ICALP
2011
Springer
12 years 10 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
ICC
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract—The downlink transmission in multi-user multipleinput multiple-output (MIMO) systems has been extensively studied from both communication-theoretic and information-theor...
RTS
2008
13 years 6 months ago
2008
There has been much recent interest in the use of the earliest-deadline-first (EDF) algorithm for scheduling soft real-time sporadic task systems on identical multiprocessors. In ...