Constructing Memory-minimizing Schedules for Multifrontal Methods - Archive ouverte HAL
Article Dans Une Revue ACM Transactions on Mathematical Software Année : 2006

Constructing Memory-minimizing Schedules for Multifrontal Methods

Résumé

We are interested in the active and total memory usage of the multifrontal method. Starting from the algorithms proposed by Liu, we suggest a new scheme together with a tree traversal that give an optimal peak of active memory. Significant gains are obtained compared to Liu's approach. We also study the problem of minimizing the total memory and compare various new schemes. A number of experiments shows the interest of these approaches.
Fichier non déposé

Dates et versions

hal-00358620 , version 1 (04-02-2009)

Identifiants

  • HAL Id : hal-00358620 , version 1

Citer

Jean-Yves L'Excellent, Abdou Guermouche. Constructing Memory-minimizing Schedules for Multifrontal Methods. ACM Transactions on Mathematical Software, 2006, 32 (1), pp.17-32. ⟨hal-00358620⟩
82 Consultations
0 Téléchargements

Partager

More