QR_MUMPS
|
This file contains the routine that computes a reordering of the tree to reduce the search space for task scheduling. More...
Go to the source code of this file.
Functions/Subroutines | |
subroutine | qrm_reorder_tree (adata) |
This subroutine reorders the assembly tree in order to reduce the tasks search space. More... | |
This file contains the routine that computes a reordering of the tree to reduce the search space for task scheduling.
Definition in file qrm_reorder_tree.F90.
subroutine qrm_reorder_tree | ( | type(qrm_adata_type) | adata | ) |
This subroutine reorders the assembly tree in order to reduce the tasks search space.
A nice side effect of this is that memory consumption is also reduced. The code here basically follows the idea in:
J. W. H. Liu. On the storage requirement in the out-of-core multifrontal method for sparse factorization. ACM Transactions on Mathematical Software, 12:127–148, 1986.
[in,out] | adata | a qrm_adata_type data containing a full caracterization of the assembly tree and fronts structure. |
Definition at line 52 of file qrm_reorder_tree.F90.