Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/ASPDAC.2014.6742909 | ASP-DAC |
Keywords | Field | DocType |
processor scheduling,power aware computing,near-optimal solutions,energy-efficient real-time embedded systems,approximation theory,security constraints,dynamic programming based approximation approach,energy conservation,secure real-time embedded systems,computational complexity,energy consumption minimization,scheduling problem,energy consumption,schedulability constraints,dynamic programming,embedded systems,minimisation,energy aware real-time scheduling policy,guaranteed security protection,polynomial time complexity,security of data,computer science | Dynamic programming,Energy conservation,Mathematical optimization,Job shop scheduling,Scheduling (computing),Computer science,Approximation theory,Real-time computing,Minimisation (psychology),Energy consumption,Computational complexity theory,Distributed computing | Conference |
ISSN | Citations | PageRank |
2153-6961 | 2 | 0.40 |
References | Authors | |
12 | 4 | |