Rate monotonic scheduling re-analysed

DOI10.1016/J.IPL.2009.12.010zbMATH Open1209.68072OpenAlexW2005420316MaRDI QIDQ991759FDOQ991759

Authors: Qiwen Xu, Naijun Zhan 

Publication date: 7 September 2010

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

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

Recommendations

• Liu and Layland's schedulability test revisited
• scientific article; zbMATH DE number 2112450
• Rate monotonic scheduling in hard real-time systems
• Rate monotonic schedulability tests using period-dependent conditions
• Comments on ``Generalized rate monotonic schedulability bounds using relative period ratios

zbMATH Keywords

schedulingreal time systemsschedulability conditions

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
• Liu and Layland's schedulability test revisited
• Title not available (Why is that?)
• A calculus of durations

Cited In (10)

• Utilization bounds for multiprocessor rate-monotonic scheduling
• Dynamising Interval Scheduling: The Monotonic Case
• 802.4 rate monotonic scheduling in hard real-time environments: setting the medium access control parameters
• Title not available (Why is that?)
• Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling
• Liu and Layland's schedulability test revisited
• An Efficient Test Method for Rate Monotonic Schedulability
• Rate monotonic vs. EDF: judgment day
• Comments on ``Generalized rate monotonic schedulability bounds using relative period ratios
• Rate monotonic scheduling in hard real-time systems

This page was built for publication: Rate monotonic scheduling re-analysed

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