Energy aware real-time scheduling policy with guaranteed security protection

In this work, we address the emerging scheduling problem existed in the design of secure and energy-efficient real-time embedded systems. The objective is to minimize the energy consumption subject to security and schedulability constraints. Due to the complexity of the problem, we propose a dynamic...

Full description

Saved in:
Bibliographic Details
Published inProceedings of the ASP-DAC ... Asia and South Pacific Design Automation Conference pp. 317 - 322
Main Authors Wei Jiang, Ke Jiang, Xia Zhang, Yue Ma
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.01.2014
Subjects
Approximation algorithms
Approximation methods
Energy consumption
Radio frequency
Real-time systems
Security
Silicon
Online AccessGet full text

Cover

More Information
Summary:In this work, we address the emerging scheduling problem existed in the design of secure and energy-efficient real-time embedded systems. The objective is to minimize the energy consumption subject to security and schedulability constraints. Due to the complexity of the problem, we propose a dynamic programming based approximation approach to find the near-optimal solutions with respect to predefined security constraint. The proposed technique has polynomial time complexity which is about half of traditional approximation approaches. The efficiency of our algorithm is validated by extensive experiments.
ISSN:2153-6961
DOI:10.1109/ASPDAC.2014.6742909