Register Reverse Rematerialization

Mouad Bahi 1 Christine Eisenbeis 1
1 ALCHEMY - Architectures, Languages and Compilers to Harness the End of Moore Years
LRI - Laboratoire de Recherche en Informatique, UP11 - Université Paris-Sud - Paris 11, CNRS - Centre National de la Recherche Scientifique : UMR8623, Inria Saclay - Ile de France
Abstract : Reversible computing could be in more or less long term mandatory for minimizing heat dissipation inherent to computing. It aims at keeping all information on input and intermediate values available at any step of the computation. Rematerialization in register allocation amounts to recomputing values instead of spilling them in memory when registers run out. In this paper we detail a heuristic algorithm for performing reverse register materialization and we use the high memory demanding LQCD (Lattice Quantum ChromoDynamics) application to demonstrate that important gains of up to 33% on register pressure can be obtained. This in turn enables an increase in Instruction-Level Parallelism and Thread-Level Parallelism. We demonstrate a 16.8% (statically timed) gain over a basic LQCD computation. Basic ideas of the algorithm and experimental results were already presented in a poster of another conference.
Type de document :
Rapport
[Research Report] 2011
Liste complète des métadonnées

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

https://hal.inria.fr/inria-00607323
Contributeur : Mouad Bahi <>
Soumis le : vendredi 8 juillet 2011 - 16:52:00
Dernière modification le : jeudi 5 avril 2018 - 12:30:11
Document(s) archivé(s) le : lundi 12 novembre 2012 - 10:31:44

Fichier

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

Identifiants

  • HAL Id : inria-00607323, version 1

Collections

Citation

Mouad Bahi, Christine Eisenbeis. Register Reverse Rematerialization. [Research Report] 2011. 〈inria-00607323〉

Partager

Métriques

Consultations de la notice

492

Téléchargements de fichiers

321