This paper proposes a Discrete Time Markov Decision Process (MDP) approach to compute the optimal on-line speed scaling policy to minimize the energy consumption of a single processor executing a finite or infinite set of jobs with real-time constraints. We provide several qualitative properties of the optimal policy: monotonicity with respect to the jobs parameters, comparison with on-line deterministic algorithms. Numerical experiments in several scenarios show that our proposition performs well when compared with off-line optimal solutions and out-performs on-line solutions oblivious to statistical information on the jobs
In this paper we study energy efficient deadline scheduling on multiprocessors in which the processo...
This letter investigates the structure of the optimal policy for a class of Markov decision processe...
In this paper we investigate algorithmic instruments leading to low power consumption in computing d...
This paper proposes a Discrete Time Markov Decision Process (MDP) approach to compute the optimal on...
International audienceThis paper proposes a Discrete Time Markov Decision Process (MDP) approach to ...
This paper proposes a Markov Decision Process (MDP) approach to compute the optimal on-line speed sc...
This paper proposes a Markov Decision Process (MDP) approach to compute theoptimal on-line speed sca...
International audienceThis paper presents a discrete time Markov Decision Process (MDP) to compute t...
The energy consumption is a crucial issue for real-time systems,that's why optimizing it online, i.e...
International audienceWe consider a Dynamic Voltage and Frequency Scaling (DVFS) processor executing...
International audienceWe consider a real-time system where a single processor with variable speed ex...
We consider online scheduling algorithms in the dynamic speed scaling model, where a processor can s...
Energy consumption in a computer system can be reduced by dynamic speed scaling, which adapts the pr...
Stage de DEA. Rapport de stage.Energy consumption is a significant factor in the design of digital s...
International audienceWe are given a set of n jobs and a single processor that can vary its speed dy...
In this paper we study energy efficient deadline scheduling on multiprocessors in which the processo...
This letter investigates the structure of the optimal policy for a class of Markov decision processe...
In this paper we investigate algorithmic instruments leading to low power consumption in computing d...
This paper proposes a Discrete Time Markov Decision Process (MDP) approach to compute the optimal on...
International audienceThis paper proposes a Discrete Time Markov Decision Process (MDP) approach to ...
This paper proposes a Markov Decision Process (MDP) approach to compute the optimal on-line speed sc...
This paper proposes a Markov Decision Process (MDP) approach to compute theoptimal on-line speed sca...
International audienceThis paper presents a discrete time Markov Decision Process (MDP) to compute t...
The energy consumption is a crucial issue for real-time systems,that's why optimizing it online, i.e...
International audienceWe consider a Dynamic Voltage and Frequency Scaling (DVFS) processor executing...
International audienceWe consider a real-time system where a single processor with variable speed ex...
We consider online scheduling algorithms in the dynamic speed scaling model, where a processor can s...
Energy consumption in a computer system can be reduced by dynamic speed scaling, which adapts the pr...
Stage de DEA. Rapport de stage.Energy consumption is a significant factor in the design of digital s...
International audienceWe are given a set of n jobs and a single processor that can vary its speed dy...
In this paper we study energy efficient deadline scheduling on multiprocessors in which the processo...
This letter investigates the structure of the optimal policy for a class of Markov decision processe...
In this paper we investigate algorithmic instruments leading to low power consumption in computing d...