Deadline-based scheduling of periodic task systems on multiprocessors. (Q1853117): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:10, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deadline-based scheduling of periodic task systems on multiprocessors. |
scientific article |
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
