Reducing (m, k)-missing rate for overloaded real-time systems

Abstract

In this paper, we explore reducing the rate for missing the Quality of Service (QoS) constraint for overloaded real-time systems. The QoS constraint is modeled using (m, k)-constraints, which require that at least m out of any k consecutive jobs of a task meet their deadlines. We proposed a dynamic scheduling scheme to satisfy the (m, k)-constraints for real-time tasks. The simulation results demonstrate that our proposed techniques have great potential in reducing the (m, k)-missing rate for overloaded real-time systems.