Abstract
A new problem of real-time scheduling with both preemption and nonpreemption requirements is identified in this paper. We propose two efficient, dynamic and static, algorithms as a solution to the problem, which maximizes the schedulability. The dynamic approach mainly arranges tasks according to the relationship between the preempting and preempted tasks, while the static approach only considers the status of the resources to be accessed.
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.
