Demand-based schedulability analysis for real-time multi-core scheduling
We propose the first demand-based schedulability analysis for two dynamic job-priority scheduling algorithms. We derive demand bound functions of EDZL (Earliest Deadline first until Zero-Laxity) and LLF (Least Laxity First). We combine the demand-based analysis framework with additional deadline-miss conditions specialized for EDZL and LLF. We demonstrate through simulation that the proposed schedulability analyses outperform the existing schedulability analyses.
demand-based schedulability analysis real-time systems multi-core systems