A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks

DOI10.1007/978-3-642-18318-8_15zbMATH Open1314.68400OpenAlexW1506669171MaRDI QIDQ3075459FDOQ3075459

Authors: Andreas Karrenbauer, Thomas Rothvoß 

Publication date: 15 February 2011

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18318-8_15

Recommendations

• An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling
• Deadline-based scheduling of periodic task systems on multiprocessors.
• Scheduling independent multiprocessor tasks
• scientific article; zbMATH DE number 2185607
• Approximating Real-Time Scheduling on Identical Machines

Mathematics Subject Classification ID

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

Cited In (3)

• Title not available (Why is that?)
• Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors
• An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling

This page was built for publication: A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks

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