Mixed-criticality scheduling with dynamic redistribution of shared cache

DOI10.4230/LIPICS.ECRTS.2017.18MaRDI QIDQ3300241zbMATH OpenOpenAlexFDO

Authors Muhammad Ali Awan, Konstantinos Bletsas, Benny Akesson, Eduardo Tovar, Pedro F. Souto

Publication date 28 July 2020

Full work available at URL https://arxiv.org/abs/1704.08876

zbMATH Keywords

cache-aware schedulingdynamic redistribution of shared cachemixed criticality schedulingshared last-level cache analysisVestal model

Mathematics Subject Classification ID

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

Abstract: The design of mixed-criticality systems often involvespainful tradeoffs between safety guarantees and performance.However, the use of more detailed architectural modelsin the design and analysis of scheduling arrangements for mixedcriticalitysystems can provide greater confidence in the analysis,but also opportunities for better performance. Motivated by thisview, we propose an extension of Vestal 19s model for mixedcriticalitymulticore systems that (i) accounts for the per-taskpartitioning of the last-level cache and (ii) supports the dynamicreassignment, for better schedulability, of cache portions initiallyreserved for lower-criticality tasks to the higher-criticalitytasks, when the system switches to high-criticality mode. Tothis model, we apply partitioned EDF scheduling with Ekbergand Yi 19s deadline-scaling technique. Our schedulability analysisand scalefactor calculation is cognisant of the cache resourcesassigned to each task, by using WCET estimates that take intoaccount these resources. It is hence able to leverage the dynamicreconfiguration of the cache partitioning, at mode change, forbetter performance, in terms of provable schedulability. We alsopropose heuristics for partitioning the cache in low- and highcriticalitymode, that promote schedulability. Our experimentswith synthetic task sets, indicate tangible improvements inschedulability compared to a baseline cache-aware arrangementwhere there is no redistribution of cache resources from low- tohigh-criticality tasks in the event of a mode change.

Recommendations

• Mixed-criticality scheduling with limited hi-criticality behaviors
• Mixed-criticality scheduling on multiprocessors
• Mixed-criticality scheduling of sporadic task systems
• Scheduling algorithm for mixed-criticality jobs based on dynamical demand boundary
• Preemptive uniprocessor scheduling of mixed-criticality sporadic task systems

Cited in

(7)

• Attacking the one-out-of-\(m\) multicore problem by combining hardware management with mixed-criticality provisioning
• A dynamic scheduler for the infinite air-cache
• Schedulability Analysis of Global Scheduling for Multicore Systems With Shared Caches
• Critical sizing of LRU caches with dependent requests
• FFOB: efficient online mode-switch procrastination in mixed-criticality systems
• Dynamic budget management and budget reclamation for mixed-criticality systems
• M-CASH: A real-time resource reclaiming algorithm for multiprocessor platforms

This page was built for publication: Mixed-criticality scheduling with dynamic redistribution of shared cache

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