z-logo
open-access-imgOpen Access
Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible
Author(s) -
Nathan Fisher,
Joël Goossens,
Sanjoy Baruah
Publication year - 2010
Publication title -
carolina digital repository (university of north carolina at chapel hill)
Language(s) - English
DOI - 10.17615/wckk-d630
Subject(s) - multiprocessing , computer science , parallel computing , scheduling (production processes) , multiprocessor scheduling , distributed computing , dynamic priority scheduling , operating system , rate monotonic scheduling , schedule , mathematics , mathematical optimization

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here