Schedulability Analysis of Deadline Monotonic Scheduling for Realtime System
Zhanfeng Wang · Computer and Modernization · 2008
One of the key issues in real-time theory is the schedulable analysis of a given task set with fixed priority.This paper presents a feasible PSTA(precised schedulability test algorithm) for analyzing the schedulability of periodic task sets under Deadline Monotonic Scheduling.This method uses the necessary and sufficient schedulability condition to guarantee that the test result for every task set is correct.A schedulability model for DMS is investigated,the thought of schedulability is derived,the related theorems are proposed and proven through the experiment.