We investigate particularly simple algorithms for optimizing the tradeoff between load imbalance and assignment overheads in dynamic multiprocessor scheduling scenarios, when the information that is available about the processing time of a task before it is completed is vague. We describe a simple and elegant generic algorithm that, in a very general model, always comes surprisingly close to the theoretical optimum, and the performance of which we can analyze exactly with respect to constant factors. In contrast, we prove that algorithms that assign tasks in equal-sized portions perform far from optimal in general. In fact, we give evidence that the performance of our generic scheme cannot be improved by any constant factor without sacrific...
Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines ...
Anytime algorithms offer a tradeoff between computation time and the quality of the result returned....
The authors analyze the performance of a heuristic algorithm, Hk, which tries to keep at least k pro...
We consider the problem of processing a given number of tasks on a given number of processors as qui...
We consider the problem of processing a given number of tasks on a given number of processors as qui...
We consider the problem of processing a given number of tasks on a given number of processors as qui...
Abstract We consider two fundamental problems in dynamic scheduling: scheduling to meet deadlines in...
We consider two fundamental problems in dynamic scheduling: scheduling to meet deadlines in a preemp...
We consider two fundamental problems in dynamic scheduling: scheduling to meet deadlines in a preemp...
On-line scheduling in real-time environments has been studied by a number of researchers [8, 16, 13,...
Hard real-time task scheduling in a dynamic environment has been an important area of research, posi...
The problem of uniprocessor scheduling under conditions of overload is investigated. The system obje...
Typescript (photocopy).Consideration is given to the problem of nonpreemptively scheduling a set of ...
We consider the problem of processing a given number of tasks on a given number of processors as qui...
In this paper, the problem of preemptively scheduling a set of periodic tasks on a multiprocessor is...
Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines ...
Anytime algorithms offer a tradeoff between computation time and the quality of the result returned....
The authors analyze the performance of a heuristic algorithm, Hk, which tries to keep at least k pro...
We consider the problem of processing a given number of tasks on a given number of processors as qui...
We consider the problem of processing a given number of tasks on a given number of processors as qui...
We consider the problem of processing a given number of tasks on a given number of processors as qui...
Abstract We consider two fundamental problems in dynamic scheduling: scheduling to meet deadlines in...
We consider two fundamental problems in dynamic scheduling: scheduling to meet deadlines in a preemp...
We consider two fundamental problems in dynamic scheduling: scheduling to meet deadlines in a preemp...
On-line scheduling in real-time environments has been studied by a number of researchers [8, 16, 13,...
Hard real-time task scheduling in a dynamic environment has been an important area of research, posi...
The problem of uniprocessor scheduling under conditions of overload is investigated. The system obje...
Typescript (photocopy).Consideration is given to the problem of nonpreemptively scheduling a set of ...
We consider the problem of processing a given number of tasks on a given number of processors as qui...
In this paper, the problem of preemptively scheduling a set of periodic tasks on a multiprocessor is...
Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines ...
Anytime algorithms offer a tradeoff between computation time and the quality of the result returned....
The authors analyze the performance of a heuristic algorithm, Hk, which tries to keep at least k pro...