Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems
From MaRDI portal
Publication:4589529
DOI10.1109/TC.2007.70787zbMATH Open1373.68150OpenAlexW2143176410WikidataQ57591155 ScholiaQ57591155MaRDI QIDQ4589529FDOQ4589529
Patricia Balbastre, Ismael Ripoll, Alfons Crespo
Publication date: 10 November 2017
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.2007.70787
Recommendations
- Minimal schedulability interval for real-time systems of periodic tasks with offsets
- Minimum and maximum delay problems in real-time systems
- A performance analysis of minimum laxity and earliest deadline scheduling in a real-time system
- Dynamic- and static-priority scheduling of recurring real-time tasks
- scientific article; zbMATH DE number 986997
- scientific article
- Deadline-based scheduling of periodic task systems on multiprocessors.
- Optimal priority assignment for aperiodic tasks with firm deadlines in fixed priority pre-emptive systems
- Periodic real-time scheduling: From deadline-based model to latency-based model
Cited In (5)
- A performance analysis of minimum laxity and earliest deadline scheduling in a real-time system
- The space of EDF deadlines: The exact region and a convex approximation
- Analysis of window-constrained execution time systems
- Partitioned EDF scheduling for multiprocessors using a \(C=D\) task splitting scheme
- Scheduling periodic and aperiodic tasks with time, energy harvesting and precedence constraints on multi-core systems
This page was built for publication: Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589529)