Une plateforme d'expertise en Algèbre Linéaire Creuse un mariage réussi avec DIET - Ronan Guivarch
Une plateforme d'expertise en Algèbre Linéaire Creuse un mariage réussi avec DIET.
Présentation de Ronan Guivarch (Maître de Conférences, CNRS, IRIT, ENSEEIHT) lors des Rencontres SaaS, Cloud & innovation organisées par SysFera le 23 mai à Clamart.
organisées par Grid-TLSE - une plateforme d'expertise en Algèbre Linéaire Creuse : un mariage réussi avec DIET Grid-TLSE - une plateforme d'expertise en Algèbre Linéaire Creuse : un mariage réussi avec DIET P. Amestoy, F. Camillo, M. Daydé, R. Guivarch, A. Hurault, JY. L'Excellent (*), C. Puglisi IRITINPT(ENSEEIHT) (Toulouse) (*)LIPENS (Lyon) http://gridtlse.org
The GRIDTLSE project has been initially funded by the French Ministery through ACI "Globalisation des Ressources Informatiques et des Données". It has started in 2003. Currently, it is supported by the ANR (Agence National de la Recherche) through: ➢ the COOP project (ANR09COSI001) funded by the French ANR COSINUS program. ➢ The FP3C project (ANRJTIC 20102013) Previously, the GRIDTLSE project was part of other projects: ➢ the SOLSTICE project (ANR06CIS6010). ➢ the ANR LEGO project 20052009 (ANRCICG0511). ➢ the ReDIMSoPS project through the CNRS/JST (Japan) cooperation.
T TEST FOR L LARGE S SYSTEMS OF EQUATIONS T TEST: L LARGE S SYSTEMS OF EQUATIONS: ✔ It gives facilities to share matrices ✔ It provides a test environment for expert and non-expert users of sparse linear algebra software ✔ It helps non-expert users in choosing the right solvers and its parameters for a given problem
The GRIDTLSE web site allows an environmental testing Examples of expertise: Memory required to factor a given matrix Error analysis as a function of the threshold pivoting value Minimum time on a given computer to factor a given unsymmetric matrix Which ordering heuristic is the best one for solving a given problem? Each question corresponds to a «scenario scenario» OP1 OP2 IN OUT
GRID GRIDTLSE Why using the Grid? ✔ Sparse linear algebra software makes use of sophisticated algorithms for (pre-/post-) processing the matrix. ✔ Multiple parameters interfere for efficient execution of a sparse direct solver: ✔ Ordering; ✔ Amount of memory; ✔ Architecture of computer; ✔ Available libraries. ✔ Determining the best combination of parameter values is a multi-parametric problem. => Well-suited for execution over a Grid
The GRIDTLSE web site provides facilities to: Access to collections of public matrices Upload matrices Create private groups to share matrices Sharing test problems
types of users ✔ Non-expert users that want to proceed to some tests over their problems (matrices) ✔ Expert users that deploy tools (solvers) and specify scenarios
ser ✔ Connects to WebSolve ✔ Uploads his matrices ✔ Chooses a scenario and Construct an Expertise ✔ Fills the expertise inputs (In our example: ✔ Computers ✔ Matrices) User Computer Grid Computer Grid user request
sers ✔ Connects to WebSolve ✔ Uploads his matrices ✔ Chooses a scenario and Construct an Expertise ✔ Fills the expertise inputs (In our example: ✔ Computers ✔ Matrices) ✔ Run the Expertise User Computer Grid Computer Grid results user request
expertise, many experiments with the same matrix and many solvers (or a solver with different parameter values) and many computers ➢ experiments launched in parallel • Our previous solution: ➢ one data transfer (matrix) from the computer where we store the matrices to the selected computers ➢ drawbacks: ➢ many transfers at the same time (huge utilization of the network) ➢ many instances of the same matrix on a computer
New client and service ➢ two main parameters: a matrix and a computer ➢ purpose: find if the matrix is registered with DAGDA and is placed on the selected computer ➢ if the matrix is not yet registered, an alias is created to associate the name of the matrix (unique) with its ID and the matrix is transferred on the selected computer • How do we do now? ➢ a client is launched for each experiment in sequential ➢ we are sure that when we, now, launch the computational experiments, the matrix is registered in DAGDA and exists (with a single instance) on the selected computers
data transfer from the computer where we store our matrices to the GRID (the other transfers are managed by DAGDA) ➢ an unique instance of the matrix on a computer ➢ some time results: Matrix - WithoutShields.mm (176359Kb) durée expertise (sec) 00:12:40 00:12:58 00:13:15 00:13:32 00:13:49 00:14:07 00:14:24 00:14:41 00:14:59 00:15:16 Run 1 DAGDA (tlse-ma-sed) Run 2 DAGDA Run 3 DAGDA OFF Run 4 DAGDA (ma-sed)
many runs of the new client are unnecessary: once the matrix is registered and placed on a computer, all the runs with the same matrix and the same computer will do nothing (work on the GRID-TLSE side) ➢ when the DIET/DAGDA infrastructure is stopped, we lose everything (work with the DIET/SysFera team)