Frédéric Gava
Research Subjects
Frédéric Gava has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Frédéric Loulergue
Université d’Orléans, INSA CVL, LIFO UR 4022
12 shared publications Jean Fortin
University of Paris-East
6 shared publicationsMichael Guedj
University of Paris-East
5 shared publicationsFranck Pommereau
4 shared publicationsLouis Gesbert
MLstate, Paris, France
4 shared publications- Victor Allombert
Université d’Orléans
3 shared publications
Latest Publications
- 29 July 2020
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 48 (4) , 626-651
Axiomatization and Imperative Characterization of Multi-BSP Algorithms: A Q&A on a Partial Solution
- 29 July 2020
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 48 (4) , 626-651
Axiomatization and Imperative Characterization of Multi-BSP Algorithms: A Q&A on a Partial Solution
- 27 March 2019
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 76 (7) , 5079-5097
Programming bsp and multi-bsp algorithms in ml
- 27 March 2019
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 76 (7) , 5079-5097
Programming bsp and multi-bsp algorithms in ml
- 7 December 2018
- Published by Springer Nature
- p. 159-174
Toward Performance Prediction for Multi-BSP Programs in ML
- 7 December 2018
- Published by Springer Nature
- p. 159-174
Toward Performance Prediction for Multi-BSP Programs in ML
- 7 December 2018
- Published by Springer Nature
- p. 72-88
An Axiomatization for BSP Algorithms
- Open Access
- 1 July 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 500-507
An ML Implementation of the MULTI-BSP Model
We have designed a parallel language called MULTI- ML for programming MULTI-BSP algorithms in ML. The MULTI- BSP model provides a tree-based view of nested components of hierarchical architectures. The structure and abstraction brought by MULTI-BSP allows for portable parallel programs with scalable performance predictions, without dealing with low-level details of architecture. The MULTI-ML language is essentially based on the concept of multi-functions which are recursive functions used to execute perform recursions on the nested sub-components through the MULTI-BSP (hierarchical) architecture. In this paper we design a generic compilation scheme of the MULTI-ML language dedicated to parallel machines performing data exchanges using synchronous requests, derived from any ML compilation. This ensures that the implementation follows the semantics, allowing greater confidence in the safety of execution.
- 1 July 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 500-507
Open AccessAn ML Implementation of the MULTI-BSP Model
We have designed a parallel language called MULTI- ML for programming MULTI-BSP algorithms in ML. The MULTI- BSP model provides a tree-based view of nested components of hierarchical architectures. The structure and abstraction brought by MULTI-BSP allows for portable parallel programs with scalable performance predictions, without dealing with low-level details of architecture. The MULTI-ML language is essentially based on the concept of multi-functions which are recursive functions used to execute perform recursions on the nested sub-components through the MULTI-BSP (hierarchical) architecture. In this paper we design a generic compilation scheme of the MULTI-ML language dedicated to parallel machines performing data exchanges using synchronous requests, derived from any ML compilation. This ensures that the implementation follows the semantics, allowing greater confidence in the safety of execution.
- 1 July 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 740-747
Algorithmic Completeness for BSP Languages
What is bulk-synchronous parallel (BSP) computing and is not? Behind this naive question, we can find complex formalisms. We first define a model that contain all BSP algorithms; This model comes with what is called abstract state machines (ASMs). Then, we prove, by using an operational semantics and a fair simulation, the algorithmic equivalence between an imperative language (with BSP routines) and the previous model. We finally give the intuition of an example that is not BSP complete.
- 1 July 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 740-747
Algorithmic Completeness for BSP Languages
What is bulk-synchronous parallel (BSP) computing and is not? Behind this naive question, we can find complex formalisms. We first define a model that contain all BSP algorithms; This model comes with what is called abstract state machines (ASMs). Then, we prove, by using an operational semantics and a fair simulation, the algorithmic equivalence between an imperative language (with BSP routines) and the previous model. We finally give the intuition of an example that is not BSP complete.
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 180-187
A Formal Semantics of the MULTI-ML Language
In the context of high performance computing, it is important to avoid indeterminism and dead-locks. Multi-ML is a functional parallel programming language "à la ML", designed to program hierarchical architectures in a structured way. It is based of the Multi-BSP bridging model. To ensure that a program "cannot go wrong", we first need to define how a program "goes". To do so, we propose a formal operational semantics of the Multi-ML language to ensure the properties of the Multi-BSP model. We first describe a core-language and then introduce the big step's semantics evaluation rules. Then, we propose a set of evaluation rules that describe the behaviour of the Multi-ML language. The memory model is also precisely defined, as the Multi-BSP model deals with multiple level of nested memories.
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 180-187
A Formal Semantics of the MULTI-ML Language
In the context of high performance computing, it is important to avoid indeterminism and dead-locks. Multi-ML is a functional parallel programming language "à la ML", designed to program hierarchical architectures in a structured way. It is based of the Multi-BSP bridging model. To ensure that a program "cannot go wrong", we first need to define how a program "goes". To do so, we propose a formal operational semantics of the Multi-ML language to ensure the properties of the Multi-BSP model. We first describe a core-language and then introduce the big step's semantics evaluation rules. Then, we propose a set of evaluation rules that describe the behaviour of the Multi-ML language. The memory model is also precisely defined, as the Multi-BSP model deals with multiple level of nested memories.
- 2 April 2016
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 45 (2) , 340-361
Multi-ML: Programming Multi-BSP Algorithms in ML
- 2 April 2016
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 45 (2) , 340-361
Multi-ML: Programming Multi-BSP Algorithms in ML
- 29 December 2015
- Published by Springer Nature
- p. 222-237
Towards Mechanised Semantics of HPC: The BSP with Subgroup Synchronisation Case
- 29 December 2015
- Published by Springer Nature
- p. 222-237
Towards Mechanised Semantics of HPC: The BSP with Subgroup Synchronisation Case
- 31 March 2015
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 44 (3) , 574-597
BSP-Why: A Tool for Deductive Verification of BSP Algorithms with Subgroup Synchronisation
- 31 March 2015
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 44 (3) , 574-597
BSP-Why: A Tool for Deductive Verification of BSP Algorithms with Subgroup Synchronisation