Fixed-Priority Scheduling for Reliable and Energy-Aware (m, k)-Deadlines Enforcement With Standby-Sparing

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 (m,k)-deadlines enforcement using standby-sparing under fixed-priority assignment. 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 two novel scheduling schemes under the QoS constraint of (m,k)-deadlines: one for task sets partitioned with deeply-red pattern and one for task sets partitioned with evenly distributed pattern. The evaluation results demonstrate that our proposed approaches significantly outperformed the previous research in energy conservation while assuring (m,k)-deadlines and fault tolerance for real-time systems.