Reliable and Energy-Aware Fixed-Priority (m,k)-Deadlines Enforcement with Standby-Sparing
Linwei Niu1 and Dakai Zhu2
1Department of Math and Computer Science West Virginia State University Institute, WV, U.S.A.
lniu@wvstateu.edu
2Department of Computer Science University of Texas at San Antonio San Antonio, TX, U.S.A.
dakai.zhu@utsa.edu
ABSTRACT
For real-time computing systems, energy efficiency, Quality of Service, and fault tolerance are among the major design concerns. In this work, we study the problem of reliable and energy-aware fixed-priority (m,k)-deadlines enforcement with standby-sparing. The standby-sparing systems adopt a primary processor and a spare processor to provide fault tolerance for both permanent and transient faults. In order to reduce energy consumption for such kind of systems, we proposed a novel scheduling scheme under the QoS constraint of (m,k)- deadlines. The evaluation results demonstrate that our proposed approach significantly outperformed the previous research in energy conservation while assuring (m,k)-deadlines and fault tolerance for real-time systems.
Keywords: Energy Conservation, Fault Tolerance, Stand by Sparing, (m,k)-Deadlines, Fixed-Priority Scheduling.
