root / include / hpl_grid.h @ 9
Historique | Voir | Annoter | Télécharger (8,17 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 | #ifndef HPL_GRID_H
|
| 47 | 1 | equemene | #define HPL_GRID_H
|
| 48 | 1 | equemene | /*
|
| 49 | 1 | equemene | * ---------------------------------------------------------------------
|
| 50 | 1 | equemene | * Include files
|
| 51 | 1 | equemene | * ---------------------------------------------------------------------
|
| 52 | 1 | equemene | */
|
| 53 | 1 | equemene | #include "hpl_pmisc.h" |
| 54 | 1 | equemene | /*
|
| 55 | 1 | equemene | * ---------------------------------------------------------------------
|
| 56 | 1 | equemene | * #typedefs and data structures
|
| 57 | 1 | equemene | * ---------------------------------------------------------------------
|
| 58 | 1 | equemene | */
|
| 59 | 1 | equemene | typedef enum { HPL_INT = 100, HPL_DOUBLE = 101 } HPL_T_TYPE; |
| 60 | 1 | equemene | |
| 61 | 1 | equemene | typedef enum |
| 62 | 1 | equemene | {
|
| 63 | 1 | equemene | HPL_ROW_MAJOR = 201,
|
| 64 | 1 | equemene | HPL_COLUMN_MAJOR = 202
|
| 65 | 1 | equemene | } HPL_T_ORDER; |
| 66 | 1 | equemene | |
| 67 | 1 | equemene | typedef struct HPL_S_grid |
| 68 | 1 | equemene | {
|
| 69 | 1 | equemene | MPI_Comm all_comm; /* grid communicator */
|
| 70 | 1 | equemene | MPI_Comm row_comm; /* row communicator */
|
| 71 | 1 | equemene | MPI_Comm col_comm; /* column communicator */
|
| 72 | 1 | equemene | HPL_T_ORDER order; /* ordering of the procs in the grid */
|
| 73 | 1 | equemene | int iam; /* my rank in the grid */ |
| 74 | 1 | equemene | int myrow; /* my row number in the grid */ |
| 75 | 1 | equemene | int mycol; /* my column number in the grid */ |
| 76 | 1 | equemene | int nprow; /* the total # of rows in the grid */ |
| 77 | 1 | equemene | int npcol; /* the total # of columns in the grid */ |
| 78 | 1 | equemene | int nprocs; /* the total # of procs in the grid */ |
| 79 | 1 | equemene | int row_ip2; /* largest power of two <= nprow */ |
| 80 | 1 | equemene | int row_hdim; /* row_ip2 procs hypercube dimension */ |
| 81 | 1 | equemene | int row_ip2m1; /* largest power of two <= nprow-1 */ |
| 82 | 1 | equemene | int row_mask; /* row_ip2m1 procs hypercube mask */ |
| 83 | 1 | equemene | int col_ip2; /* largest power of two <= npcol */ |
| 84 | 1 | equemene | int col_hdim; /* col_ip2 procs hypercube dimension */ |
| 85 | 1 | equemene | int col_ip2m1; /* largest power of two <= npcol-1 */ |
| 86 | 1 | equemene | int col_mask; /* col_ip2m1 procs hypercube mask */ |
| 87 | 1 | equemene | } HPL_T_grid; |
| 88 | 1 | equemene | |
| 89 | 1 | equemene | /*
|
| 90 | 1 | equemene | * ---------------------------------------------------------------------
|
| 91 | 1 | equemene | * Data Structures
|
| 92 | 1 | equemene | * ---------------------------------------------------------------------
|
| 93 | 1 | equemene | */
|
| 94 | 1 | equemene | typedef void (*HPL_T_OP) |
| 95 | 1 | equemene | ( const int, const void *, void *, const HPL_T_TYPE ); |
| 96 | 1 | equemene | /*
|
| 97 | 1 | equemene | * ---------------------------------------------------------------------
|
| 98 | 1 | equemene | * #define macros definitions
|
| 99 | 1 | equemene | * ---------------------------------------------------------------------
|
| 100 | 1 | equemene | */
|
| 101 | 1 | equemene | #define HPL_2_MPI_TYPE( typ ) \
|
| 102 | 1 | equemene | ( ( typ == HPL_INT ? MPI_INT : MPI_DOUBLE ) ) |
| 103 | 1 | equemene | /*
|
| 104 | 1 | equemene | * The following macros perform common modulo operations; All functions
|
| 105 | 1 | equemene | * except MPosMod assume arguments are < d (i.e., arguments are themsel-
|
| 106 | 1 | equemene | * ves within modulo range).
|
| 107 | 1 | equemene | */
|
| 108 | 1 | equemene | /* increment with mod */
|
| 109 | 1 | equemene | #define MModInc(I, d) if(++(I) == (d)) (I) = 0 |
| 110 | 1 | equemene | /* decrement with mod */
|
| 111 | 1 | equemene | #define MModDec(I, d) if(--(I) == -1) (I) = (d)-1 |
| 112 | 1 | equemene | /* positive modulo */
|
| 113 | 1 | equemene | #define MPosMod(I, d) ( (I) - ((I)/(d))*(d) )
|
| 114 | 1 | equemene | /* add two numbers */
|
| 115 | 1 | equemene | #define MModAdd(I1, I2, d) \
|
| 116 | 1 | equemene | ( ( (I1) + (I2) < (d) ) ? (I1) + (I2) : (I1) + (I2) - (d) ) |
| 117 | 1 | equemene | /* add 1 to # */
|
| 118 | 1 | equemene | #define MModAdd1(I, d) ( ((I) != (d)-1) ? (I) + 1 : 0 ) |
| 119 | 1 | equemene | /* subtract two numbers */
|
| 120 | 1 | equemene | #define MModSub(I1, I2, d) \
|
| 121 | 1 | equemene | ( ( (I1) < (I2) ) ? (d) + (I1) - (I2) : (I1) - (I2) ) |
| 122 | 1 | equemene | /* sub 1 from # */
|
| 123 | 1 | equemene | #define MModSub1(I, d) ( ((I)!=0) ? (I)-1 : (d)-1 ) |
| 124 | 1 | equemene | /*
|
| 125 | 1 | equemene | * ---------------------------------------------------------------------
|
| 126 | 1 | equemene | * grid function prototypes
|
| 127 | 1 | equemene | * ---------------------------------------------------------------------
|
| 128 | 1 | equemene | */
|
| 129 | 1 | equemene | int HPL_grid_init
|
| 130 | 1 | equemene | STDC_ARGS( ( |
| 131 | 1 | equemene | MPI_Comm, |
| 132 | 1 | equemene | const HPL_T_ORDER,
|
| 133 | 1 | equemene | const int, |
| 134 | 1 | equemene | const int, |
| 135 | 1 | equemene | HPL_T_grid * |
| 136 | 1 | equemene | ) ); |
| 137 | 1 | equemene | int HPL_grid_exit
|
| 138 | 1 | equemene | STDC_ARGS( ( |
| 139 | 1 | equemene | HPL_T_grid * |
| 140 | 1 | equemene | ) ); |
| 141 | 1 | equemene | |
| 142 | 1 | equemene | int HPL_grid_info
|
| 143 | 1 | equemene | STDC_ARGS( ( |
| 144 | 1 | equemene | const HPL_T_grid *,
|
| 145 | 1 | equemene | int *,
|
| 146 | 1 | equemene | int *,
|
| 147 | 1 | equemene | int *,
|
| 148 | 1 | equemene | int *
|
| 149 | 1 | equemene | ) ); |
| 150 | 1 | equemene | int HPL_pnum
|
| 151 | 1 | equemene | STDC_ARGS( ( |
| 152 | 1 | equemene | const HPL_T_grid *,
|
| 153 | 1 | equemene | const int, |
| 154 | 1 | equemene | const int |
| 155 | 1 | equemene | ) ); |
| 156 | 1 | equemene | |
| 157 | 1 | equemene | int HPL_barrier
|
| 158 | 1 | equemene | STDC_ARGS( ( |
| 159 | 1 | equemene | MPI_Comm |
| 160 | 1 | equemene | ) ); |
| 161 | 1 | equemene | int HPL_broadcast
|
| 162 | 1 | equemene | STDC_ARGS( ( |
| 163 | 1 | equemene | void *,
|
| 164 | 1 | equemene | const int, |
| 165 | 1 | equemene | const HPL_T_TYPE,
|
| 166 | 1 | equemene | const int, |
| 167 | 1 | equemene | MPI_Comm |
| 168 | 1 | equemene | ) ); |
| 169 | 1 | equemene | int HPL_reduce
|
| 170 | 1 | equemene | STDC_ARGS( ( |
| 171 | 1 | equemene | void *,
|
| 172 | 1 | equemene | const int, |
| 173 | 1 | equemene | const HPL_T_TYPE,
|
| 174 | 1 | equemene | const HPL_T_OP ,
|
| 175 | 1 | equemene | const int, |
| 176 | 1 | equemene | MPI_Comm |
| 177 | 1 | equemene | ) ); |
| 178 | 1 | equemene | int HPL_all_reduce
|
| 179 | 1 | equemene | STDC_ARGS( ( |
| 180 | 1 | equemene | void *,
|
| 181 | 1 | equemene | const int, |
| 182 | 1 | equemene | const HPL_T_TYPE,
|
| 183 | 1 | equemene | const HPL_T_OP ,
|
| 184 | 1 | equemene | MPI_Comm |
| 185 | 1 | equemene | ) ); |
| 186 | 1 | equemene | |
| 187 | 1 | equemene | void HPL_max
|
| 188 | 1 | equemene | STDC_ARGS( ( |
| 189 | 1 | equemene | const int, |
| 190 | 1 | equemene | const void *, |
| 191 | 1 | equemene | void *,
|
| 192 | 1 | equemene | const HPL_T_TYPE
|
| 193 | 1 | equemene | ) ); |
| 194 | 1 | equemene | void HPL_min
|
| 195 | 1 | equemene | STDC_ARGS( ( |
| 196 | 1 | equemene | const int, |
| 197 | 1 | equemene | const void *, |
| 198 | 1 | equemene | void *,
|
| 199 | 1 | equemene | const HPL_T_TYPE
|
| 200 | 1 | equemene | ) ); |
| 201 | 1 | equemene | void HPL_sum
|
| 202 | 1 | equemene | STDC_ARGS( ( |
| 203 | 1 | equemene | const int, |
| 204 | 1 | equemene | const void *, |
| 205 | 1 | equemene | void *,
|
| 206 | 1 | equemene | const HPL_T_TYPE
|
| 207 | 1 | equemene | ) ); |
| 208 | 1 | equemene | |
| 209 | 1 | equemene | #endif
|
| 210 | 1 | equemene | /*
|
| 211 | 1 | equemene | * End of hpl_grid.h
|
| 212 | 1 | equemene | */ |