800 search results - page 54 / 160 » Understanding Algorithm Performance on an Oversubscribed Sch... |
133
Voted
KR
2004
Springer
15 years 9 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
133
Voted
NETWORKING
2004
15 years 5 months ago
2004
We consider a system with multiple interconnected video servers storing TV programs that are received through satellite antennas. Users, equipped with set-top boxes, submit request...
139
click to vote
CC
2009
Springer
15 years 8 months ago
2009
Springer
Single-assignment languages with copy semantics have a very simple and approachable programming model. A na¨ıve implementation of the copy semantics that copies the result of eve...
125
click to vote
ICIP
2003
IEEE
16 years 5 months ago
2003
IEEE
Although, computational Grid has been initially developed to solve large-scale scientific research problems, it is extended for commercial and industrial applications. An interest...
145
click to vote
SIGMETRICS
2010
ACM
15 years 7 months ago
2010
ACM
We define CWS, a non-preemptive scheduling policy for workloads with correlated job sizes. CWS tackles the scheduling problem by inferring the expected sizes of upcoming jobs bas...