The concept of maximal unschedulable deadline assignment for optimization in fixed-priority scheduled real-time systems

DOI10.1007/s11241-019-09332-0zbMath1436.68076OpenAlexW2917011949MaRDI QIDQ779461

Haibo Zeng, Yecheng Zhao

Publication date: 13 July 2020

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

Full work available at URL: https://doi.org/10.1007/s11241-019-09332-0

zbMATH Keywords

design optimizationaverage worst-case response timemaximal unschedulable deadline assignment (MUDA)schedulability condition abstraction

Mathematics Subject Classification ID

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

Cites Work

• Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
• Flexible hard real-time scheduling for deliberative AI systems
• On priority assignment in fixed priority scheduling
• Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems
• Efficient Exact Schedulability Tests for Fixed Priority Real-Time Systems
• An Efficient Formulation of the Real-Time Feasibility Region for Design Optimization
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: The concept of maximal unschedulable deadline assignment for optimization in fixed-priority scheduled real-time systems