The Concept of Unschedulability Core for Optimizing Real-Time Systems with Fixed-Priority Scheduling

DOI10.1109/TC.2018.2878835MaRDI QIDQ5228973zbMATH OpenOpenAlexFDO

Authors Yecheng Zhao, Haibo Zeng

Publication date 13 August 2019

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

Full work available at URL https://doi.org/10.1109/tc.2018.2878835

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• The concept of maximal unschedulable deadline assignment for optimization in fixed-priority scheduled real-time systems
• Real-time uniprocessor scheduling with fewer preemptions
• Generalizing fixed-priority scheduling for better schedulability in mixed-criticality systems
• Schedulability analysis of non-preemptive strictly periodic tasks in multi-core real-time systems
• Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling
• Preemptive uniprocessor scheduling of mixed-criticality sporadic task systems
• Scheduling with uncertain processing times in mixed-criticality systems
• Scheduling of computational processes in real-time distributed systems with uncertain task execution times

Cited in

(2)

• The concept of maximal unschedulable deadline assignment for optimization in fixed-priority scheduled real-time systems
• Design optimization for real-time systems with sustainable schedulability analysis

This page was built for publication: The Concept of Unschedulability Core for Optimizing Real-Time Systems with Fixed-Priority Scheduling

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