We show that a natural online algorithm for scheduling jobs on a heterogeneous multiprocessor, with arbitrary power functions, is scalable for the objective function of weighted flow plus energy.</p
We present a new online algorithm for profit-oriented scheduling on multiple speed-scalable pro-cess...
In this paper we study energy efficient deadline scheduling on multiprocessors in which the processo...
We consider the problem of online scheduling of jobs on unrelated machines with dynamic speed scalin...
Abstract—We show that a natural nonclairvoyant online algorithm for scheduling jobs on a power-heter...
International audienceWe consider the problem of scheduling a set of jobs, each one specified by its...
International audienceWe consider the problem of scheduling a set of jobs, each one specified by its...
This article initiates a theoretical investigation into online scheduling problems with speed scalin...
In this paper we consider non-preemptive online scheduling of jobs with release times and deadlines ...
LNCS v. 6346 has title: Algorithms - ESA 2010: 18th Annual European Symposium, Liverpool, UK, Septem...
In this paper we investigate algorithmic instruments leading to low power consumption in computing d...
We consider online scheduling algorithms in the dynamic speed scaling model, where a processor can s...
We consider online job scheduling together with power management on multiple machines. In this model...
We consider offline scheduling algorithms that incorporate speed scaling to address the bi-criteria ...
We consider the problem of online scheduling of jobs on unrelated machines with dynamic speed scalin...
Efficient job scheduling reduces energy consumption and enhances the performance of machines in data...
We present a new online algorithm for profit-oriented scheduling on multiple speed-scalable pro-cess...
In this paper we study energy efficient deadline scheduling on multiprocessors in which the processo...
We consider the problem of online scheduling of jobs on unrelated machines with dynamic speed scalin...
Abstract—We show that a natural nonclairvoyant online algorithm for scheduling jobs on a power-heter...
International audienceWe consider the problem of scheduling a set of jobs, each one specified by its...
International audienceWe consider the problem of scheduling a set of jobs, each one specified by its...
This article initiates a theoretical investigation into online scheduling problems with speed scalin...
In this paper we consider non-preemptive online scheduling of jobs with release times and deadlines ...
LNCS v. 6346 has title: Algorithms - ESA 2010: 18th Annual European Symposium, Liverpool, UK, Septem...
In this paper we investigate algorithmic instruments leading to low power consumption in computing d...
We consider online scheduling algorithms in the dynamic speed scaling model, where a processor can s...
We consider online job scheduling together with power management on multiple machines. In this model...
We consider offline scheduling algorithms that incorporate speed scaling to address the bi-criteria ...
We consider the problem of online scheduling of jobs on unrelated machines with dynamic speed scalin...
Efficient job scheduling reduces energy consumption and enhances the performance of machines in data...
We present a new online algorithm for profit-oriented scheduling on multiple speed-scalable pro-cess...
In this paper we study energy efficient deadline scheduling on multiprocessors in which the processo...
We consider the problem of online scheduling of jobs on unrelated machines with dynamic speed scalin...
DOI
Add to ORKG