Optimal priority assignment in the presence of blocking

DOI10.1016/J.IPL.2006.03.002MaRDI QIDQ845683zbMATH OpenOpenAlexFDO

Authors Konstantinos Bletsas, N. C. Audsley

Publication date 29 January 2010

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

Full work available at URL https://doi.org/10.1016/j.ipl.2006.03.002

zbMATH Keywords

optimalityreal-time systemsblockingpriority assignmentfixed priority schedulingpriority ceiling protocol

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 53313 (Why is no real title available?)
• On priority assignment in fixed priority scheduling
• On the complexity of fixed-priority scheduling of periodic, real-time tasks
• Priority inheritance protocols: an approach to real-time synchronization
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Cited in

(3)

• Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms
• Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling
• Robust priority assignment for messages on Controller Area network (CAN)

This page was built for publication: Optimal priority assignment in the presence of blocking

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