Schedulability Analysis and Simulation for Rate-Monotonic Scheduling Algorithm

Gui Xian-zhou · Jisuanji fangzhen · 2006

The rate-monotonic scheduling algorithm is a classic scheduling algorithm for periodic tasks. It is necessary to analyse and simulate the schedulability of rate-monotonic scheduling algorithm before using it. The article introduces the scheduling discipline of rate-monotonic scheduling algorithm and the necessary and sufficient conditions for RM-schedulability, simulates on schedulability of rate-monotonic scheduling algorithm through multi-thread method of Windows and RMS manager of real-time operating system SACOS, analyses the simulation results. The two methods provide useful guidance for the schedulability analysis for rate-monotonic scheduling algorithm.

Read the paper · More papers on PaperTik