Lowest priority first based feasibility analysis of real-time systems

DOI10.1016/j.jpdc.2013.03.016zbMath1327.68047OpenAlexW2099071274MaRDI QIDQ897377

Albert Y. Zomaya, Xiuli Wang, Nasro Min-Allah, Samee Ullah Khan

Publication date: 18 December 2015

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2013.03.016

zbMATH Keywords

real-time systemsfixed-priority schedulingfeasibility analysisonline schedulability

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Utilization bound for periodic task set with composite deadline
• Power efficient rate monotonic scheduling for multi-core systems
• Preemptive scheduling in overloaded systems.
• On priority assignment in fixed priority scheduling
• Machine scheduling with job class setup and delivery considerations
• On the complexity of fixed-priority scheduling of periodic, real-time tasks
• New strategies for assigning real-time tasks to multiprocessor systems
• Efficient Exact Schedulability Tests for Fixed Priority Real-Time Systems
• Efficient Exact Test for Rate-Monotonic Schedulability Using Large Period-Dependent Initial Values
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: Lowest priority first based feasibility analysis of real-time systems