Abstract
The deadline-monotonic (DM) scheduling of sporadic task systems upon a preemptive uniprocessor is considered. A technique is derived for determining upper bounds on the response time of the jobs of each task, when a constrained-deadline sporadic task system is scheduled. This technique yields a generalization to a load-based sufficient schedulability condition for DM, the generalization being the added ability to account for blocking in the presence of non-preemptable serially re-usable resources.
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.
