Periodic real-time scheduling: From deadline-based model to latency-based model

DOI10.1007/S10479-007-0279-9MaRDI QIDQ940872zbMATH OpenOpenAlexFDO

Authors Liliana Cucu, Nicolas Pernet, Yves Sorel

Publication date 3 September 2008

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-007-0279-9

zbMATH Keywords

real-timeschedulingperiodicitylatencydeadlinenon-preemptive

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 4199942
• scientific article; zbMATH DE number 1196650
• Optimizing distributed real-time embedded system handling dependence and several strict periodicity constraints
• Real-time preemptive scheduling of sporadic tasks based on supervisory control of discrete event systems
• scientific article; zbMATH DE number 1949600

Cites work

• scientific article; zbMATH DE number 2084744 (Why is no real title available?)
• Parametric dispatching of hard real-time tasks
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Scheduling Periodic Tasks with Slack

Cited in

(6)

• Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems
• State-based scheduling with tree schedules: analysis and evaluation
• Beyond the weakly hard model: measuring the performance cost of deadline misses
• Latency vs precision: stability preserving perception scheduling
• Demystifying the real-time Linux scheduling latency
• Evaluation of the age latency of a real-time communicating system using the LET paradigm

This page was built for publication: Periodic real-time scheduling: From deadline-based model to latency-based model

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