DALI: Digits, architectures et logiciels informatiques

L’équipe DALI développe une thématique de recherche unifiée afin d’améliorer la qualité numérique et la haute performance des calculs.  DALI permet l’interaction, rare en France au sein d’une même équipe, d’experts en micro-architecture et en arithmétique des ordinateurs.
Côté performances, nos travaux portent sur l’exploitation du potentiel de calcul toujours croissant des processeurs : élargissement des chemins (micro-architecture vectorielle), multiplication des cœurs (parallélisme de tâches), augmentation du parallélisme d’instructions. Côté arithmétique, la qualité numérique des applications de calcul  scientifique et la sûreté de fonctionnement d’applications embarquées dépendent crucialement de la maîtrise de la précision finie et de l’arithmétique flottante en particulier. Il s’agit de contrôler et certifier les calculs (algorithmes, codes) mais aussi d’optimiser la précision des résultats. De nombreux logiciels, scientifiques ou embarqués, nécessitent d’améliorer la qualité numérique sans pour autant sacrifier la rapidité d’exécution.  Ainsi se rejoignent amélioration de la performance et de la qualité numérique.

Membres

Permanents

Non permanents

Thématiques de recherche

La cohérence thématique des travaux de recherche sur l’amélioration de la qualité et de la performance des calculs est une des forces de l’équipe DALI.

L’amélioration de la performance des calculs est étroitement liée aux améliorations apportées aux micro-architectures. Celle-ci est réalisée suivant plusieurs directions, par élargissement des chemins (micro-architecture vectorielle), multiplication des cœurs (parallélisme de tâches), ou encore augmentation du parallélisme d’instructions (ILP). La qualité numérique des applications de calcul scientifique ou la sûreté de fonctionnement d’applications embarquées critiques dépendent crucialement de la maîtrise des effets de la précision finie des calculs — et de l’arithmétique flottante en particulier. Il s’agit alors de contrôler et valider les calculs (algorithmes, codes) mais aussi d’améliorer et optimiser la précision des calculs et des résultats.

Les travaux développés sur la période 2008-2013 sont organisés autour de 4 actions de recherche :

  • Action 1. Mesure reproductible et analyse du potentiel de parallélisme et des performances.
  • Action 2. Meilleure exploitation des nouvelles architectures multicœurs.
  • Action 3. Implantation sûre et efficace de protocoles cryptographiques.
  • Action 4. Synthèse de code pour l’implémentation de calculs précis, rapides et certifiés.

Faits marquants

  • Intégration de l’équipe DALI au LIRMM le 1er janvier 2011.
  • Organisation de 4 manifestations scientifiques : 17th Static Analysis Symposium (SAS’10), Ecole thématique Archi’11, Rencontres Arithmétique et Informatique Mathématique (RAIM’11), Ecole jeunes chercheurs du GDR Informatique Mathématique (EJCIM’13).
  • Obtention du Prix « chercheur d’avenir » de la région Languedoc-Roussillon en 2010.
  • Best Poster Award DASIP’2012, Karlsruhe, Germany.
  • Inclusion d’une bibliothèque de calcul par intervalles au SDK CUDA de NVidia.

Partenariats et collaborations académiques

Partenaires industriels : Actility, Airbus, Inpixal, Prover, Rockwell-Collins, Thales, Total.
Projets collaboratifs : ANR Blanc EvaFlo (2006-2010), Projet DPAC MASSANE (2007-2010), ANR ARPEGE (2009-2011), Projet FNRAE SARDANES (2009-2012), Projet Chercheur d’avenir Compil’HD (2010-2012), ANR INS DEFIS (2011-2014), ANR INS CAFEIN (2012-2015), PEPS QUARENUM (2013).

Collaborations nationales : CEA-LIST, ENSTA, EXASCALE, IRISA, LIENS, LIP, LIP6, LRI, LSIS, ONERA.
Collaborations internationales : Universitat de Girona, Technical University Hamburg, University of Malaysia Sabah, Mississippi State University, Microsoft Research Redmond, Rice University, Tokyo WCU, University of Waterloo (Canada), University of Wollongong, University of Waseda.

