Rate monotonic vs. EDF: judgment day

DOI10.1023/B:TIME.0000048932.30002.D9zbMATH Open1097.68530OpenAlexW2111206806MaRDI QIDQ1780175FDOQ1780175

Authors: Giorgio C. Buttazzo 

Publication date: 7 June 2005

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

Full work available at URL: https://doi.org/10.1023/b:time.0000048932.30002.d9

Recommendations

• Performance guarantee for edf under overload
• scientific article; zbMATH DE number 1196650
• Partitioned EDF scheduling: a closer look
• Rate monotonic scheduling re-analysed
• On optimal lateness and tardiness scheduling in real-time systems

zbMATH Keywords

periodic taskearliest deadline first algorithm

Mathematics Subject Classification ID

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

Cited In (7)

• An earlier time for inserting and/or accelerating tasks
• Online and offline scheduling with cache-related preemption delays
• Verifying distributed real-time properties of embedded systems via graph transformations and model checking
• Implementation and evaluation of global and partitioned scheduling in a real-time OS
• Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling
• Garbage collection-aware utility accrual scheduling
• Bounding and shaping the demand of generalized mixed-criticality sporadic task systems

This page was built for publication: Rate monotonic vs. EDF: judgment day

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