An Efficient Test Method for Rate Monotonic Schedulability

DOI10.1109/TC.2012.296zbMATH Open1364.68119OpenAlexW2100090038MaRDI QIDQ5268219FDOQ5268219

Moonju Park, Heemin Park

Publication date: 20 June 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.2012.296

Mathematics Subject Classification ID

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

Cited In (1)

• Determining rate monotonic schedulability of real-time periodic tasks using continued fractions

   Recommendations

• Title not available (Why is that?) 👍 👎
• Rate monotonic schedulability tests using period-dependent conditions 👍 👎
• Efficient Exact Test for Rate-Monotonic Schedulability Using Large Period-Dependent Initial Values 👍 👎
• Rate monotonic scheduling re-analysed 👍 👎
• Rate-monotonic scheduling for hard-real-time systems 👍 👎
• Generalized rate monotonic schedulability bounds using relative period ratios 👍 👎
• Rate monotonic scheduling in hard real-time systems 👍 👎
• Efficient Exact Schedulability Tests for Fixed Priority Real-Time Systems 👍 👎
• Determining rate monotonic schedulability of real-time periodic tasks using continued fractions 👍 👎

This page was built for publication: An Efficient Test Method for Rate Monotonic Schedulability

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