Automatic Generation of Fast and Certified Code for Polynomial Evaluation - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

Automatic Generation of Fast and Certified Code for Polynomial Evaluation

(1) , (2)
1
2

Abstract

Designing an efficient floating-point implementation of a function based on polynomial evaluation requires being able to find an accurate enough evaluation program, exploiting at most the target architecture features. This article introduces CGPE, a tool dealing with the generation of fast and certified codes for the evaluation of bivariate polynomials. First we discuss the issue underlying the evaluation scheme combinatorics before giving an overview of the CGPE tool. The approach we propose consists in two steps: the generation of evaluation schemes by using some heuristics so as to quickly find some of low latency; and the selection that mainly consists in automatically checking their scheduling on the given target and validating their accuracy. Then, we present on-going development and ideas for possible improvements of the whole process. Finally, we illustrate the use of CGPE on some examples, and show how it allows us to generate fast and certified codes in a few seconds and thus to reduce the development time of libms like FLIP.
Fichier principal
Vignette du fichier
MouRev11.pdf (190.44 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

ensl-00531721 , version 1 (03-11-2010)

Identifiers

Cite

Christophe Mouilleron, Guillaume Revy. Automatic Generation of Fast and Certified Code for Polynomial Evaluation. ARITH: Computer Arithmetic, Jul 2011, Tübingen, Germany. pp.233-242, ⟨10.1109/ARITH.2011.39⟩. ⟨ensl-00531721⟩
337 View
440 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More