QR_MUMPS
 All Classes Files Functions Variables Enumerations Enumerator Pages
Functions/Subroutines
qrm_reorder_tree.F90 File Reference

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...
 

Detailed Description

This file contains the routine that computes a reordering of the tree to reduce the search space for task scheduling.

Date:
2016-01-29 22:22:30 +0100 (Fri, 29 Jan 2016)
Author:
abuttari
Version:
1.1
Revision:
2075

Definition in file qrm_reorder_tree.F90.

Function/Subroutine Documentation

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.

Parameters
[in,out]adataa qrm_adata_type data containing a full caracterization of the assembly tree and fronts structure.
Todo:
Add better explication of the algorithm

Definition at line 51 of file qrm_reorder_tree.F90.

References i.