Abstract

The multiframe task model has been proposed to effectively model a task whose execution times are periodically changed according to a specified pattern. Schedulability of task sets consisting of multiframe tasks or generalized multiframe tasks (GMF tasks) is now being investigated under various conditions. This paper discusses the necessary and sufficient condition of the schedulability of GMF task sets under a priority-based preemptive scheduling with static priority assignment. The critical instant theorem for GMF task sets is described and the necessary and sufficient condition of their schedulability is presented based on the theorem. We also introduce the maximum interference junction (MIF) and propose a polynomial-time feasibility decision algorithm using the MIF.

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 call

Disclaimer: 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.