Global static-priority scheduling of sporadic task systems on multiprocessor platforms
Nathan Fisher, Sanjoy Baruah · IASTED International Conference on Parallel and Distributed Computing and Systems · 2006
The multiprocessor scheduling of collections of real-time jobs is considered. Sufficient conditions are derived for determining whether a specified system meets all deadlines when scheduled by a static-priority algorithm. These conditions are used to obtain efficient schedulability tests for sporadic task systems scheduled using the popular Deadline-Monotonic real-time scheduling algorithm. Resource-augmentation bounds are provided that quantify the tightness of these schedulability tests.