Publications majeures

  • Bernard Goossens and David Parello, Limits of Instruction-Level Parallelism Capture, International Conference on Computational Science (ALCHEMY Workshop), 2013, to appear.
  • Stef Graillat, Philippe Langlois, and Nicolas Louvet. Algorithms for accurate, validated and fast computations with polynomials. Japan Journal of Industrial and Applied Mathematics, 26(2,3):191-214, 2009.
  • Sylvain Collange, Marc Daumas and David Defour, Interval Arithmetic, in GPU Computing Gems, Jade Edition, ISBN 978-0-12-385963-1, 2011.
  • Anwar Hasan, Nicolas Meloni, Ashkan Namin, and Christophe Negre,Block Recombination Approach for Subquadratic Space Complexity Binary Field Multiplication based on Toeplitz Matrix-Vector Product ,IEEE Transactions on Computers, Vol 61(2), pages 151-163, 2012.
  • Arnault Ioualalen and Matthieu Martel, A New Abstract Domain for the Representation of Mathematically Equivalent Expressions, Static Analysis Symposium, SAS'12, Lecture Notes in Computer Science, Volume 7460, pages 75-93, Springer-Verlag, 2012.
  • Claude-Pierre Jeannerod, Hervé Knochel, Christophe Monat, and Guillaume Revy, Computing floating-point square roots via bivariate polynomial evaluation, IEEE Transactions on Computers, Vol. 60(2), pages 214-227, February 2011.

Publications depuis 2013 - Evaluation 2019

Articles de revues internationales

2017

  1. Automatic source-to-source error compensation of floating-point programs: code synthesis to optimize accuracy and time
    Laurent Thévenoux, Philippe Langlois, Matthieu Martel
    Concurrency and Computation: Practice and Experience, Wiley, 2017, Concurrency and Computation: Practice and Experience, 29 (7), pp.e3953.
  2. Computing On Many Cores
    Bernard Goossens, David Parello, Katarzyna Porada, Djallal Rahmoune
    Concurrency and Computation: Practice and Experience, Wiley, 2017. <10.1002/cpe.4120>
  3. Midpoint-Radius Interval-based Method to Deal with Uncertainty in Power Flow Analysis
    Manuel Marin, Federico Milano, David Defour
    Electric Power Systems Research, Elsevier, 2017, to appear.
  4. Exact Lookup Tables for the Evaluation of Trigonometric and Hyperbolic Functions
    Hugues De Lassus Saint-Geniès, David Defour, Guillaume Revy
    IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2017, 66 (12), pp.2058-2071.

2016

  1. Trade-offs of certified fixed-point code synthesis for linear algebra basic blocks
    Matthieu Martel, Mohamed Amine Najahi, Guillaume Revy
    Journal of Systems Architecture, Elsevier, 2016. <10.1016/j.sysarc.2016.11.010>
  2. An efficient representation format for fuzzy intervals based on symmetric membership functions
    Manuel Marin, David Defour, Federico Milano
    ACM Transactions on Mathematical Software, Association for Computing Machinery, 2016, 43 (3), pp.23:1--23:22.
  3. A software scheduling solution to avoid corrupted units on GPUs
    David Defour, Eric Petit
    Journal of Parallel and Distributed Computing, Elsevier, 2016, 90-91, pp.1--8.
  4. Efficient Regular Modular Exponentiation Using Multiplicative Half-Size Splitting
    Christophe Negre, Thomas Plantard
    Journal of Cryptographic Engineering, Springer, 2016. <10.1007/s13389-016-0134-5>

2015

  1. Numerical Reproducibility for the Parallel Reduction on Multi- and Many-Core Architectures
    Sylvain Collange, David Defour, Stef Graillat, Roman Iakymchuk
    Parallel Computing, Elsevier, 2015, 49, pp.83-97.
  2. New Parallel Approaches for Scalar Multiplication in Elliptic Curve over Fields of Small Characteristic
    Christophe Negre, Jean-Marc Robert
    IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2015, 64 (10), pp.2875-2890.

2014

  1. Efficient Subquadratic Space Complexity Binary Polynomial Multipliers Based On Block Recombination
    Murat Cenk, Anwar Hasan, Christophe Negre
    IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2014, 63 (9), pp.2273-2287.
  2. First steps towards more numerical reproducibility
    Fabienne Jézéquel, Philippe Langlois, Nathalie Revol
    ESAIM: Proceedings and Surveys, EDP Sciences, 2014, ESAIM: Proceedings and Surveys, 45, pp.229-238.
  3. Efficient Binary Polynomial Multiplication Based on Optimized Karatsuba Reconstruction
    Christophe Negre
    Journal of Cryptographic Engineering, Springer, 2014, 4 (2), pp.91--106.
  4. A Fast Chaos-Based Pseudo-Random Bit Generator Using Binary64 Floating-Point Arithmetic
    Michael François, David Defour, Christophe Negre
    Informatica, Slovene Society Informatika, Ljubljana, 2014, 38 (2), pp.115-124.
  5. Pseudo-random number generator based on mixing of three chaotic maps
    Michael François, Thomas Grosges, Dominique Barchiesi, Robert Erra
    Communications in Nonlinear Science and Numerical Simulation, Elsevier, 2014, 19 (4), pp.887--895.

