Analysis of window-constrained execution time systems
DOI10.1007/S11241-006-9004-ZzbMATH Open1113.68028DBLPjournals/rts/BalbastreRC07OpenAlexW1983276715WikidataQ57591167 ScholiaQ57591167MaRDI QIDQ862987FDOQ862987
Authors: Patricia Balbastre, Ismael Ripoll, Alfons Crespo
Publication date: 25 January 2007
Published in: Real-Time Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11241-006-9004-z
Recommendations
- Sensitivity analysis for fixed-priority real-time systems
- Feasibility analysis of sporadic real-time multiprocessor task systems
- Feasibility analysis of sporadic real-time multiprocessor task systems
- The feasibility of general task systems with precedence constraints on multiprocessor platforms
- Sensitivity analysis of arbitrary deadline real-time systems with EDF scheduling
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- A note on preemptive scheduling of periodic, real-time tasks
- Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems
- A dynamic priority assignment technique for streams with (m, k)-firm deadlines
- Analysis of window-constrained execution time systems
Cited In (3)
This page was built for publication: Analysis of window-constrained execution time systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q862987)