64 search results - page 8 / 13 » Preemptive Scheduling of Equal-Length Jobs in Polynomial Tim... |
CONSTRAINTS
2011
13 years 5 months ago
2011
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, we propose an O(n4...
ECRTS
2000
IEEE
14 years 2 months ago
2000
IEEE
We present a variant of Pfair scheduling, which we call early-release fair (ERfair) scheduling. Like conventional Pfair scheduling, ERfair scheduling algorithms can be applied to ...
GECON
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. In distributed computer networks where resources are under decentralized control, selfish users will generally not work towards one common goal, such as maximizing the o...
RTSS
1998
IEEE
14 years 2 months ago
1998
IEEE
Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [10] for periodic tasks with highly variable execution times and s...
SIGMETRICS
2005
ACM
14 years 3 months ago
2005
ACM
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...