Efficient Exact Schedulability Tests for Fixed Priority Real-Time Systems

DOI10.1109/TC.2008.66zbMath1390.68122MaRDI QIDQ4564083

Alan Burns, Robert I. Davis, Attila Zabos

Publication date: 12 June 2018

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

Mathematics Subject Classification ID

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

Related Items (13)

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

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