This paper presents a new energy-aware algorithm that integrates Dynamic Voltage and Frequency Scaling (DVFS) and Dynamic Power Management (DPM) techniques to further reduce energy consumption in embedded systems. It consists of an off-line DVFS-stage, for computing the speed that minimizes energy consumption during active intervals while guaranteeing timing constraints, and an online DPM-stage, for prolonging sleep intervals by postponing task execution. Moreover, limited preemptive scheduling is exploited to reduce preemption costs and further extend sleep intervals under fixed-priority systems, with respect to fully preemptive schedulers. The online algorithm has a constant complexity and preemption costs are taken into account in the analysis. A set of simulation experiments are reported to illustrate the behavior of the proposed approach as a function of different parameters and compare its performance with the state-of-art methods available in the literature.

An energy-aware algorithm exploiting limited preemptive scheduling under fixed priorities / Bambagini, Mario; Bertogna, Marko; Marinoni, Mauro; Buttazzo, Giorgio. - STAMPA. - (2013), pp. 3-12. (Intervento presentato al convegno 8th IEEE International Symposium on Industrial Embedded Systems, SIES 2013 tenutosi a Porto, Portugal nel June, 2013) [10.1109/SIES.2013.6601465].

An energy-aware algorithm exploiting limited preemptive scheduling under fixed priorities

Bambagini, Mario;BERTOGNA, Marko;
2013

Abstract

This paper presents a new energy-aware algorithm that integrates Dynamic Voltage and Frequency Scaling (DVFS) and Dynamic Power Management (DPM) techniques to further reduce energy consumption in embedded systems. It consists of an off-line DVFS-stage, for computing the speed that minimizes energy consumption during active intervals while guaranteeing timing constraints, and an online DPM-stage, for prolonging sleep intervals by postponing task execution. Moreover, limited preemptive scheduling is exploited to reduce preemption costs and further extend sleep intervals under fixed-priority systems, with respect to fully preemptive schedulers. The online algorithm has a constant complexity and preemption costs are taken into account in the analysis. A set of simulation experiments are reported to illustrate the behavior of the proposed approach as a function of different parameters and compare its performance with the state-of-art methods available in the literature.
2013
8th IEEE International Symposium on Industrial Embedded Systems, SIES 2013
Porto, Portugal
June, 2013
3
12
Bambagini, Mario; Bertogna, Marko; Marinoni, Mauro; Buttazzo, Giorgio
An energy-aware algorithm exploiting limited preemptive scheduling under fixed priorities / Bambagini, Mario; Bertogna, Marko; Marinoni, Mauro; Buttazzo, Giorgio. - STAMPA. - (2013), pp. 3-12. (Intervento presentato al convegno 8th IEEE International Symposium on Industrial Embedded Systems, SIES 2013 tenutosi a Porto, Portugal nel June, 2013) [10.1109/SIES.2013.6601465].
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/1064350
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 13
  • ???jsp.display-item.citation.isi??? 6
social impact