Feasibility analysis under fixed priority scheduling with limited preemptions

DOI10.1007/S11241-010-9113-6zbMath1217.68043OpenAlexW2147657668MaRDI QIDQ554013

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)

Related Items (2)

Online and offline scheduling with cache-related preemption delays ⋮ Using non-preemptive regions and path modification to improve schedulability of real-time traffic over priority-based NOCs

Cites Work

• Measuring the performance of schedulability tests
• Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption
• Scheduling periodically occurring tasks on multiple processors
• Scheduling unit-time tasks with integer release times and deadlines
• Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
• On the complexity of fixed-priority scheduling of periodic, real-time tasks
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Unnamed Item

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