Feasibility analysis under fixed priority scheduling with limited preemptions

DOI10.1007/S11241-010-9113-6MaRDI QIDQ554013zbMATH OpenOpenAlexFDO

Authors Gang Yao, Marko Bertogna, Giorgio C. Buttazzo

Publication date 29 July 2011

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

Full work available at URL https://doi.org/10.1007/s11241-010-9113-6

zbMATH Keywords

schedulability analysisfixed prioritylimited preemption scheduling

Mathematics Subject Classification ID

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

Recommendations

• The limited-preemptive feasibility of real-time tasks on uniprocessors
• An analysis of fixed-priority schedulability on a multiprocessor
• Exact speedup factors and sub-optimality for non-preemptive scheduling
• Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption
• A response-time analysis for non-preemptive job sets under global scheduling

Cites work

• scientific article; zbMATH DE number 45142 (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
• Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
• Scheduling periodically occurring tasks on multiple processors
• Scheduling unit-time tasks with integer release times and deadlines
• Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption

Cited in

(9)

• Exact speedup factors and sub-optimality for non-preemptive scheduling
• Improved cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems
• Delay composition in preemptive and non-preemptive real-time pipelines
• A response-time analysis for non-preemptive job sets under global scheduling
• Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption
• Online and offline scheduling with cache-related preemption delays
• Precautious-RM: a predictable non-preemptive scheduling algorithm for harmonic tasks
• The limited-preemptive feasibility of real-time tasks on uniprocessors
• Using non-preemptive regions and path modification to improve schedulability of real-time traffic over priority-based NOCs

This page was built for publication: Feasibility analysis under fixed priority scheduling with limited preemptions

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