Abstract
The global EDF scheduling of sporadic task systems upon uniform multiprocessor platforms is studied. A sufficient schedulability test is presented and proved correct. It is shown that this test generalizes the previously-known exact uniprocessor, and sufficient identical multiprocessor, EDF- schedulability tests.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.