Abstract | ||
---|---|---|
Reliability-aware power management (RAPM) schemes, which consider the negative effects of voltage scaling on system reliability, were recently studied to save energy while preserving system reliability. The existing RAPM schemes for periodic tasks may be, however, inherently unfair in that they can manage only some tasks at the expense of the other remaining tasks. In this work, we propose the flexible reliability-aware power management framework, which allows the management of all the tasks in the system, according to their assurance requirements. Optimally solving this problem is shown to be NP-hard in the strong sense and upper bounds on energy savings are derived. Then, by extending the processor demand analysis, a pseudo-polynomial-time static scheme is proposed for the "deeply red" recovery patterns. On-line schemes that manage dynamic slack for better energy savings and reliability enhancement are also discussed. The schemes are evaluated extensively through simulations. The results show that, compared to the previous RAPM schemes, the new flexible RAPM schemes can guarantee the assurance requirements for all the tasks, but at the cost of slightly decreased energy savings. However, when combined with dynamic reclaiming, the new schemes become as competitive as the previous ones on the energy dimension, while improving overall reliability. |
Year | DOI | Venue |
---|---|---|
2008 | 10.1109/RTCSA.2008.48 | RTCSA |
Keywords | Field | DocType |
periodic tasks,energy dimension,power aware computing,previous rapm scheme,energy management,periodic real-time tasks,np-hard problem,energy saving,deeply red recovery patterns,existing rapm scheme,better energy saving,voltage scaling,computational complexity,pseudopolynomial-time static scheme,reliability enhancement,variable assurance requirements,overall reliability,reliability,system reliability,flexible reliability-aware power management framework,assurance requirement,new flexible rapm scheme,real-time systems,real time,gold,computational modeling,real time systems,energy efficiency,upper bound,np hard problem | Power management,Energy management,Computer science,Efficient energy use,Demand analysis,Real-time computing,Periodic graph (geometry),Scaling,Decreased energy,Computational complexity theory | Conference |
ISSN | ISBN | Citations |
1533-2306 | 978-0-7695-3349-0 | 10 |
PageRank | References | Authors |
0.62 | 28 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Da-Kai Zhu | 1 | 1405 | 66.97 |
Xuan Qi | 2 | 58 | 3.35 |
Hakan Aydin | 3 | 1218 | 61.97 |