Predictable Binary Code Cache: A First Step Towards Reconciling Predictability and Just-In-Time Compilation

Adnan Bouakaz 1 Isabelle Puaut 2 Erven Rohou 2
1 ESPRESSO - Synchronous programming for the trusted component-based engineering of embedded systems and mission-critical systems
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
2 ALF - Amdahl's Law is Forever
Inria Rennes – Bretagne Atlantique , IRISA-D3 - ARCHITECTURE
Abstract : Virtualization and just-in-time (JIT) compilation have become important paradigms in computer science to address application portability issues without deteriorating average-case performance. Unfortunately, JIT compilation raises predictability issues, which currently hinder its dissemination in real-time applications. Our work aims at reconciling the two domains, i.e. taking advantage of the portability and performance provided by JIT compilation, while providing predictability guarantees. As a first step towards this ambitious goal, we study two structures of code caches and demonstrate their predictability. On the one hand, the studied binary code caches avoid too frequent function recompilations, providing good average-case performance. On the other hand, and more importantly for the system determinism, we show that the behavior of the code cache is predictable: a safe upper bound of the number of function recompilations can be computed, enabling the verification of timing constraints. Experimental results show that fixing function addresses in the binary cache ahead of time results in tighter Worst Case Execution Times (WCETs) than organizing the binary code cache in fixed-size blocks replaced using a Least Recently Used (LRU) policy.
Type de document :
Communication dans un congrès
The 17th IEEE Real-Time and Embedded Technology and Applications Symposium, Apr 2011, Chicago, United States. 2011
Liste complète des métadonnées

Littérature citée [24 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00589690
Contributeur : Erven Rohou <>
Soumis le : samedi 30 avril 2011 - 15:53:22
Dernière modification le : mardi 16 janvier 2018 - 15:54:17
Document(s) archivé(s) le : dimanche 31 juillet 2011 - 02:29:01

Fichier

RTAS2011.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00589690, version 1

Citation

Adnan Bouakaz, Isabelle Puaut, Erven Rohou. Predictable Binary Code Cache: A First Step Towards Reconciling Predictability and Just-In-Time Compilation. The 17th IEEE Real-Time and Embedded Technology and Applications Symposium, Apr 2011, Chicago, United States. 2011. 〈inria-00589690〉

Partager

Métriques

Consultations de la notice

413

Téléchargements de fichiers

94