ECTI TRANSACTIONS ON COMPUTER INFORMATION TECHNOLOGYVolume 16, No. 02, Month JUNE, Year 2022, Pages 208 - 221
A new scheduling algorithm for shortening response time of static priority task
Takaharu Suzuki, Kiyofumi Tanaka
Abstract Download PDFIn scheduling algorithms based on the Rate Monotonic (RM) method which are widely used in development of real-time systems, tasks with shorter periods have higher priorities. In contrast, ones with longer periods are likely to suffer from increased response times and jitter due to their lower priorities. We propose an Execution Right Delegation (ERD) method based on RM where a high-priority server for particular (or important) task is introduced to shorten response time and jitter of the task. In the evaluation, it is confirmed that response times and jitter of a particular (important) task are reduced. We also show Response Time Analysis (RTA), which assures worst-case response time of the task. This paper shows the algorithm and RTA of ERD and evaluates it by comparing it to a Deadline Monotonic method. The evaluation by simulation shows that ERD can reduce the average worst-case response time by 13.45% at maximum compared to the Deadline Monotonic scheduling. In addition, we confirm that the RTA provides a worst-case response time close to the simulation results.
Real-time schedul- ing, Rate Monotonic, Response Time Analysis