Abstract
The deadline-based scheduling of periodic task systems on multiprocessors was discussed. A periodic task system consists of several periodic tasks which were executed on a specific processor architecture. The scheduling of periodic task systems on m (≥1) identical multiprocessors was studied. An earliest deadline first (EDF)-based scheduling algorithm was proposed for the global scheduling of periodic task systems on multiprocessors.
| Original language | English |
|---|---|
| Pages (from-to) | 93-98 |
| Number of pages | 6 |
| Journal | Information Processing Letters |
| Volume | 84 |
| Issue number | 2 |
| DOIs | |
| State | Published - Oct 31 2002 |
Keywords
- Earliest deadline first
- Feasibility analysis
- Multiprocessor scheduling
- Periodic task systems
- Real-time systems