root / src / pgesv / HPL_logsort.c
Historique | Voir | Annoter | Télécharger (7,59 ko)
| 1 | 1 | equemene | /*
|
|---|---|---|---|
| 2 | 1 | equemene | * -- High Performance Computing Linpack Benchmark (HPL)
|
| 3 | 1 | equemene | * HPL - 2.0 - September 10, 2008
|
| 4 | 1 | equemene | * Antoine P. Petitet
|
| 5 | 1 | equemene | * University of Tennessee, Knoxville
|
| 6 | 1 | equemene | * Innovative Computing Laboratory
|
| 7 | 1 | equemene | * (C) Copyright 2000-2008 All Rights Reserved
|
| 8 | 1 | equemene | *
|
| 9 | 1 | equemene | * -- Copyright notice and Licensing terms:
|
| 10 | 1 | equemene | *
|
| 11 | 1 | equemene | * Redistribution and use in source and binary forms, with or without
|
| 12 | 1 | equemene | * modification, are permitted provided that the following conditions
|
| 13 | 1 | equemene | * are met:
|
| 14 | 1 | equemene | *
|
| 15 | 1 | equemene | * 1. Redistributions of source code must retain the above copyright
|
| 16 | 1 | equemene | * notice, this list of conditions and the following disclaimer.
|
| 17 | 1 | equemene | *
|
| 18 | 1 | equemene | * 2. Redistributions in binary form must reproduce the above copyright
|
| 19 | 1 | equemene | * notice, this list of conditions, and the following disclaimer in the
|
| 20 | 1 | equemene | * documentation and/or other materials provided with the distribution.
|
| 21 | 1 | equemene | *
|
| 22 | 1 | equemene | * 3. All advertising materials mentioning features or use of this
|
| 23 | 1 | equemene | * software must display the following acknowledgement:
|
| 24 | 1 | equemene | * This product includes software developed at the University of
|
| 25 | 1 | equemene | * Tennessee, Knoxville, Innovative Computing Laboratory.
|
| 26 | 1 | equemene | *
|
| 27 | 1 | equemene | * 4. The name of the University, the name of the Laboratory, or the
|
| 28 | 1 | equemene | * names of its contributors may not be used to endorse or promote
|
| 29 | 1 | equemene | * products derived from this software without specific written
|
| 30 | 1 | equemene | * permission.
|
| 31 | 1 | equemene | *
|
| 32 | 1 | equemene | * -- Disclaimer:
|
| 33 | 1 | equemene | *
|
| 34 | 1 | equemene | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
| 35 | 1 | equemene | * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
| 36 | 1 | equemene | * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
| 37 | 1 | equemene | * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE UNIVERSITY
|
| 38 | 1 | equemene | * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
| 39 | 1 | equemene | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
| 40 | 1 | equemene | * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
| 41 | 1 | equemene | * DATA OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
| 42 | 1 | equemene | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
| 43 | 1 | equemene | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
| 44 | 1 | equemene | * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| 45 | 1 | equemene | * ---------------------------------------------------------------------
|
| 46 | 1 | equemene | */
|
| 47 | 1 | equemene | /*
|
| 48 | 1 | equemene | * Include files
|
| 49 | 1 | equemene | */
|
| 50 | 1 | equemene | #include "hpl.h" |
| 51 | 1 | equemene | |
| 52 | 1 | equemene | #ifdef STDC_HEADERS
|
| 53 | 1 | equemene | void HPL_logsort
|
| 54 | 1 | equemene | ( |
| 55 | 1 | equemene | const int NPROCS, |
| 56 | 1 | equemene | const int ICURROC, |
| 57 | 1 | equemene | int * IPLEN,
|
| 58 | 1 | equemene | int * IPMAP,
|
| 59 | 1 | equemene | int * IPMAPM1
|
| 60 | 1 | equemene | ) |
| 61 | 1 | equemene | #else
|
| 62 | 1 | equemene | void HPL_logsort
|
| 63 | 1 | equemene | ( NPROCS, ICURROC, IPLEN, IPMAP, IPMAPM1 ) |
| 64 | 1 | equemene | const int NPROCS; |
| 65 | 1 | equemene | const int ICURROC; |
| 66 | 1 | equemene | int * IPLEN;
|
| 67 | 1 | equemene | int * IPMAP;
|
| 68 | 1 | equemene | int * IPMAPM1;
|
| 69 | 1 | equemene | #endif
|
| 70 | 1 | equemene | {
|
| 71 | 1 | equemene | /*
|
| 72 | 1 | equemene | * Purpose
|
| 73 | 1 | equemene | * =======
|
| 74 | 1 | equemene | *
|
| 75 | 1 | equemene | * HPL_logsort computes an array IPMAP and its inverse IPMAPM1 that
|
| 76 | 1 | equemene | * contain the logarithmic sorted processes id with repect to the local
|
| 77 | 1 | equemene | * number of rows of U that they own. This is necessary to ensure that
|
| 78 | 1 | equemene | * the logarithmic spreading of U is optimal in terms of number of steps
|
| 79 | 1 | equemene | * and communication volume as well. In other words, the larget pieces
|
| 80 | 1 | equemene | * of U will be sent a minimal number of times.
|
| 81 | 1 | equemene | *
|
| 82 | 1 | equemene | * Arguments
|
| 83 | 1 | equemene | * =========
|
| 84 | 1 | equemene | *
|
| 85 | 1 | equemene | * NPROCS (global input) const int
|
| 86 | 1 | equemene | * On entry, NPROCS specifies the number of process rows in the
|
| 87 | 1 | equemene | * process grid. NPROCS is at least one.
|
| 88 | 1 | equemene | *
|
| 89 | 1 | equemene | * ICURROC (global input) const int
|
| 90 | 1 | equemene | * On entry, ICURROC is the source process row.
|
| 91 | 1 | equemene | *
|
| 92 | 1 | equemene | * IPLEN (global input/output) int *
|
| 93 | 1 | equemene | * On entry, IPLEN is an array of dimension NPROCS+1, such that
|
| 94 | 1 | equemene | * IPLEN[0] is 0, and IPLEN[i] contains the number of rows of U,
|
| 95 | 1 | equemene | * that process i-1 has. On exit, IPLEN[i] is the number of
|
| 96 | 1 | equemene | * rows of U in the processes before process IPMAP[i] after the
|
| 97 | 1 | equemene | * sort, with the convention that IPLEN[NPROCS] is the total
|
| 98 | 1 | equemene | * number of rows of the panel. In other words, IPLEN[i+1] -
|
| 99 | 1 | equemene | * IPLEN[i] is the number of rows of A that should be moved to
|
| 100 | 1 | equemene | * the process IPMAP[i]. IPLEN is such that the number of rows
|
| 101 | 1 | equemene | * of the source process row is IPLEN[1] - IPLEN[0], and the
|
| 102 | 1 | equemene | * remaining entries of this array are sorted so that the
|
| 103 | 1 | equemene | * quantities IPLEN[i+1]-IPLEN[i] are logarithmically sorted.
|
| 104 | 1 | equemene | *
|
| 105 | 1 | equemene | * IPMAP (global output) int *
|
| 106 | 1 | equemene | * On entry, IPMAP is an array of dimension NPROCS. On exit,
|
| 107 | 1 | equemene | * array contains the logarithmic mapping of the processes. In
|
| 108 | 1 | equemene | * other words, IPMAP[myroc] is the corresponding sorted process
|
| 109 | 1 | equemene | * coordinate.
|
| 110 | 1 | equemene | *
|
| 111 | 1 | equemene | * IPMAPM1 (global output) int *
|
| 112 | 1 | equemene | * On entry, IPMAPM1 is an array of dimension NPROCS. On exit,
|
| 113 | 1 | equemene | * this array contains the inverse of the logarithmic mapping
|
| 114 | 1 | equemene | * contained in IPMAP: IPMAPM1[ IPMAP[i] ] = i, for all i in
|
| 115 | 1 | equemene | * [0.. NPROCS)
|
| 116 | 1 | equemene | *
|
| 117 | 1 | equemene | * ---------------------------------------------------------------------
|
| 118 | 1 | equemene | */
|
| 119 | 1 | equemene | /*
|
| 120 | 1 | equemene | * .. Local Variables ..
|
| 121 | 1 | equemene | */
|
| 122 | 1 | equemene | int dist, i, ip, iplen_i, iplen_j, itmp, j, k;
|
| 123 | 1 | equemene | /* ..
|
| 124 | 1 | equemene | * .. Executable Statements ..
|
| 125 | 1 | equemene | */
|
| 126 | 1 | equemene | /*
|
| 127 | 1 | equemene | * Compute the logarithmic distance between process j and process 0, as
|
| 128 | 1 | equemene | * well as the maximum logarithmic distance. IPMAPM1 is workarray here.
|
| 129 | 1 | equemene | */
|
| 130 | 1 | equemene | for( j = 0, dist = 0; j < NPROCS; j++ ) |
| 131 | 1 | equemene | {
|
| 132 | 1 | equemene | IPMAP[j] = MModAdd( j, ICURROC, NPROCS ); ip = j; itmp = 0;
|
| 133 | 1 | equemene | do { if( ip & 1 ) itmp++; ip >>= 1; } while ( ip ); |
| 134 | 1 | equemene | IPMAPM1[j] = itmp; if( itmp > dist ) dist = itmp;
|
| 135 | 1 | equemene | } |
| 136 | 1 | equemene | /*
|
| 137 | 1 | equemene | * Shift IPLEN[1..NPROCS] of ICURROC places, so that IPLEN[1] is now
|
| 138 | 1 | equemene | * what used to be IPLEN[ICURROC+1]. Initialize IPMAP, so that IPMAP[0]
|
| 139 | 1 | equemene | * is ICURROC.
|
| 140 | 1 | equemene | */
|
| 141 | 1 | equemene | for( j = 0; j < ICURROC; j++ ) |
| 142 | 1 | equemene | {
|
| 143 | 1 | equemene | for( i = 2, itmp = IPLEN[1]; i <= NPROCS; i++ ) IPLEN[i-1] = IPLEN[i]; |
| 144 | 1 | equemene | IPLEN[NPROCS] = itmp; |
| 145 | 1 | equemene | } |
| 146 | 1 | equemene | /*
|
| 147 | 1 | equemene | * logarithmic sort
|
| 148 | 1 | equemene | */
|
| 149 | 1 | equemene | for( k = 1; k <= dist; k++ ) |
| 150 | 1 | equemene | {
|
| 151 | 1 | equemene | for( j = 1; j < NPROCS; j++ ) |
| 152 | 1 | equemene | {
|
| 153 | 1 | equemene | if( IPMAPM1[j] == k )
|
| 154 | 1 | equemene | {
|
| 155 | 1 | equemene | for( i = 2; i < NPROCS; i++ ) |
| 156 | 1 | equemene | {
|
| 157 | 1 | equemene | if( k < IPMAPM1[i] )
|
| 158 | 1 | equemene | {
|
| 159 | 1 | equemene | iplen_i = IPLEN[i+1]; iplen_j = IPLEN[j+1]; |
| 160 | 1 | equemene | |
| 161 | 1 | equemene | if( iplen_j < iplen_i )
|
| 162 | 1 | equemene | {
|
| 163 | 1 | equemene | IPLEN[j+1] = iplen_i; IPLEN[i+1] = iplen_j; |
| 164 | 1 | equemene | itmp = IPMAP[j]; IPMAP[j] = IPMAP[i]; |
| 165 | 1 | equemene | IPMAP[i] = itmp; |
| 166 | 1 | equemene | } |
| 167 | 1 | equemene | } |
| 168 | 1 | equemene | } |
| 169 | 1 | equemene | } |
| 170 | 1 | equemene | } |
| 171 | 1 | equemene | } |
| 172 | 1 | equemene | /*
|
| 173 | 1 | equemene | * Compute IPLEN and IPMAPM1 (the inverse of IPMAP)
|
| 174 | 1 | equemene | */
|
| 175 | 1 | equemene | IPLEN[0] = 0; |
| 176 | 1 | equemene | |
| 177 | 1 | equemene | for( i = 0; i < NPROCS; i++ ) |
| 178 | 1 | equemene | {
|
| 179 | 1 | equemene | IPMAPM1[ IPMAP[i] ] = i; |
| 180 | 1 | equemene | IPLEN[i+1] += IPLEN[i];
|
| 181 | 1 | equemene | } |
| 182 | 1 | equemene | /*
|
| 183 | 1 | equemene | * End of HPL_logsort
|
| 184 | 1 | equemene | */
|
| 185 | 1 | equemene | } |