Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption

DOI10.1007/s11241-009-9071-zzbMath1185.68106OpenAlexW2050243060MaRDI QIDQ1039302

Wim F. J. Verhaegh, Reinder J. Bril, Johan J. Lukkien

Publication date: 27 November 2009

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

Full work available at URL: https://doi.org/10.1007/s11241-009-9071-z

zbMATH Keywords

real-time systemsperiodic tasksfixed-priority schedulingworst-case response timedeferred preemptionlevel-\(i\) active periodlevel-\(i\) busy periodworst-case occupied time

Mathematics Subject Classification ID

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

Related Items

Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation, Using non-preemptive regions and path modification to improve schedulability of real-time traffic over priority-based NOCs, Improved response-time bounds in fixed priority scheduling with arbitrary deadlines, Exact speedup factors and sub-optimality for non-preemptive scheduling, Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms, Real-time uniprocessor scheduling with fewer preemptions, Feasibility analysis under fixed priority scheduling with limited preemptions, Independent WCRT analysis for individual priority classes in Ethernet AVB, Response-time analysis for fixed-priority systems with a write-back cache

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Specification and compositional verification of real-time systems
• Process algebra with timing
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment