Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 153-159 |
| Number of pages | 7 |
| Journal | Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems |
| State | Published - 2006 |
| Event | 18th IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2006 - Dallas, TX, United States Duration: Nov 13 2006 → Nov 15 2006 |
Keywords
- Multiprocessor platforms
- Resource augmentation
- Schedulability analysis
- Static-priority scheduling