Hybrid scheduling for the parallel solution of linear systems

Abstract : In this paper, we consider the problem of designing a dynamic scheduling strategy that takes into account both workload and memory information in the context of the parallel multifrontal factorization. The originality of our approach is that we base our estimations (work and memory) on a static optimistic scenario during the analysis phase. This scenario is then used during the factorization phase to constrain the dynamic decisions. The task scheduler has been redesigned to take into account these new features. Moreover performance have been improved because the new constraints allow the new scheduler to make optimal decisions that were forbidden or too dangerous in unconstrained formulations. Performance analysis show that the memory estimation becomes much closer to the memory effectively used and that even in a constrained memory environment we decrease the factorization time with respect to the initial approach.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00070599
Contributor : Rapport de Recherche Inria <>
Submitted on : Friday, May 19, 2006 - 8:58:36 PM
Last modification on : Thursday, June 27, 2019 - 4:27:53 PM

Identifiers

  • HAL Id : inria-00070599, version 1

Citation

Patrick R. Amestoy, Abdou Guermouche, Jean-Yves L'Excellent, Stéphane Pralet. Hybrid scheduling for the parallel solution of linear systems. [Research Report] RR-5404, LIP RR-2004-53, INRIA, LIP. 2004, pp.28. ⟨inria-00070599⟩

Share

Metrics

Record views

342

Files downloads

845