Abstract
Real-time task now emerges in various reliable systems; however, most existing schedulers of real-time tasks are limited to fixed priority scheduling. A dynamic priority scheduling model is derived for the preemptive earliest deadline first scheduling of periodic real-time tasks in the real-time reliable system. Moreover, a heuristic algorithm is present for the schedulability test, which is effective when the priority inheritance protocol is considered to prevent priority inversion.
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.