2013

  1. Improved Three-Way Split Formulas for Binary Polynomial and Toeplitz Matrix Vector Products
    Murat Cenk, Christophe Negre, Anwar Hasan
    IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2013, 62 (7), pp.1345-1361.
  2. Multiway Splitting Method for Toeplitz Matrix Vector Product
    Anwar Hasan, Christophe Negre
    IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2013, 62 (7), pp.1467-1471.
  3. Improved Area-Time Trade-offs for Field Multiplication using Optimal Normal Bases
    Jithra Adikari, Ayad Barsoum, Anwar Hasan, Ashkan Namin, Christophe Negre
    IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2013, 62 (1), pp.193-199.

Communications internationales

2018

  1. Meta-implementation of vectorized logarithm function in binary floating-point arithmetic
    Hugues De Lassus Saint-Geniès, Nicolas Brunie, Guillaume Revy
    ASAP: Application-specific Systems, Architectures and Processors, Jul 2018, Milan, Italy. 29th IEEE International Conference Application-specific Systems, Architectures and Processors, 2018, ASAP 2018. <https://asap18.necst.it>

2017

  1. Efficient Leak Resistant Modular Exponentiation in RNS
    Andrea Lesavourey, Christophe Negre, Thomas Plantard
    ARITH: Computer Arithmetic, Jul 2017, London, United Kingdom. IEEE, IEEE 24th Symposium on Computer Arithmetic, 2017. <10.1109/ARITH.2017.39>
  2. Asynchronous Power Flow on Graphic Processing Units
    Manuel Marin, David Defour, Federico Milano
    PDP: Parallel, Distributed and network-Based Processing, Mar 2017, St Petersburg, Russia. 25th Euromicro International Conference on Parallel, Distributed and network-Based Processing, 2017.

2016

  1. Hierarchical Approach for Deriving a Reproducible LU factorization on GPUs
    Roman Iakymchuk, Stef Graillat, David Defour, Enrique Quintana-Ortí
    The Numerical Reproducibility at Exascale (NRE16) workshop held as part of the Supercomputing Conference (SC16), Nov 2016, Salt Lake City, UT, United States.
  2. First improvements toward a reproducible Telemac-2D
    Rafife Nheili, Philippe Langlois, Christophe Denis
    XXIIIrd TELEMAC-MASCARET User Conference , Oct 2016, Paris, France. <http://www.opentelemac.org/index.php/user-conference26>
  3. Towards Fast, Accurate and Reproducible LU Factorization
    Roman Iakymchuk, David Defour, Stef Graillat
    SCAN 2016, 17th international symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, Sep 2016, Uppsala, Sweden. pp.59-60, 2016.
  4. Parallel experiments with RARE-BLAS
    Chemseddine Chohra, Philippe Langlois, David Parello
    SYNASC: Symbolic and Numeric Algorithms for Scientific Computing, Sep 2016, Timisoara, Romania. 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2016. <http://synasc.ro/2016/>
  5. Reproducible, Accurately Rounded and Efficient BLAS
    Chemseddine Chohra, Philippe Langlois, David Parello
    REPPAR: Reproducibility in Parallel Computing, Aug 2016, Grenoble, France. 3rd International Workshop on Reproducibility in Parallel Computing, 2016. <http://reppar.org/index.html>
  6. Efficient Randomized Regular Modular Exponentiation using Combined Montgomery and Barrett Multiplications
    Andrea Lesavourey, Christophe Negre, Thomas Plantard
    SECRYPT: Security and Cryptography, Jul 2016, Lisbon, Portugal. 13th International Conference on Security and Cryptography, 2016. <http://www.secrypt.icete.org/?y=2016>
  7. Enhanced Digital Signature using RNS Digit Exponent Representation
    Thomas Plantard, Jean-Marc Robert
    International Workshop on the Arithmetic of Finite Fields, WAIFI 2016, Jul 2016, Gand, Belgium. Springer, lncs (à paraître). <http://cage.ugent.be/waifi/>
  8. Automated design of floating-point logarithm functions on integer processors
    Guillaume Revy
    ARITH 23, Jul 2016, Silicon Valley, Santa Clara, CA, United States. 23th IEEE International Symposium on Computer Arithmetic. <http://arith23.gforge.inria.fr/>
  9. Recovering numerical reproducibility in hydrodynamic simulations
    Philippe Langlois, Rafife Nheili, Christophe Denis
    ARITH: Computer Arithmetic, Jul 2016, Silicon Valley, Santa Clara, CA, United States. 23th IEEE International Symposium on Computer Arithmetic, 2016. <http://arith23.gforge.inria.fr/>
  10. Reproducible and Accurate Algorithms for Numerical Linear Algebra
    Roman Iakymchuk, David Defour, Sylvain Collange, Stef Graillat
    PP: Parallel Processing for Scientific Computing, Apr 2016, Paris, France. SIAM, SIAM Conference on Parallel Processing for Scientific Computing (PP16), 2016.
  11. Parallel Locality and Parallelization Quality
    Bernard Goossens, David Parello, Katarzyna Porada, Djallal Rahmoune
    PMAM: Programming Models and Applications for Multicores and Manycores, Mar 2016, Barcelona, Spain. 7th International Workshop on Programming Models and Applications for Multicores and Manycores, 2016. <10.1145/2883404.2883410>

