## Optimal Speed Assignment for Probabilistic Execution Times (2005)

Venue: | In 2 nd Workshop on PowerAware Real-Time Computing (PARC’05), NJ |

Citations: | 5 - 3 self |

### BibTeX

@INPROCEEDINGS{Scordino05optimalspeed,

author = {Claudio Scordino},

title = {Optimal Speed Assignment for Probabilistic Execution Times},

booktitle = {In 2 nd Workshop on PowerAware Real-Time Computing (PARC’05), NJ},

year = {2005}

}

### OpenURL

### Abstract

The problem of reducing energy consumption is dominating the design and the implementation of embedded realtime systems. For this reason, a new generation of processors allow to vary the voltage and the operating frequency to balance computational speed versus energy consumption. The policies that can exploit this feature are called Dynamic Voltage Scheduling (DVS). In real-time systems, the DVS technique must also provide the worst-case computational requirement. However, it is well known that the probability of a task executing for the longest possible time is very low. Hence, DVS policies can exploit probabilistic information about the execution times of tasks to reduce the energy consumed by the processor. In this paper we provide the foundations to integrate probabilistic timing analysis with energy minimization techniques, starting from the simple case of one task. 1

### Citations

439 | A scheduling model for reduced cpu energy
- Yao, Demers, et al.
- 1995
(Show Context)
Citation Context ...la Superiore Sant’Anna, Italy e.bini@sssup.it Recently, many DVS algorithms have been proposed in the literature. These algorithms can be divided in two classes: static and dynamic. Static techniques =-=[21, 14, 17, 12, 3]-=- are typically applied to periodic tasks, and make use of off-line parameters, such as periods and worst-case execution cycles (WCECs), to select the appropriate processor speed. Since the worst-case ... |

427 | Real-time dynamic voltage scaling for lowpower embedded operating systems
- Pillai, Shin
- 2001
(Show Context)
Citation Context ...la Superiore Sant’Anna, Italy e.bini@sssup.it Recently, many DVS algorithms have been proposed in the literature. These algorithms can be divided in two classes: static and dynamic. Static techniques =-=[21, 14, 17, 12, 3]-=- are typically applied to periodic tasks, and make use of off-line parameters, such as periods and worst-case execution cycles (WCECs), to select the appropriate processor speed. Since the worst-case ... |

350 | Voltage Scheduling Problem for Dynamically Variable Voltage Processors
- Ishihara, Yasuura
- 1998
(Show Context)
Citation Context ...n [0, T ] was known in with a specific power function. advance, the best way to reduce energy consumption would In this paper we integrate the concept of probabilistic ex- be to keep a constant speed =-=[10, 15]-=-. In fact, the convexity ecution time within the framework of energy minimization, of the power/speed curve implies that maintaining a conproviding the basis of a new challenging approach. We prestant... |

127 | Dynamic Voltage Scaling on a Low-Power Microprocessor”, UbiCom - Pouwelse, Langendoen, et al. |

100 | A Comparison of Static Analysis and Evolutionary Testing for the Verification of Timing Constraints
- gener, Mueller
- 2001
(Show Context)
Citation Context ...16, 18], which take advantage of early job completion. Some studies have observed that the actual execution cycles of real-world embedded tasks may vary up to 80% with respect to their measured WCECs =-=[20]-=-. Thus, dynamic methods can exploit information about the run-time behaviour of tasks, which may be very far from the pessimistic assumptions required during the design of static techniques. Dynamic a... |

96 | Power-Aware Scheduling for Periodic Real-Time Tasks
- Aydin, Melhem, et al.
- 2004
(Show Context)
Citation Context ...rst-case parameters may differ significantly from the actual values, these techniques save less energy than the dynamic ones. On the other hand, much recent research has focused on dynamic techniques =-=[14, 1, 22, 17, 16, 18]-=-, which take advantage of early job completion. Some studies have observed that the actual execution cycles of real-world embedded tasks may vary up to 80% with respect to their measured WCECs [20]. T... |

82 |
Energy management for commercial servers
- Lefurgy, Rajamani, et al.
- 2003
(Show Context)
Citation Context ... workstation PCs and servers face energy constraints. Not surprisingly, a significant portion of the consumed energy is due to the cooling devices, which may consume up to the 50% of the total energy =-=[11]-=-. In addition, researchers at IBM showed that average processor use of servers is between 10% and 50% of their peak capacity because the load depends on the time of the day or the day of the week [4].... |

