Lowest priority first based feasibility analysis of real-time systems
From MaRDI portal
Publication:897377
DOI10.1016/J.JPDC.2013.03.016zbMATH Open1327.68047OpenAlexW2099071274MaRDI QIDQ897377FDOQ897377
Authors: Nasro Min-Allah, Xiuli Wang, Albert Y. Zomaya, 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
Recommendations
- Feasibility analysis of sporadic real-time multiprocessor task systems
- Feasibility analysis of sporadic real-time multiprocessor task systems
- An analysis of fixed-priority schedulability on a multiprocessor
- An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems
- Liu and Layland's schedulability test revisited
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Cites Work
- On priority assignment in fixed priority scheduling
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- On the complexity of fixed-priority scheduling of periodic, real-time tasks
- Efficient Exact Schedulability Tests for Fixed Priority Real-Time Systems
- New strategies for assigning real-time tasks to multiprocessor systems
- Machine scheduling with job class setup and delivery considerations
- Utilization bound for periodic task set with composite deadline
- Title not available (Why is that?)
- Power efficient rate monotonic scheduling for multi-core systems
- Preemptive scheduling in overloaded systems.
- Efficient Exact Test for Rate-Monotonic Schedulability Using Large Period-Dependent Initial Values
Cited In (2)
This page was built for publication: Lowest priority first based feasibility analysis of real-time systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897377)
