Abstract
The multiprocessor scheduling of collections of real-time jobs is considered. Sufficient tests are derived for feasibility analysis of a collection of sporadic jobs where job migration between processors is forbidden. The fixed-priority scheduling of real-time jobs with job migration is analyzed, and sufficient tests of schedulability are obtained for the deadline-monotonic (dm) and the earliest-deadline-first (edf) scheduling algorithms. The feasibility and schedulability tests of this paper may be applied even when the collection of jobs is incompletely specified. The applicability of these tests to the scheduling of collections of jobs that are generated by systems of recurrent real-time tasks is discussed. In particular, sufficient conditions for the dm scheduling of sporadic task systems are derived and compared to previously-known tests.
| Original language | English |
|---|---|
| Pages (from-to) | 97-122 |
| Number of pages | 26 |
| Journal | Real-Time Systems |
| Volume | 39 |
| Issue number | 1-3 |
| DOIs | |
| State | Published - Aug 2008 |
Keywords
- Feasibility analysis
- Fixed-priority scheduling
- Multiprocessor platforms
- Recurrent tasks
- Schedulability analysis
- Sufficient conditions