Optimal priority assignment in the presence of blocking

DOI10.1016/J.IPL.2006.03.002zbMATH Open1184.68119OpenAlexW2011013975MaRDI QIDQ845683FDOQ845683

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

• On priority assignment in fixed priority scheduling
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• On the complexity of fixed-priority scheduling of periodic, real-time tasks
• Priority inheritance protocols: an approach to real-time synchronization
• Title not available (Why is that?)

Cited In (3)

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

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)