Online Slack-Stealing Scheduling with Modified laEDF in Real-Time Systems

• Main Authors: Wonbo Jeon, Wonsop Kim, Heoncheol Lee, Cheol-Hoon Lee
• Format: Article
• Language: English
• Published: MDPI AG 2019-11-01
• Series: Electronics
• Subjects: ssml; slack computation; aperiodic task scheduling; mixed task system; slack-stealing
• Online Access: https://www.mdpi.com/2079-9292/8/11/1286

In hard real-time task systems where periodic and aperiodic tasks coexist, the object of task scheduling is to reduce the response time of the aperiodic tasks while meeting the deadline of periodic tasks. Total bandwidth server (TBS) and advanced TBS (ATBS) are used in dynamic priority systems. However, these methods are not optimal solutions because they use the worst-case execution time (WCET) or the estimation value of the actual execution time of the aperiodic tasks. This paper presents an online slack-stealing algorithm called SSML that can make significant response time reducing by modification of look-ahead earliest deadline first (laEDF) algorithm as the slack computation method. While the conventional slack-stealing method has a disadvantage that the slack amount of each frame must be calculated in advance, SSML calculates the slack when aperiodic tasks arrive. Our simulation results show that SSML outperforms the existing TBS based algorithms when the periodic task utilization is higher than 60%. Compared to ATBS with virtual release advancing (VRA), the proposed algorithm can reduce the response time up to about 75%. The performance advantage becomes much larger as the utilization increases. Moreover, it shows a small performance variation of response time for various task environments.