Deadline-based scheduling of periodic task systems on multiprocessors. (Q1853117)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Deadline-based scheduling of periodic task systems on multiprocessors. |
scientific article; zbMATH DE number 1856460
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deadline-based scheduling of periodic task systems on multiprocessors. |
scientific article; zbMATH DE number 1856460 |
Statements
Deadline-based scheduling of periodic task systems on multiprocessors. (English)
0 references
21 January 2003
0 references
We consider the problem of scheduling periodic task systems on multiprocessors and present a deadline-based scheduling algorithm for solving this problem. We show that our algorithm successfully schedules on \(m\) processors any periodic task system with utilization at most \(m^2/(2m-1)\).
0 references
Real-time systems
0 references
Multiprocessor scheduling
0 references
Periodic task systems
0 references
Feasibility analysis
0 references
Earliest deadline first
0 references
0.9339984
0 references
0.9266147
0 references
0 references
0.91008663
0 references
0.9029259
0 references
0.8984883
0 references
