Online and offline scheduling with cache-related preemption delays
From MaRDI portal
Publication:1616848
DOI10.1007/S11241-017-9275-6zbMath1398.68075OpenAlexW2617800276MaRDI QIDQ1616848
Guillaume Phavorin, Thomas Chapeaux, Laurent George, Joël Goossens, Pascal Richard, Claire Maiza
Publication date: 7 November 2018
Published in: Real-Time Systems (Search for Journal in Brave)
Full work available at URL: https://dipot.ulb.ac.be/dspace/bitstream/2013/250125/3/PRGMGC17.pdf
mathematical programmingsustainabilityonline schedulingoffline scheduling\textsc{edf}\textsc{rm}CRPDpreemption delays
Related Items (1)
Cites Work
- Improved cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems
- Feasibility analysis under fixed priority scheduling with limited preemptions
- Measuring the performance of schedulability tests
- Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible
- Online and offline scheduling with cache-related preemption delays
- Rate monotonic vs. EDF: judgment day
- Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation
- Hard Real-Time Computing Systems
- Analysis of cache-related preemption delay in fixed-priority preemptive scheduling
- Preempt a Job or Not in EDF Scheduling of Uniprocessor Systems
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
This page was built for publication: Online and offline scheduling with cache-related preemption delays
