On priority assignment in fixed priority scheduling

DOI10.1016/S0020-0190(00)00165-4zbMath0998.68018OpenAlexW2056227251WikidataQ127976062 ScholiaQ127976062MaRDI QIDQ1603434

N. C. Audsley

Publication date: 14 July 2002

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(00)00165-4

zbMATH Keywords

optimalityreal-time systemspriority assignmentfixed priority scheduling

Mathematics Subject Classification ID

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

Related Items (21)

A specification-oriented semantics for the refinement of real-time systems ⋮ Generalizing fixed-priority scheduling for better schedulability in mixed-criticality systems ⋮ Robust priority assignment for messages on Controller Area network (CAN) ⋮ Optimal priority assignment in the presence of blocking ⋮ Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling ⋮ Maintaining the feasibility of hard real-time systems with a reduced number of priority levels ⋮ Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems ⋮ Lowest priority first based feasibility analysis of real-time systems ⋮ An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems ⋮ Exact speedup factors and sub-optimality for non-preemptive scheduling ⋮ Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms ⋮ FPSL, FPCL and FPZL schedulability analysis ⋮ Schedulability analysis for controller area network (CAN) with FIFO queues priority queues and gateways ⋮ Bounding and shaping the demand of generalized mixed-criticality sporadic task systems ⋮ Interference-aware fixed-priority schedulability analysis on multiprocessors ⋮ Fault-tolerant and real-time scheduling for mixed-criticality systems ⋮ Unnamed Item ⋮ Exact scheduling analysis of non-accumulatively monotonic multiframe tasks ⋮ FFOB: efficient online mode-switch procrastination in mixed-criticality systems ⋮ The concept of maximal unschedulable deadline assignment for optimization in fixed-priority scheduled real-time systems ⋮ On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithm

Uses Software

• Ada95

Cites Work

• 802.4 rate monotonic scheduling in hard real-time environments: setting the medium access control parameters
• A note on preemptive scheduling of periodic, real-time tasks
• On the complexity of fixed-priority scheduling of periodic, real-time tasks
• Fixed priority scheduling with limited priority levels
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Unnamed Item

This page was built for publication: On priority assignment in fixed priority scheduling