Optimal (D - J)-monotonic priority assignment

DOI10.1016/J.IPL.2007.04.006MaRDI QIDQ2379982zbMATH OpenOpenAlexFDO

Authors Areej Zuhily, Alan Burns

Publication date 24 March 2010

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

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

zbMATH Keywords

optimalityreal-time systemspriority assignmentfixed priority scheduling

Mathematics Subject Classification ID

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

Cites work

• On fixed priority scheduling, offsets and co-prime task periods
• On the complexity of fixed-priority scheduling of periodic, real-time tasks
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Cited in

(4)

• Schedulability analysis for controller area network (CAN) with FIFO queues priority queues and gateways
• Robust priority assignment for messages on Controller Area network (CAN)
• Tangent cones to two-dimensional area-minimizing integral currents are unique
• Maintaining data temporal consistency in distributed real-time systems

This page was built for publication: Optimal \((D - J)\)-monotonic priority assignment

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