2015

  1. ExBLAS: Reproducible and Accurate BLAS Library
    Roman Iakymchuk, Sylvain Collange, David Defour, Stef Graillat
    NRE: Numerical Reproducibility at Exascale, Nov 2015, Austin, TX, United States. 2015.
  2. Automatic Source-to-Source Error Compensation of Floating-Point Programs
    Laurent Thévenoux, Philippe Langlois, Matthieu Martel
    IEEE. Computational Science and Engineering (CSE), Oct 2015, Porto, Portugal. 2015 IEEE 18th International Conference on Computational Science and Engineering, pp.9--16, 2015.
  3. Reproducible floating-point atomic addition in data-parallel environment
    David Defour, Sylvain Collange
    ACSIS: Annals of Computer Science and Information Systems, Sep 2015, Lodz, Poland. Proceedings of the 2015 Federated Conference on Computer Science and Information Systems, 5, pp.721-728, 2015.
  4. Measuring predictability of Nvidia’s GPU warp and block schedulers: Application to the summation problem
    David Defour
    IEEE 9th International Symposium on Embedded Multicore/Many-core Systems-on-Chip (MCSoC-15), Sep 2015, Turin, Italy. IEEE 9th International Symposium on Embedded Multicore/Many-core Systems-on-Chip (MCSoC-15), pp.17-24, 2015.
  5. Toward a Core Design to Distribute an Execution on a Many-Core Processor
    Bernard Goossens, David Parello, Katarzyna Porada, Djallal Rahmoune
    Victor Malyshkin. PaCT: Parallel Computing Technologies, Aug 2015, Petrozavodsk, Russia. Springer International Publishing, 13th International Conference, PaCT 2015, Petrozavodsk, Russia, August 31-September 4, 2015, Proceedings, LNCS (9251), pp.390-404, 2015, Parallel Computing Technologies.
  6. Range Reduction Based on Pythagorean Triples for Trigonometric Function Evaluation
    Hugues De Lassus Saint-Geniès, David Defour, Guillaume Revy
    26th IEEE International Conference Application-specific Systems, Architectures and Processors (ASAP 2015), Jul 2015, Toronto, Canada. IEEE, pp.74-81, 2015.
  7. Numerical Reproducibility: Feasibility Issues
    Philippe Langlois, Rafife Nheili, Christophe Denis
    Mohamad Badra; Azzedine Boukerche; Pascal Urien. NTMS: New Technologies, Mobility and Security, Jul 2015, Paris, France. 7th IFIP International Conference on New Technologies, Mobility and Security, 2015. <10.1109/NTMS.2015.7266509>
  8. Parallel Approaches for Efficient Scalar Multiplication over Elliptic Curve
    Christophe Negre, Jean-Marc Robert
    Multiplication over Elliptic Curve. SECRYPT: International Conference on Security and Cryptography, Jul 2015, Colmar, France. SciTePress, 12th International Conference on Security and Cryptography (SECRYPT 2015) Colmar, France, 20-22 July 2015 pp.202-209, 2015.
  9. Numerical Reproducibility in open TELEMAC: A Case Study within the Tomawac Library
    Rafife Nheili, Philippe Langlois, Christophe Denis
    2nd International Workshop on High Performance Computing Simulation in Energy/Transport Domains (HPCSET 2015), ISC High Performance 2015 Conference., Jul 2015, Frankfurt, Germany.
  10. Trade-off Approaches for Leak Resistant Modular Arithmetic in RNS
    Christophe Negre, Guilherme Perin
    Ernest Foo; Douglas Stebila. ACISP: Australasian Conference on Information Security and Privacy, Jun 2015, Brisbane, Australia. Springer, 20th Australasian Conference on Information Security and Privacy, LNCS (9144), pp.107-124, 2015, Information Security and Privacy.
  11. Efficient Modular Exponentiation Based on Multiple Multiplications by a Common Operand
    Christophe Negre, Thomas Plantard, Jean-Marc Robert
    ARITH: Computer Arithmetic, Jun 2015, Lyon, France. IEEE 22nd Symposium on Computer Arithmetic, pp.144-151, 2015.
  12. Reproducible Triangular Solvers for High-Performance Computing
    Roman Iakymchuk, David Defour, Sylvain Collange, Stef Graillat
    ITNG: Information Technology - New Generations, Apr 2015, Las Vegas, NV, United States. 12th International Conference on Information Technology - New Generations, pp.353-358, 2015.
  13. An efficient midpoint-radius implementation to handle symmetric fuzzy intervals
    Manuel Marin, David Defour, Federico Milano
    RAIM: Rencontres Arithmétiques de l’Informatique Mathématique, Apr 2015, Rennes, France. 7ème Rencontre Arithmétique de l'Informatique Mathématique, 2015.

