Abstract
Fixed-priority preemption-threshold scheduling (FPTS) has been proposed as a generalization of fixed-priority preemptive scheduling (FPPS) and fixed-priority non-preemptive scheduling (FPNS) with the aim to improve schedulability and reduce run-time overheads. In this paper, we show that the existing worst-case response time (WCRT) analysis for FPTS is pessimistic and present an exact WCRT analysis. Moreover, we refine the task model for FPTS, making FPTS also a generalization of fixed-priority scheduling with deferred preemption (FPDS). Finally, we present exact analysis for FPTS for this refined task model and an example showing that FPTS can improve on FPPS and FPDS.
Sign-in/Register to access full text options 
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.
