Minimizing cache usage with fixed-priority and earliest deadline first scheduling

DOI10.1007/S11241-024-09423-7MaRDI QIDQ7029099zbMATH OpenFDO

Authors Binqi Sun, Tomasz Kloda, Sergio García, Giovani Gracioli, Marco Caccamo

Publication date 11 February 2025

Published in Real-Time Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

real-time systemsnon-preemptive schedulingpreemptive schedulingcache partitioning

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites work

• An <sc>fptas</sc> for Response Time Analysis of Fixed Priority Real-Time Tasks with Resource Augmentation
• Cutting-plane algorithms for preemptive uniprocessor scheduling problems
• Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling
• Improved cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems
• Measuring the performance of schedulability tests
• Rate monotonic vs. EDF: judgment day
• Schedulability Analysis of Global Scheduling for Multicore Systems With Shared Caches
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: Minimizing cache usage with fixed-priority and earliest deadline first scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7029099)