Trade-offs of certified fixed-point code synthesis for linear algebra basic blocks

Matthieu Martel 1 Mohamed Amine Najahi 2 Guillaume Revy 2
2 DALI - Digits, Architectures et Logiciels Informatiques
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, UPVD - Université de Perpignan Via Domitia
Abstract : In embedded systems, efficient implementations of numerical algorithms typically use the fixed-point arithmetic rather than the standardized and costly floating-point arithmetic. But, fixed-point programmers face two difficulties: First, writing fixed-point codes is tedious and error prone. Second, the low dynamic range of fixed-point numbers leads to the persistent belief that fixed-point computations are inherently inaccurate. In this article, we address these two limitations by introducing a methodology to design and implement tools that synthesize fixed-point programs. To strengthen the user's confidence in the synthesized code, analytic methods are presented to automatically assert its numerical quality. Furthermore, we use this framework to generate fixed-point code for linear algebra basic blocks such as matrix multiplication and inversion. For example, the former task involves trade-offs such as choosing to maximize the code's accuracy or minimize its size. For the two cases of matrix multiplication and inversion, we describe, implement, and experiment with several algorithms to find trade-offs between the conflicting goals.
Type de document :
Article dans une revue
Journal of Systems Architecture, Elsevier, 2016, 〈10.1016/j.sysarc.2016.11.010〉
Liste complète des métadonnées

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

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01279628
Contributeur : Guillaume Revy <>
Soumis le : vendredi 26 février 2016 - 16:32:30
Dernière modification le : mardi 10 octobre 2017 - 10:29:44
Document(s) archivé(s) le : dimanche 13 novembre 2016 - 04:27:17

Fichier

2016-FixedPointLinearAlgebra.p...
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Matthieu Martel, Mohamed Amine Najahi, Guillaume Revy. Trade-offs of certified fixed-point code synthesis for linear algebra basic blocks. Journal of Systems Architecture, Elsevier, 2016, 〈10.1016/j.sysarc.2016.11.010〉. 〈lirmm-01279628〉

Partager

Métriques

Consultations de
la notice

133

Téléchargements du document

235