Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling

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

zbMATH Keywords

real-timeEDFearliest deadline firstuniprocessorsub-optimalityprocessor speedup factorconstrained deadlinefixed priority preemptive schedulingimplicit deadlineomega constant

Mathematics Subject Classification ID

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

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

• Unnamed Item
• Measuring the performance of schedulability tests
• On the complexity of fixed-priority scheduling of periodic, real-time tasks
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling