Sensitivity analysis of arbitrary deadline real-time systems with EDF scheduling
From MaRDI portal
Publication:554014
DOI10.1007/S11241-011-9124-YzbMATH Open1217.68044OpenAlexW1964220910MaRDI QIDQ554014FDOQ554014
Authors: Fengxiang Zhang, Alan Burns, Sanjoy K. Baruah
Publication date: 29 July 2011
Published in: Real-Time Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11241-011-9124-y
Recommendations
- Sensitivity analysis for fixed-priority real-time systems
- An analysis of global \texttt{EDF} schedulability for arbitrary-deadline sporadic task systems
- On optimal lateness and tardiness scheduling in real-time systems
- Sensitivity analysis of scheduling algorithms
- scientific article; zbMATH DE number 1196650
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computer system organization (68M99)
Cites Work
- A note on preemptive scheduling of periodic, real-time tasks
- Schedulability Analysis for Real-Time Systems with EDF Scheduling
- Sensitivity analysis for fixed-priority real-time systems
- The space of EDF deadlines: The exact region and a convex approximation
- Analysis of window-constrained execution time systems
Cited In (6)
- Sensitivity analysis for fixed-priority real-time systems
- Title not available (Why is that?)
- The space of EDF deadlines: The exact region and a convex approximation
- Analysis of window-constrained execution time systems
- On the nature and impact of self-similarity in real-time systems
- Sensitivity analysis of complex embedded real-time systems
Uses Software
This page was built for publication: Sensitivity analysis of arbitrary deadline real-time systems with EDF scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q554014)