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

DOI10.1016/0020-0190(94)00200-IzbMATH Open0875.68077OpenAlexW2043184813MaRDI QIDQ673989FDOQ673989

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

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
• On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithm

zbMATH Keywords

AlgorithmsSchedulingReal-timePriority assignment

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Title not available (Why is that?)
• Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems
• Utilization-based admission control for aperiodic tasks under EDF scheduling
• The concept of maximal unschedulable deadline assignment for optimization in fixed-priority scheduled real-time systems

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)