70 | The case for power management in web servers
- Bohrer, Elnozahy, et al.
- 2002
(Show Context)
Citation Context ...[11]. In addition, researchers at IBM showed that average processor use of servers is between 10% and 50% of their peak capacity because the load depends on the time of the day or the day of the week =-=[4]-=-. This suggests that a striking energy reduction can be achieved by enriching DVS policies with a more detailed information on the required workload. 1 Enrico Bini Scuola Superiore Sant’Anna, Italy e.... |

68 | Feedback EDF scheduling exploiting dynamic voltage scaling
- Zhu, Mueller
- 2004
(Show Context)
Citation Context ...rst-case parameters may differ significantly from the actual values, these techniques save less energy than the dynamic ones. On the other hand, much recent research has focused on dynamic techniques =-=[14, 1, 22, 17, 16, 18]-=-, which take advantage of early job completion. Some studies have observed that the actual execution cycles of real-world embedded tasks may vary up to 80% with respect to their measured WCECs [20]. T... |

52 | Practical Voltage-Scaling for Fixed-Priority RT-Systems
- Saewong, Rajkumar
- 2003
(Show Context)
Citation Context ...la Superiore Sant’Anna, Italy e.bini@sssup.it Recently, many DVS algorithms have been proposed in the literature. These algorithms can be divided in two classes: static and dynamic. Static techniques =-=[21, 14, 17, 12, 3]-=- are typically applied to periodic tasks, and make use of off-line parameters, such as periods and worst-case execution cycles (WCECs), to select the appropriate processor speed. Since the worst-case ... |

31 | Speed modulation in energyaware real-time systems
- Bini, Buttazzo, et al.
- 2005
(Show Context)
Citation Context |

29 | A dynamic voltage scaling algorithm for sporadic tasks
- Qadi, Goddard, et al.
- 2003
(Show Context)
Citation Context ...rst-case parameters may differ significantly from the actual values, these techniques save less energy than the dynamic ones. On the other hand, much recent research has focused on dynamic techniques =-=[14, 1, 22, 17, 16, 18]-=-, which take advantage of early job completion. Some studies have observed that the actual execution cycles of real-world embedded tasks may vary up to 80% with respect to their measured WCECs [20]. T... |

26 | A probabilistic framework for schedulability analysis
- Burns, Bernat, et al.
- 2003
(Show Context)
Citation Context ...k execu- point for more complex analysis [22]. tion time. Recently, the discipline of probabilistic timing The task τ has period and deadline both equal to T . The analysis has significantly advanced =-=[5, 7]-=-, and today there number of processor cycles required in the interval [0, T ] exist some tools which can provide the p.d.f. of task execution times [2]. is modelled by a random variable whose p.d.f. i... |

21 | An integrated approach for applying dynamic voltage scaling to hard real-time systems
- Liu, Mok
- 2003
(Show Context)
Citation Context |

17 |
Energy-centric scheduling for real-time systems
- Gruian
- 2002
(Show Context)
Citation Context ...led by a random variable whose p.d.f. is fC(c). The maximum possible number of cycles needed by τ is An attempt to consider stochastic information in energy reduction problems has been done by Gruian =-=[8]-=-. However, Cmax. Since the task is hard real-time, Cmax cycles must be available in [0, T ]. it only addresses the case with no transition overheads and If the number of required cycles in [0, T ] was... |

14 | pwcet: a tool for probabilistic worst-case execution time analysis of real-time systems - Bernat, Colin, et al. - 2003 |

13 | Using resource reservation techniques in power-aware scheduling: The grub-pa algorithm
- Scordino, Lipari
- 2003
(Show Context)
Citation Context |

12 | Clustered calculation of worst-case execution times
- Ermedahl, Stappert, et al.
- 2003
(Show Context)
Citation Context ...k execu- point for more complex analysis [22]. tion time. Recently, the discipline of probabilistic timing The task τ has period and deadline both equal to T . The analysis has significantly advanced =-=[5, 7]-=-, and today there number of processor cycles required in the interval [0, T ] exist some tools which can provide the p.d.f. of task execution times [2]. is modelled by a random variable whose p.d.f. i... |