Global Scheduling Based Reliability-Aware Power Management for Multiprocessor Real-Time Systems

dc.contributor.authorQi, Xuan
dc.contributor.authorZhu, Dakai
dc.contributor.authorAydin, Hakan
dc.date.accessioned2023-10-25T16:26:05Z
dc.date.available2023-10-25T16:26:05Z
dc.date.issued2010-09
dc.description.abstractReliability-aware power management (RAPM) has been a recent research focus due the negative effects of the popular power management technique dynamic voltage and frequency scaling (DVFS) on system reliability. As a result, several RAPM schemes have been proposed for uniprocessor real-time systems. In this paper, for a set of frame-based independent real-time tasks running on multiprocessor systems, we study global scheduling based RAPM (G-RAPM) schemes. Depending on how recovery blocks are scheduled and utilized, both individual-recovery and shared-recovery based G-RAPM schemes are investigated. An important dimension of the G-RAPM problem is how to select the appropriate subset of tasks for energy and reliability management (i.e., scale down their executions while ensuring that they can be recovered from transient faults). We show that making such decision optimally (i.e., the static G-RAPM problem) is NP-hard. Then, for the individual-recovery based approach, we study two efficient heuristics, which rely on local and global task selections, respectively. For the shared-recovery based approach, a linear search based scheme is proposed. The schemes are shown to guarantee all task deadlines. Moreover, to reclaim the dynamic slack generated at runtime from early completion of tasks and unused recoveries, we also propose online G-RAPM schemes which exploit the slack-sharing idea studied in our previous work. The proposed schemes are evaluated through extensive simulations. The results show the effectiveness of the proposed schemes in yielding energy savings while simultaneously preserving system reliability and timing constraints. For static cases, as the shared-recovery based scheme can leave more slack and manage more tasks, it can save more energy compared to that of individual-recovery based schemes (especially for the cases with modest system loads). Moreover, by reclaiming dynamic slack generated at runtime, online G-RAPM schemes are shown to yield better energy savings.
dc.description.departmentComputer Science
dc.description.sponsorshipThis work was supported in part by NSF awards CNS-0720651, CNS-0720647, CNS-1016855, CNS-1016974, and NSF CAREER Awards CNS-0546244 and CNS-0953005.
dc.identifier.urihttps://hdl.handle.net/20.500.12588/2171
dc.language.isoen_US
dc.publisherUTSA Department of Computer Science
dc.relation.ispartofseriesTechnical Report; CS-TR-2010-014
dc.subjectenergy management
dc.subjectdynamic voltage and frequency scaling
dc.subjectreliability management
dc.subjectmultiprocessor real-time systems
dc.titleGlobal Scheduling Based Reliability-Aware Power Management for Multiprocessor Real-Time Systems
dc.typeTechnical Report

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Qi_et_al_CS-TR-2010-014.pdf
Size:
304.28 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.86 KB
Format:
Item-specific license agreed upon to submission
Description: