123 search results - page 3 / 25 » Size-Based Scheduling Policies with Inaccurate Scheduling In... |
ICC
2009
IEEE
13 years 12 months ago
2009
IEEE
— A point-to-point discrete-time scheduling problem of transmitting B information bits within T hard delay deadline slots is considered assuming that the underlying energy-bit co...
ETFA
2005
IEEE
13 years 11 months ago
2005
IEEE
Today there is a significant body of results of resource management in real-time systems. However, most of them are based on "open-loop" strategies and techniques that do...
SIGMETRICS
2010
ACM
13 years 9 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...
ICPP
2003
IEEE
13 years 10 months ago
2003
IEEE
The bus that connects processors to memory is known to be a major architectural bottleneck in SMPs. However, both software and scheduling policies for these systems generally focu...
PPOPP
2009
ACM
14 years 5 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...