Exact speedup factors and sub-optimality for non-preemptive scheduling
From MaRDI portal
Publication:1698782
DOI10.1007/s11241-017-9294-3zbMath1425.68045OpenAlexW2766687947MaRDI QIDQ1698782
Abhilash Thekkilakattil, Radu Dobrin, Sasikumar Punnekkat, Jian-Jia Chen, Robert I. Davis, Oliver Gettings
Publication date: 16 February 2018
Published in: Real-Time Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11241-017-9294-3
preemptive schedulingreal-timefixed prioritynon-preemptive schedulingEDFresource augmentationspeedup factoruniprocessorsub-optimality
Related Items (2)
Exact speedup factors and sub-optimality for non-preemptive scheduling ⋮ Narrowing the speedup factor gap of partitioned EDF
Cites Work
- Unnamed Item
- Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling
- Improved cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems
- Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms
- Measuring the performance of schedulability tests
- 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
- Exact speedup factors and sub-optimality for non-preemptive scheduling
- 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
- Speed is as powerful as clairvoyance
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
This page was built for publication: Exact speedup factors and sub-optimality for non-preemptive scheduling
