N. Fisher and S. Baruah (USA)
Multiprocessor platforms; Static-Priority Scheduling; Schedulability analysis; Resource Augmentation.
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 pop ular Deadline-Monotonic real-time scheduling algorithm. Resource-augmentation bounds are provided that quantify the tightness of these schedulability tests.
Important Links:
Go Back