Correspondence article: a correction of the reduction-based schedulability analysis for APA scheduling

DOI10.1007/S11241-018-9315-XMaRDI QIDQ779431zbMATH OpenOpenAlexFDO

Authors Arpan Gujarati, Felipe Cerqueira, Björn B. Brandenburg, Geoffrey Nelissen

Publication date 13 July 2020

Published in Real-Time Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11241-018-9315-x

Mathematics Subject Classification ID

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

Recommendations

• Errata: A new algorithm for scheduling periodic, real-time tasks
• Erratum to: ``Machine scheduling with a general learning effect [Math. Comput. Modelling 51(1-2) (2010) 84-90]
• Corrigendum to: ``Solving the job-shop scheduling problem optimally by dynamic programming
• Commentary to: ``An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems
• Comments on ``Generalized rate monotonic schedulability bounds using relative period ratios

Cites work

• Multiprocessor real-time scheduling with arbitrary processor affinities: from practice to theory

This page was built for publication: Correspondence article: a correction of the reduction-based schedulability analysis for APA scheduling

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