Skip to Main content Skip to Navigation
Reports

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.
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/inria-00607323
Contributor : Mouad Bahi Connect in order to contact the contributor
Submitted on : Friday, July 8, 2011 - 4:52:00 PM
Last modification on : Thursday, July 8, 2021 - 3:48:48 AM
Long-term archiving on: : Monday, November 12, 2012 - 10:31:44 AM

File

bahi_revremat.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00607323, version 1

Collections

Citation

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

Share

Metrics

Record views

595

Files downloads

533