Deadline-based scheduling of periodic task systems on multiprocessors. (Q1853117)

From MaRDI portal
Revision as of 09:26, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    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
    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 references