Result: Frequency-aware energy optimization for real-time periodic and aperiodic tasks

Title:
Frequency-aware energy optimization for real-time periodic and aperiodic tasks
Source:
Proceedings of the 2007 ACM SIGPLAN-SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES 2007), San Diego, California, June 13-15, 2007ACM SIGPLAN notices. 42(7):21-30
Publisher Information:
Broadway, NY: ACM, 2007.
Publication Year:
2007
Physical Description:
print, 24 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Langages de programmation, Programming languages, Algorithme optimal, Optimal algorithm, Algoritmo óptimo, Calculateur embarqué, Boarded computer, Calculador embarque, Complexité algorithme, Algorithm complexity, Complejidad algoritmo, Complexité temps, Time complexity, Complejidad tiempo, Consommation énergie électrique, Power consumption, Consommation énergie, Energy consumption, Consumo energía, Critère optimalité, Optimality criterion, Criterio optimalidad, Economies d'énergie, Energy savings, Ahorros energía, Effet dimensionnel, Size effect, Efecto dimensional, En ligne, On line, En línea, Gestion tâche, Task scheduling, Gestión labor, Langage programmation, Programming language, Lenguaje programación, Minimisation, Minimization, Minimización, Modélisation, Modeling, Modelización, Méthode cas pire, Worst case method, Método caso peor, Méthode itérative, Iterative method, Método iterativo, Optimisation, Optimization, Optimización, Ordonnancement, Scheduling, Reglamento, Police, Policía, Périodicité, Periodicity, Periodicidad, Solution optimale, Optimal solution, Solución óptima, Solution périodique, Periodic solution, Solución periódica, Système actif, Active system, Sistema activo, Système dynamique, Dynamical system, Sistema dinámico, Système temps réel, Real time system, Sistema tiempo real, Temps exécution, Execution time, Tiempo ejecución, Temps linéaire, Linear time, Tiempo lineal, Temps réel, Real time, Tiempo real, Tension électrique, Voltage, Voltaje, Algorithms Real-time systems, dynamic power management, dynamic voltage scaling, power-aware scheduling
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Electrical and Computer Engineering Wayne State University, Detroit, Michigan 48202, United States
ISSN:
1523-2867
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.19154345
Database:
PASCAL Archive

Further Information

Energy efficiency is an important factor in embedded systems design. We consider an embedded system with a dynamic voltage scaling (DVS) capable processor and its system-wide power consumption is dominated by the processor and memory. We present speed assignment polices for a set of periodic/aperiodic tasks that minimize the overall system energy consumption including active and idle power of CPU and other components. A limitation of most DVS-based system-wide energy optimization techniques is that they assume the number of worst-case execution cycles (WCEC) of a task is a constant, independent of CPU frequency. This is not the case when other system components such as memory are taken into account. In this paper, we decompose task execution time into two parts: on-chip inside CPU and off-chip outside the CPU. We propose a frequency-aware system-wide energy minimization approach and establish necessary and sufficient conditions for the optimality. By exploiting properties of the conditions, we derive a bisection algorithm that finds the optimal solution to offline periodic tasks in a linear time complexity. We apply a similar analytical approach to online aperiodic tasks scheduling and devise an iterative speed assignment algorithm in the complexity of O(n2). We prove it is optimal among all online algorithms without assumptions about future task releases.