Paper Info
Title
Using Dynamic, Full Cache Locking and Genetic Algorithms for Cache Size Minimization in Multitasking, Preemptive, Real-Time Systems.
Abstract
Cache locking have shown during the last years their usefulness easing the schedulability analysis of multitasking, preemptive, real-time systems. Cache locking provides a high degree of predictability while system performance is maintained at a similar level to that provided by regular, highly unpredictable, non-locked cache. Cache locking may also be useful to reduce hardware costs by means of reducing the size of the cache memory needed to make a real-time system schedulable. This work shows how full, dynamic cache locking may help to reduce the size of the cache memory versus a regular cache. This reduction is possible thanks to a genetic algorithm that selects the set of instructions that have to be locked in cache to provide the maximum cache size minimization while keeping the system schedulable.
Year
DOI
Venue
2013
10.1007/978-3-642-45008-2_13
Lecture Notes in Computer Science
Keywords
Field
DocType
Genetic algorithm,Real-Time Systems,Cache Locking,schedulability analysis,cost-saving
Cache-oblivious algorithm,Cache invalidation,Cache pollution,CPU cache,Computer science,Cache,Parallel computing,Real-time computing,Cache algorithms,Cache coloring,Smart Cache
Conference
Volume
ISSN
Citations 
8273
0302-9743
0
PageRank 
References 
Authors
0.34
11
3
Name
Order
Citations
PageRank
Antonio Martí Campoy175.02
Francisco Rodríguez-Ballester232.46
Rafael Ors Carot301.69