root / src / pgesv / HPL_pdgesv0.c @ 9
Historique | Voir | Annoter | Télécharger (6 ko)
| 1 |
/*
|
|---|---|
| 2 |
* -- High Performance Computing Linpack Benchmark (HPL)
|
| 3 |
* HPL - 2.0 - September 10, 2008
|
| 4 |
* Antoine P. Petitet
|
| 5 |
* University of Tennessee, Knoxville
|
| 6 |
* Innovative Computing Laboratory
|
| 7 |
* (C) Copyright 2000-2008 All Rights Reserved
|
| 8 |
*
|
| 9 |
* -- Copyright notice and Licensing terms:
|
| 10 |
*
|
| 11 |
* Redistribution and use in source and binary forms, with or without
|
| 12 |
* modification, are permitted provided that the following conditions
|
| 13 |
* are met:
|
| 14 |
*
|
| 15 |
* 1. Redistributions of source code must retain the above copyright
|
| 16 |
* notice, this list of conditions and the following disclaimer.
|
| 17 |
*
|
| 18 |
* 2. Redistributions in binary form must reproduce the above copyright
|
| 19 |
* notice, this list of conditions, and the following disclaimer in the
|
| 20 |
* documentation and/or other materials provided with the distribution.
|
| 21 |
*
|
| 22 |
* 3. All advertising materials mentioning features or use of this
|
| 23 |
* software must display the following acknowledgement:
|
| 24 |
* This product includes software developed at the University of
|
| 25 |
* Tennessee, Knoxville, Innovative Computing Laboratory.
|
| 26 |
*
|
| 27 |
* 4. The name of the University, the name of the Laboratory, or the
|
| 28 |
* names of its contributors may not be used to endorse or promote
|
| 29 |
* products derived from this software without specific written
|
| 30 |
* permission.
|
| 31 |
*
|
| 32 |
* -- Disclaimer:
|
| 33 |
*
|
| 34 |
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
| 35 |
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
| 36 |
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
| 37 |
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE UNIVERSITY
|
| 38 |
* OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
| 39 |
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
| 40 |
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
| 41 |
* DATA OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
| 42 |
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
| 43 |
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
| 44 |
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| 45 |
* ---------------------------------------------------------------------
|
| 46 |
*/
|
| 47 |
/*
|
| 48 |
* Include files
|
| 49 |
*/
|
| 50 |
#include "hpl.h" |
| 51 |
|
| 52 |
#ifdef STDC_HEADERS
|
| 53 |
void HPL_pdgesv0
|
| 54 |
( |
| 55 |
HPL_T_grid * GRID, |
| 56 |
HPL_T_palg * ALGO, |
| 57 |
HPL_T_pmat * A |
| 58 |
) |
| 59 |
#else
|
| 60 |
void HPL_pdgesv0
|
| 61 |
( GRID, ALGO, A ) |
| 62 |
HPL_T_grid * GRID; |
| 63 |
HPL_T_palg * ALGO; |
| 64 |
HPL_T_pmat * A; |
| 65 |
#endif
|
| 66 |
{
|
| 67 |
/*
|
| 68 |
* Purpose
|
| 69 |
* =======
|
| 70 |
*
|
| 71 |
* HPL_pdgesv0 factors a N+1-by-N matrix using LU factorization with row
|
| 72 |
* partial pivoting. The main algorithm is the "right looking" variant
|
| 73 |
* without look-ahead. The lower triangular factor is left unpivoted and
|
| 74 |
* the pivots are not returned. The right hand side is the N+1 column of
|
| 75 |
* the coefficient matrix.
|
| 76 |
*
|
| 77 |
* Arguments
|
| 78 |
* =========
|
| 79 |
*
|
| 80 |
* GRID (local input) HPL_T_grid *
|
| 81 |
* On entry, GRID points to the data structure containing the
|
| 82 |
* process grid information.
|
| 83 |
*
|
| 84 |
* ALGO (global input) HPL_T_palg *
|
| 85 |
* On entry, ALGO points to the data structure containing the
|
| 86 |
* algorithmic parameters.
|
| 87 |
*
|
| 88 |
* A (local input/output) HPL_T_pmat *
|
| 89 |
* On entry, A points to the data structure containing the local
|
| 90 |
* array information.
|
| 91 |
*
|
| 92 |
* ---------------------------------------------------------------------
|
| 93 |
*/
|
| 94 |
/*
|
| 95 |
* .. Local Variables ..
|
| 96 |
*/
|
| 97 |
HPL_T_panel * * panel = NULL;
|
| 98 |
HPL_T_UPD_FUN HPL_pdupdate; |
| 99 |
int N, j, jb, n, nb, tag=MSGID_BEGIN_FACT,
|
| 100 |
test=HPL_KEEP_TESTING; |
| 101 |
/* ..
|
| 102 |
* .. Executable Statements ..
|
| 103 |
*/
|
| 104 |
if( ( N = A->n ) <= 0 ) return; |
| 105 |
|
| 106 |
HPL_pdupdate = ALGO->upfun; nb = A->nb; |
| 107 |
/*
|
| 108 |
* Allocate a panel list of length 1 - Allocate panel[0] resources
|
| 109 |
*/
|
| 110 |
panel = (HPL_T_panel **)malloc( sizeof( HPL_T_panel * ) );
|
| 111 |
if( panel == NULL ) |
| 112 |
{ HPL_pabort( __LINE__, "HPL_pdgesv0", "Memory allocation failed" ); }
|
| 113 |
|
| 114 |
HPL_pdpanel_new( GRID, ALGO, N, N+1, Mmin( N, nb ), A, 0, 0, tag, |
| 115 |
&panel[0] );
|
| 116 |
/*
|
| 117 |
* Loop over the columns of A
|
| 118 |
*/
|
| 119 |
for( j = 0; j < N; j += nb ) |
| 120 |
{
|
| 121 |
n = N - j; jb = Mmin( n, nb ); |
| 122 |
/*
|
| 123 |
* Release panel resources - re-initialize panel data structure
|
| 124 |
*/
|
| 125 |
(void) HPL_pdpanel_free( panel[0] ); |
| 126 |
HPL_pdpanel_init( GRID, ALGO, n, n+1, jb, A, j, j, tag, panel[0] ); |
| 127 |
/*
|
| 128 |
* Factor and broadcast current panel - update
|
| 129 |
*/
|
| 130 |
HPL_pdfact( panel[0] );
|
| 131 |
(void) HPL_binit( panel[0] ); |
| 132 |
do
|
| 133 |
{ (void) HPL_bcast( panel[0], &test ); }
|
| 134 |
while( test != HPL_SUCCESS );
|
| 135 |
(void) HPL_bwait( panel[0] ); |
| 136 |
HPL_pdupdate( NULL, NULL, panel[0], -1 ); |
| 137 |
/*
|
| 138 |
* Update message id for next factorization
|
| 139 |
*/
|
| 140 |
tag = MNxtMgid( tag, MSGID_BEGIN_FACT, MSGID_END_FACT ); |
| 141 |
} |
| 142 |
/*
|
| 143 |
* Release panel resources and panel list
|
| 144 |
*/
|
| 145 |
(void) HPL_pdpanel_disp( &panel[0] ); |
| 146 |
|
| 147 |
if( panel ) free( panel );
|
| 148 |
/*
|
| 149 |
* End of HPL_pdgesv0
|
| 150 |
*/
|
| 151 |
} |