Real-time uniprocessor scheduling with fewer preemptions

DOI10.1007/S00607-017-0562-9zbMath1380.68078OpenAlexW2733078774MaRDI QIDQ682422

Jinkyu Lee

Publication date: 2 February 2018

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-017-0562-9

zbMATH Keywords

real-time schedulingEDF (earliest deadline first)fewer preemptionsRM (rate monotonic)uniprocessor systems

Mathematics Subject Classification ID

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

Cites Work

• Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption
• Minimum energy consumption for rate monotonic scheduled tasks
• Preempt a Job or Not in EDF Scheduling of Uniprocessor Systems
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: Real-time uniprocessor scheduling with fewer preemptions