A Comparison of Three Genetic Algorithms for Locking-Cache Contents Selection in Real-Time Systems.

Locking caches, providing full determinism and good performance, are a very interesting solution to replacing conventional caches in real-time systems. In such systems, temporal correctness must be guaranteed. The use of predictable components, like locking caches, helps the system designer to determine if all the tasks will meet its deadlines. However, when locking caches are used in a static manner, the system performance depends on the instructions loaded and locked in cache. The selection of these instructions may be accomplished through a genetic algorithm. This paper shows the impact of the fitness function in the final performance provided by the real-time system. Three fit- ness functions have been evaluated, showing differences in the utilisation and performance obtained. [ABSTRACT FROM AUTHOR]