Sufficient Schedulability Condition for Scheduling Weakly-Hard Real-Time Tasks Considering Job-Kill and Skip-Next Strategies
Victor Gabriel Moyano, Zain A. H. Hammadeh, Daniel Lüdtke, Michael Felderer · ACM SIGAPP Applied Computing Review · 2025
Real-time tasks, especially control tasks, can often tolerate occasional missed deadlines due to robust algorithms. The weakly-hard model offers an approach for specifying the maximum number of tolerable deadline misses m i within a sequence of K i executions. Research has shown that utilizing the weakly-hard model can significantly reduce the over-provisioning typically required in real-time system design. This led to the development of various scheduling algorithms and schedulability analyses in recent years. However, existing state-of-the-art analyses have limitations: they do not scale with larger values of K i and focus solely on job-kill as a system-level action. We propose a new job-level fixed priority scheduling algorithm that overcomes these limitations. Our approach first considers the traditional job-kill method but then extends to a skip-next job strategy in case of deadline miss. The schedulability analysis of our algorithm scales with K i , reducing computational time by up to 100 times compared to existing approaches.