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

DOI10.1016/0020-0190(94)00200-IMaRDI QIDQ673989zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Optimal Resource Assignment of Preemptive Periodic Tasks on Multiple Processors
• Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
• scientific article; zbMATH DE number 986997
• scientific article; zbMATH DE number 4199942
• On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithm

Cites work

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

Cited in

(4)

• Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems
• The concept of maximal unschedulable deadline assignment for optimization in fixed-priority scheduled real-time systems
• scientific article; zbMATH DE number 1863333 (Why is no real title available?)
• Utilization-based admission control for aperiodic tasks under EDF scheduling

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673989)