## Abstract The multifrontal method is applied for solving a large, sparse, and unsymmetric system of linear equations resulting from the use of the edge‐based finite‐element method (FEM). The finite‐element method combined with perfectly matched layers (PML) is given for simulation of microwave de
Impact of reordering on the memory of a multifrontal solver
✍ Scribed by Abdou Guermouche; Jean-Yves L’Excellent; Gil Utard
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 634 KB
- Volume
- 29
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
✦ Synopsis
This paper is concerned with the memory usage of sparse direct solvers, which depends on the ordering of the unknowns and the scheduling of the computational tasks. We study the influence of state-of-the-art sparse matrix reordering techniques on the memory usage of a multifrontal solver. Concerning the scheduling, the memory usage depends on the tree traversal and how the tasks are assigned to the processors. We analyze the memory scalability when a dynamic scheduling strategy mainly based on the balance of the workload is used. Finally we give hints to improve the parallel memory behaviour.
📜 SIMILAR VOLUMES
A homeless protocol is one in which all nodes are treated identically when they access common resources. By contrast, home-based protocols assign a home or manager to each resource. Use of the resource by the home incurs less overhead than use by other processors. The key to good performance in such