2014

  1. Software Implementation of Parallelized ECSM over Binary and Prime Fields
    Jean-Marc Robert
    Inscrypt: Information Security and Cryptology, Dec 2014, Beijing, China. Springer, 10th International Conference, Inscrypt 2014, Beijing, China, December 13-15, 2014, Revised Selected Papers, LNCS (8957), pp.445-462, 2014.
  2. Toward the synthesis of fixed-point code for matrix inversion based on Cholesky decomposition
    Matthieu Martel, Mohamed Amine Najahi, Guillaume Revy
    DASIP: Design and Architectures for Signal and Image Processing, Oct 2014, Madrid, Spain. IEEE, 6th Conference on Design and Architectures for Signal and Image Processing, pp.1-8, 2014.
  3. Automated Synthesis of Target-Dependent Programs for Polynomial Evaluation in Fixed-Point Arithmetic
    Christophe Mouilleron, Mohamed Amine Najahi, Guillaume Revy
    SYNASC: Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Sep 2014, Timisoara, Romania. 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp.141-148, 2014.
  4. Level 1 Parallel RTN-BLAS: Implementation and Efficiency Analysis
    Chemseddine Chohra, Philippe Langlois, David Parello
    SCAN: Scientific Computing, Computer Arithmetic and Validated Numerics, Sep 2014, Wurzburg, Germany. 16th GAMM-IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, 2014. <http://www.scan2014.uni-wuerzburg.de/talks/>
  5. Efficiency of Reproducible Level 1 BLAS
    Chemseddine Chohra, Philippe Langlois, David Parello
    SCAN: Scientific Computing, Computer Arithmetic, and Validated Numerics, Sep 2014, Würzburg, Germany. 16th GAMM-IMACS International Symposium on Scientific Computing, Computer Arithmetic, and Validated Numerics - Revised Selected Papers, LNCS (9553), pp.99-108, 2016, Scientific Computing, Computer Arithmetic, and Validated Numerics.
  6. Reproducible and Accurate Matrix Multiplication
    Roman Iakymchuk, David Defour, Sylvain Collange, Stef Graillat
    SCAN 2014, 16th GAMM-IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, Sep 2014, Wurzburg, Germany. pp.126-137, 2016, Lecture Notes of Computer Science.
  7. Reproducible and Accurate Matrix Multiplication for High-Performance Computing
    Sylvain Collange, David Defour, Stef Graillat, Roman Iakymchuk
    SCAN 2014 - 16th GAMM-IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, Sep 2014, Wuerzburg, Germany. 16th GAMM-IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, pp.42-43, 2014.
  8. Power Flow Analysis under Uncertainty using Symmetric Fuzzy Arithmetic
    Manuel Marin, David Defour, Federico Milano
    PES General Meeting 2014 | Conference & Exposition, Jul 2014, National Harbor, MD, United States. IEEE, pp.1-5, 2014.
  9. A Reproducible Accurate Summation Algorithm for High-Performance Computing
    Sylvain Collange, David Defour, Stef Graillat, Roman Iakymchuk
    EX: Exascale Applied Mathematics Challenges and Opportunities, Jul 2014, Chicago, United States. SIAM Workshop on Exascale Applied mathematics Challenges and opportunites, 2014. <http://www.siam.org/meetings/ex14/>
  10. Impact des schedulers sur la prédictibilité dans les GPU
    David Defour
    Pascal Felber; Laurent Philippe; Etienne Riviere; Arnaud Tisserand. ComPAS: Conférence en Parallélisme, Architecture et Système, Apr 2014, Neuchâtel, Suisse. 2014.
  11. Analyse et réduction du chemin critique dans l'exécution d'une application
    Katarzyna Porada, David Parello, Bernard Goossens
    Pascal Felber and Laurent Philippe and Etienne Riviere and Arnaud Tisserand. ComPAS: Conférence en Parallélisme, Architecture et Système, Apr 2014, Neuchâtel, Suisse. 2014.
  12. A Pseudo-Random Bit Generator Based on Three Chaotic Logistic Maps and IEEE 754-2008 Floating-Point Arithmetic
    Michael François, David Defour, Pascal Berthomé
    T.V. Gopal; Angsheng Li A. Barry Cooper; Manindra Agrawal. Theory and Applications of Models of Computation, Apr 2014, Chennai, India. Springer, pp.229-247, 2014, LNCS.
  13. FuzzyGPU : a fuzzy arithmetic library for GPU
    Manuel Marin, David Defour
    PDP: Parallel, Distributed and Network-Based Processing, Feb 2014, Torino, Italy. IEEE, 22nd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, pp.624-631, 2014.
  14. Code Size and Accuracy-Aware Synthesis of Fixed-Point Programs for Matrix Multiplication
    Matthieu Martel, Mohamed Amine Najahi, Guillaume Revy
    PECCS: Pervasive and Embedded Computing and Communication Systems, Jan 2014, Lisbonne, Portugal. 4th International Conference on Pervasive and Embedded Computing and Communication Systems, 2014. <10.5220/0004884802040214>

