Rate monotonic vs. EDF: judgment day
From MaRDI portal
Publication:1780175
DOI10.1023/B:TIME.0000048932.30002.D9zbMath1097.68530OpenAlexW2111206806MaRDI QIDQ1780175
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
Related Items (6)
Online and offline scheduling with cache-related preemption delays ⋮ An earlier time for inserting and/or accelerating tasks ⋮ Verifying distributed real-time properties of embedded systems via graph transformations and model checking ⋮ Garbage collection-aware utility accrual scheduling ⋮ Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic 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
