Maintaining the feasibility of hard real-time systems with a reduced number of priority levels

DOI10.1515/amcs-2015-0051zbMath1347.93177OpenAlexW2401375271MaRDI QIDQ326990

Nasro Min-Allah, Saleh Alrashed, Piotr Arabas, Muhammad Bilal Qureshi, Joanna Kolodziej

Publication date: 13 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-2015-0051

zbMATH Keywords

real-time systemsonline schedulingfixed-priority schedulingfeasibility analysisrate monotonic algorithm

Mathematics Subject Classification ID

Control/observation systems involving computers (process control, etc.) (93C83) Stochastic scheduling theory in operations research (90B36)

Cites Work

• On-line scheduling of scalable real-time tasks on multiprocessor systems.
• On priority assignment in fixed priority scheduling
• Sensitivity analysis for fixed-priority real-time systems
• On the complexity of fixed-priority scheduling of periodic, real-time tasks
• Fixed priority scheduling with limited priority levels
• Efficient Exact Schedulability Tests for Fixed Priority Real-Time Systems
• Distributed scheduling of sensor networks for identification of spatio-temporal processes
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maintaining the feasibility of hard real-time systems with a reduced number of priority levels