Cache-Optimised Methods for the Evaluation of Elementary Functions

Abstract : The ratio between processor speed and memory speed frequently makes efficient use of cache memory a very important element in performance of user's application. This is the case for many elementary function algorithms. They commonly use tables, so that caches have a deep impact on speed. This paper discusses and quantifies the impact of cache usage over both major criteria in the evaluation of elementary functions: speed and accuracy.
Document type :
Reports
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal-lara.archives-ouvertes.fr/hal-02102051
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 9:12:57 AM
Last modification on : Sunday, April 28, 2019 - 1:23:00 AM

File

RR2002-38.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02102051, version 1

Collections

Citation

David Defour. Cache-Optimised Methods for the Evaluation of Elementary Functions. [Research Report] LIP RR-2002-38, Laboratoire de l'informatique du parallélisme. 2002, 2+12p. ⟨hal-02102051⟩

Share

Metrics

Record views

8

Files downloads

15