An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling

DOI10.1007/978-3-642-04128-0_39MaRDI QIDQ3639265zbMATH OpenOpenAlexFDO

Authors Andreas Karrenbauer, Thomas Rothvoß

Publication date 29 October 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04128-0_39

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks
• Utilization bounds for multiprocessor rate-monotonic scheduling
• Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach
• First fit decreasing scheduling on uniform multiprocessors
• scientific article; zbMATH DE number 1375583

Cited in

(3)

• Rate monotonic scheduling in hard real-time systems
• Open problems in real-time scheduling
• A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks

This page was built for publication: An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling

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