Compile-Time Function Memoization - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

Compile-Time Function Memoization

Abstract

Memoization is the technique of saving the results of computations so that future executions can be omitted when the same inputs repeat. Recent work showed that memoization can be applied to dynamically linked pure functions using a load-time technique and results were encouraging for the demonstrated transcendental functions. A restriction of the proposed framework was that memo-ization was restricted only to dynamically linked functions and the functions must be determined beforehand. In this work, we propose function memoization using a compile-time technique thus extending the scope of memoization to user defined functions as well as making it transparently applicable to any dynamically linked functions. Our compile-time technique allows static linking of memo-ization code and this increases the benefit due to memoization by leveraging the inlining capability for the memoization wrapper. Our compile-time analysis can also handle functions with pointer parameters , and we handle constants more efficiently. Instruction set support can also be considered, and we propose associated hardware leading to additional performance gain.
Fichier principal
Vignette du fichier
memo.pdf (470.07 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01423811 , version 1 (31-12-2016)

Identifiers

  • HAL Id : hal-01423811 , version 1

Cite

Arjun Suresh, Erven Rohou, André Seznec. Compile-Time Function Memoization. 26th International Conference on Compiler Construction, Feb 2017, Austin, United States. ⟨hal-01423811⟩
533 View
1266 Download

Share

Gmail Facebook X LinkedIn More