Multi level programming Paradigm for Extreme Computing

¹ Université Lille 1, Sciences et Technologies, 59655 Villeneuve d’Ascq Cedex – France
² Maison de la Simulation, 91191 Gif-sur-Yvette Cedex - France
³ Center for Computational Sciences, University of Tsukuba, Japan
⁴ PRiSM Laboratory, University of Versailles, France
⁵ CEA/DEN/DANS/DM2S, CEA Saclay, 91191 Gif-sur-Yvette Cedex - France

^* Corresponding Author: serge.petiton@lifl.fr

Abstract

Abstract: In order to propose a framework and programming paradigms for post-petascale computing, on the road to exascale computing and beyond, we introduced new languages, associated with a hierarchical multi-level programming paradigm, allowing scientific end-users and developers to program highly hierarchical architectures designed for extreme computing. In this paper, we explain the interest of such hierarchical multi-level programming paradigm for extreme computing and its well adaptation to several large computational science applications, such as for linear algebra solvers used for reactor core physic. We describe the YML language and framework allowing describing graphs of parallel components, which may be developed using PGAS-like language such as XMP, scheduled and computed on supercomputers. Then, we propose experimentations on supercomputers (such as the “K” and “Hooper” ones) of the hybrid method MERAM (Multiple Explicitly Restarted Arnoldi Method) as a case study for iterative methods manipulating sparse matrices, and the block Gauss-Jordan method as a case study for direct method manipulating dense matrices. We conclude proposing evolutions for this programming paradigm.