Deadline-based scheduling of periodic task systems on multiprocessors. (Q1853117): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Proportionate progress: A notion of fairness in resource allocation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a Real-Time Scheduling Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4252706 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4526977 / rank | |||
Normal rank | |||
Revision as of 11:22, 5 June 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