2013

  1. GPUburn: A System to Test and Mitigate GPU Hardware Failures
    Eric Petit, David Defour
    Embedded Computer Systems: Architectures, Modeling, and Simulation (SAMOS), Jul 2013, Samos, Greece. 13th International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation, pp.263-270, 2013.
  2. Impact of Optimized Operations AB,AC and AB+CD in Scalar Multiplication over Binary Elliptic Curve
    Christophe Negre, Jean-Marc Robert
    AFRICACRYPT: Cryptology in Africa, Jun 2013, Cairo, Egypt. 7th International Conference on Cryptology in Africa, LNCS (8469), pp.13-30, 2014, Progress in Cryptology – AFRICACRYPT 2014.
  3. Synthesizing Accurate Floating-Point Formulas
    Arnault Ioualalen, Matthieu Martel
    ASAP: Application-Specific Systems, Architectures and Processors, Jun 2013, Washington, DC, United States. IEEE, Application-Specific Systems, Architectures and Processors (ASAP), 2013 IEEE 24th International Conference, pp.113-116, 2013.
  4. Regularity versus Load-Balancing on GPU for treefix computations
    David Defour, Manuel Marin
    ICCS: International Conference on Computational Science, Jun 2013, Barcelone, Spain. 18, pp.309-318, 2013.
  5. Towards a Reliable Performance Evaluation of Accurate Summation Algorithms
    Philippe Langlois, Bernard Goossens, David Parello
    SCE: Computational Science and Engineering, Feb 2013, Boston, Ma, United States. SIAM Conference on Computational Science and Engineering, 2013. <https://www.siam.org/meetings/cse13/>

Mots-clés

Micro-architecture des processeurs, Simulation d’unités de calcul, Arithmetique des ordinateurs, Calcul certifié, Synthèse de code, Operateurs cryptographiques, Logiciel numerique, Calcul haute performance

Dernière mise à jour le 27/06/2018