Size-based schedulers have very desirable performance properties: optimal or near-optimal response time can be coupled with strong fairness. Despite this, however, such systems are rarely implemented in practical settings, because they require knowing a priori the amount of work needed to complete jobs: this assumption is difficult to satisfy in concrete systems. It is definitely more likely to inform the system with an estimate of the job sizes, but existing studies point to somewhat pessimistic results if size-based policies use imprecise job size estimations. We take the goal of designing scheduling policies that explicitly deal with inexact job sizes. First, we prove that, in the absence of errors, it is always possible to improve any s...
Job scheduling in high-performance computing platforms is a hard problem that involves uncertainties...
When job sizes are known, Shortest Remaining Processing Time (SRPT) is known to be an optimal (in a ...
The Shortest Remaining Processing Time (SRPT) scheduling policy was proven, in the 1960s, to yield t...
Size-based schedulers have very desirable performance properties: optimal or near-optimal response t...
Abstract—Size-based schedulers have very desirable performance properties: optimal or near-optimal r...
We study size-based schedulers, and focus on the impact of inaccurate job size information on respon...
Despite the fact that size-based schedulers can give excellent results in terms of both average resp...
Motivated by the optimality of Shortest Remaining Processing Time (SRPT) for mean response time, in ...
Size-based scheduling with aging has been recognized as an effective approach to guarantee fairness ...
Size-based scheduling with aging has been recognized as an effective approach to guarantee fairness ...
Recently, there have been a number of scheduling success stories in computer applications. Across a ...
Abstract—Size-based scheduling with aging has, for long, been recognized as an effective approach to...
Size-based scheduling with aging has, for long, been recognized as an effective approach to guarante...
The study of size-based and size-oblivious scheduling policies with inaccurate job size information ...
We consider the problem of scheduling to minimize mean response time in M/G/1 queues where only esti...
Job scheduling in high-performance computing platforms is a hard problem that involves uncertainties...
When job sizes are known, Shortest Remaining Processing Time (SRPT) is known to be an optimal (in a ...
The Shortest Remaining Processing Time (SRPT) scheduling policy was proven, in the 1960s, to yield t...
Size-based schedulers have very desirable performance properties: optimal or near-optimal response t...
Abstract—Size-based schedulers have very desirable performance properties: optimal or near-optimal r...
We study size-based schedulers, and focus on the impact of inaccurate job size information on respon...
Despite the fact that size-based schedulers can give excellent results in terms of both average resp...
Motivated by the optimality of Shortest Remaining Processing Time (SRPT) for mean response time, in ...
Size-based scheduling with aging has been recognized as an effective approach to guarantee fairness ...
Size-based scheduling with aging has been recognized as an effective approach to guarantee fairness ...
Recently, there have been a number of scheduling success stories in computer applications. Across a ...
Abstract—Size-based scheduling with aging has, for long, been recognized as an effective approach to...
Size-based scheduling with aging has, for long, been recognized as an effective approach to guarante...
The study of size-based and size-oblivious scheduling policies with inaccurate job size information ...
We consider the problem of scheduling to minimize mean response time in M/G/1 queues where only esti...
Job scheduling in high-performance computing platforms is a hard problem that involves uncertainties...
When job sizes are known, Shortest Remaining Processing Time (SRPT) is known to be an optimal (in a ...
The Shortest Remaining Processing Time (SRPT) scheduling policy was proven, in the 1960s, to yield t...