Abstract
This paper focuses on schedulability tests of periodic task sets using fixed- priority scheduling, from a practical point of view. For the special case of task sets with offsets equal to zero (synchronous case), we compare different sufficient schedulability tests for Deadline-Monotonic (DM) scheduling, in terms of complexity and processor utilization. Finally, we consider the general case in which the offsets are arbitrary (asynchronous case). We show by simulation that the DM priority assignment is nearly optimal for asynchronous task sets. In addition, we compare the schedulability improvement of asynchronous task sets over their synchronous versions. Unfortunately, no practical improvement in schedulability is obtained by using the optimal offsets and priorities.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
