Errata: A new algorithm for scheduling periodic, real-time tasks
From MaRDI portal
Publication:1587777
Recommendations
- Commentary to: ``An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems
- Liu and Layland's schedulability test revisited
- 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
- A new algorithm for scheduling periodic, real-time tasks
Cited in
(4)- Correspondence article: a correction of the reduction-based schedulability analysis for APA scheduling
- Commentary to: ``An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems
- Laxity dynamics and LLF schedulability analysis on multiprocessor platforms
- A counter-example to: ``Sticky-ERfair: a task-processor affinity aware proportional fair scheduler
This page was built for publication: Errata: A new algorithm for scheduling periodic, real-time tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587777)