Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling
From MaRDI portal
Publication:1033671
DOI10.1007/s11241-009-9079-4zbMath1184.68121OpenAlexW2078375802MaRDI QIDQ1033671
Alan Burns, Robert I. Davis, Thomas Rothvoß, Sanjoy K. Baruah
Publication date: 10 November 2009
Published in: Real-Time Systems (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.175.6646
real-timeEDFearliest deadline firstuniprocessorsub-optimalityprocessor speedup factorconstrained deadlinefixed priority preemptive schedulingimplicit deadlineomega constant
Related Items (7)
Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling ⋮ Exact speedup factors and sub-optimality for non-preemptive scheduling ⋮ Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling ⋮ Power efficient rate monotonic scheduling for multi-core systems ⋮ Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms ⋮ Real-time scheduling with resource sharing on heterogeneous multiprocessors ⋮ The limited-preemptive feasibility of real-time tasks on uniprocessors
Cites Work
This page was built for publication: Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling