Errata: A new algorithm for scheduling periodic, real-time tasks
From MaRDI portal
Publication:1587777
DOI10.1007/S004530010048zbMATH Open0961.68019OpenAlexW2078738508MaRDI QIDQ1587777FDOQ1587777
Authors: Bala Kalyanasundaram, Kirk Pruhs, Eric Torng 
Publication date: 3 December 2000
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004530010048
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
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Nonnumerical algorithms (68W05)
Cited In (4)
- Laxity dynamics and LLF schedulability analysis on multiprocessor platforms
- 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
- 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)
