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

DOI10.1007/S11241-009-9079-4MaRDI QIDQ1033671zbMATH OpenOpenAlexFDO

Authors Robert I. Davis, Thomas Rothvoß, Sanjoy K. Baruah, Alan Burns

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

constrained deadlineearliest deadline firstEDFfixed priority preemptive schedulingimplicit deadlineomega constantprocessor speedup factorreal-timesub-optimalityuniprocessor

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1688367
• Exact speedup factors and sub-optimality for non-preemptive scheduling
• Preemptive Scheduling of Uniform Processor Systems
• An analysis of fixed-priority schedulability on a multiprocessor
• Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints
• Optimal Preemptive Scheduling of Two Unrelated Processors
• Real-time uniprocessor scheduling with fewer preemptions
• Preemptive uniprocessor scheduling of mixed-criticality sporadic task systems
• A new formulation for scheduling unrelated processor under precedence constraints
• Multiprocessor scheduling under precedence constraints: polyhedral results

Cites work

• scientific article; zbMATH DE number 1306855 (Why is no real title available?)
• 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

Cited in

(11)

• Exact speedup factors and sub-optimality for non-preemptive scheduling
• Real-time scheduling with resource sharing on heterogeneous multiprocessors
• The limited-preemptive feasibility of real-time tasks on uniprocessors
• Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation
• SPT is optimally competitive for uniprocessor flow
• Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling
• On the pitfalls of resource augmentation factors and utilization bounds in real-time scheduling
• Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling
• Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms
• The Concept of Unschedulability Core for Optimizing Real-Time Systems with Fixed-Priority Scheduling
• Power efficient rate monotonic scheduling for multi-core systems

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

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