99 search results - page 4 / 20 » Online Scheduling with Bounded Migration |
COCOON
2006
Springer
13 years 11 months ago
2006
Springer
We study an on-line broadcast scheduling problem in which requests have deadlines, and the objective is to maximize the weighted throughput, i.e., the weighted total length of the ...
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of scheduling a set of equal-length intervals arriving online, where each interval is associated with a weight and the objective is to maximize the total we...
COR
2011
13 years 2 months ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
SPAA
2004
ACM
14 years 27 days ago
2004
ACM
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
JPDC
2010
13 years 6 months ago
2010
We consider optimal real-time scheduling of periodic tasks on multiprocessors—i.e., satisfying all task deadlines, when the total utilization demand does not exceed the ion capa...