Efficient Exact Schedulability Tests for Fixed Priority Real-Time Systems

DOI10.1109/TC.2008.66MaRDI QIDQ4564083zbMATH OpenFDO

Authors Robert I. Davis, Attila Zabos, Alan Burns

Publication date 12 June 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.2008.66

Mathematics Subject Classification ID

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

Cited in

(15)

• Improved response-time bounds in fixed priority scheduling with arbitrary deadlines
• An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems
• A survey of real-time scheduling on multiprocessor systems
• Determining rate monotonic schedulability of real-time periodic tasks using continued fractions
• A fault-tolerant time-triggered scheduling algorithm of mixed-criticality systems
• Exact polynomial time algorithm for the response time analysis of harmonic tasks
• An efficient schedulability analysis for optimizing systems with adaptive mixed-criticality scheduling
• Schedulability analysis of fixed-priority systems using timed automata
• Response time analysis for fixed priority real-time systems with energy-harvesting
• Cache related pre-emption delays in hierarchical scheduling
• Maintaining the feasibility of hard real-time systems with a reduced number of priority levels
• A new sufficient schedulability analysis for hybrid scheduling
• An Efficient Test Method for Rate Monotonic Schedulability
• The concept of maximal unschedulable deadline assignment for optimization in fixed-priority scheduled real-time systems
• Lowest priority first based feasibility analysis of real-time systems

This page was built for publication: Efficient Exact Schedulability Tests for Fixed Priority Real-Time Systems

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