Utilization bound for periodic task set with composite deadline

DOI10.1016/J.COMPELECENG.2010.04.003zbMath1210.68039OpenAlexW2068701091MaRDI QIDQ612769

Yongji Wang, Jiansheng Xing, Ishtiaq Ali, Nasro Min-Allah

Publication date: 29 December 2010

Published in: Computers and Electrical Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.compeleceng.2010.04.003

zbMATH Keywords

real-time systemsfixed-priority schedulingfeasibility analysisonline schedulabilitypreemptive real-time scheduling

Mathematics Subject Classification ID

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

Related Items (2)

Lowest priority first based feasibility analysis of real-time systems ⋮ Power efficient rate monotonic scheduling for multi-core systems

This page was built for publication: Utilization bound for periodic task set with composite deadline