505 search results - page 69 / 101 » Dual Priority Scheduling |
RTSS
1996
IEEE
14 years 2 days ago
1996
IEEE
The well-known periodic task model of Liu and Layland 1] assumes a worst-case execution time bound for every task and may be too pessimistic if the worst-case execution time of a ...
GECCO
2010
Springer
13 years 10 months ago
2010
Springer
Developing dispatching rules for manufacturing systems is a tedious process, which is time- and cost-consuming. Since there is no good general rule for different scenarios and ob...
PPOPP
2009
ACM
14 years 8 months ago
2009
ACM
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
SIGMETRICS
2004
ACM
14 years 1 months ago
2004
ACM
The Least Attained Service (LAS) scheduling policy, when used for scheduling packets over the bottleneck link of an Internet path, can greatly reduce the average flow time for sh...
CEE
2007
13 years 8 months ago
2007
Real-time systems are often designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an i...