Abstract
Compared to fixed-priority preemptive scheduling (FPPS), fixed-priority scheduling with preemption thresholds (FPTS) reduces memory requirements, the cost of arbitrary preemptions, and it has been shown to improve the schedulability ratio of task-sets. FPTS has been viewed as a potential successor to FPPS as a de facto standard in industry, where it is already supported by both OSEK and AUTOSAR compliant operating systems.In this paper, we present and prove a novel exact best-case response time analysis for independent real-time periodic tasks with arbitrary deadlines scheduled using FPTS. Moreover, we present an evaluation of our novel analysis for FPTS with the best-case response time analysis for FPPS when ignoring the tasks that cannot preempt a task. For the majority of the cases in our evaluation, the best-case response time analysis for FPPS yields a tight lower bound for the response time of a task scheduled using FPTS.
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.
