Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms
From MaRDI portal
Publication:497994
DOI10.1007/s11241-015-9233-0zbMath1337.68047OpenAlexW1022426812MaRDI QIDQ497994
Thomas Rothvoß, Robert I. Davis, Laurent George, Alan Burns, Oliver Gettings, Sanjoy K. Baruah
Publication date: 25 September 2015
Published in: Real-Time Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11241-015-9233-0
Related Items (2)
Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling ⋮ Exact speedup factors and sub-optimality for non-preemptive scheduling
Cites Work
- Unnamed Item
- Measuring the performance of schedulability tests
- Optimal priority assignment in the presence of blocking
- Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling
- Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption
- On priority assignment in fixed priority scheduling
- On non-preemptive scheduling of recurring tasks using inserted idle times
- The limited-preemptive feasibility of real-time tasks on uniprocessors
- A Deadline-Floor Inheritance Protocol for EDF Scheduled Embedded Real-Time Systems with Resource Sharing
- On the complexity of fixed-priority scheduling of periodic, real-time tasks
- Schedulability Analysis for Real-Time Systems with EDF Scheduling
- Priority inheritance protocols: an approach to real-time synchronization
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
This page was built for publication: Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms
