A new sufficient schedulability analysis for hybrid scheduling

DOI10.1515/AMCS-2016-0047zbMath1347.90053OpenAlexW2525413221MaRDI QIDQ328917

Yanfeng Zhai, Fengxiang Zhang, Jianwei Liao

Publication date: 21 October 2016

Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/amcs-2016-0047

zbMATH Keywords

real-time systemspreemptive schedulingscheduling algorithmsschedulability analysisfixed priorityearliest deadline first

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Hybrid switching controller design for the maneuvering and transit of a training ship

Cites Work

• Robust sensor fault estimation for descriptor-LPV systems with unmeasurable gain scheduling functions: application to an anaerobic bioreactor
• Measuring the performance of schedulability tests
• Hard Real-Time Computing Systems
• On the complexity of fixed-priority scheduling of periodic, real-time tasks
• Efficient Exact Schedulability Tests for Fixed Priority Real-Time Systems
• Schedulability Analysis for Real-Time Systems with EDF Scheduling
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Unnamed Item

This page was built for publication: A new sufficient schedulability analysis for hybrid scheduling