Optimal priority assignment for aperiodic tasks with firm deadlines in fixed priority pre-emptive systems

DOI10.1016/0020-0190(94)00200-IzbMath0875.68077OpenAlexW2043184813MaRDI QIDQ673989

Alan Burns, Robert I. Davis

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00200-i

zbMATH Keywords

AlgorithmsSchedulingReal-timePriority assignment

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• An optimal scheduling algorithm for preemptable real-time tasks
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: Optimal priority assignment for aperiodic tasks with firm deadlines in fixed priority pre-emptive systems