Abstract
The non-preemptive scheduling of periodic task systems upon processing platforms comprised of several identical processors is considered. The exact problem has previously been proven intractable even upon single processors; sufficient conditions are presented here for determining whether a given periodic task system will meet all deadlines if scheduled non-preemptively upon a multiprocessor platform using the earliest-deadline first scheduling algorithm.
| Original language | English |
|---|---|
| Pages (from-to) | 9-20 |
| Number of pages | 12 |
| Journal | Real-Time Systems |
| Volume | 32 |
| Issue number | 1-2 |
| DOIs | |
| State | Published - Feb 2006 |
Keywords
- Earliest-deadline first
- Feasibility analysis
- Multiprocessor systems
- Non-preemptive scheduling
- Periodic tasks