123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213 |
- /*
- * -- High Performance Computing Linpack Benchmark (HPL)
- * HPL - 2.0 - September 10, 2008
- * Antoine P. Petitet
- * University of Tennessee, Knoxville
- * Innovative Computing Laboratory
- * (C) Copyright 2000-2008 All Rights Reserved
- *
- * -- Copyright notice and Licensing terms:
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- *
- * 1. Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- *
- * 2. Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions, and the following disclaimer in the
- * documentation and/or other materials provided with the distribution.
- *
- * 3. All advertising materials mentioning features or use of this
- * software must display the following acknowledgement:
- * This product includes software developed at the University of
- * Tennessee, Knoxville, Innovative Computing Laboratory.
- *
- * 4. The name of the University, the name of the Laboratory, or the
- * names of its contributors may not be used to endorse or promote
- * products derived from this software without specific written
- * permission.
- *
- * -- Disclaimer:
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE UNIVERSITY
- * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
- #ifndef HPL_GRID_H
- #define HPL_GRID_H
- /*
- * ---------------------------------------------------------------------
- * Include files
- * ---------------------------------------------------------------------
- */
- #include "hpl_pmisc.h"
- /*
- * ---------------------------------------------------------------------
- * #typedefs and data structures
- * ---------------------------------------------------------------------
- */
- typedef enum { HPL_INT = 100, HPL_DOUBLE = 101 } HPL_T_TYPE;
-
- typedef enum
- {
- HPL_ROW_MAJOR = 201,
- HPL_COLUMN_MAJOR = 202
- } HPL_T_ORDER;
- typedef struct HPL_S_grid
- {
- MPI_Comm all_comm; /* grid communicator */
- MPI_Comm row_comm; /* row communicator */
- MPI_Comm col_comm; /* column communicator */
- HPL_T_ORDER order; /* ordering of the procs in the grid */
- int iam; /* my rank in the grid */
- int myrow; /* my row number in the grid */
- int mycol; /* my column number in the grid */
- int nprow; /* the total # of rows in the grid */
- int npcol; /* the total # of columns in the grid */
- int nprocs; /* the total # of procs in the grid */
- int row_ip2; /* largest power of two <= nprow */
- int row_hdim; /* row_ip2 procs hypercube dimension */
- int row_ip2m1; /* largest power of two <= nprow-1 */
- int row_mask; /* row_ip2m1 procs hypercube mask */
- int col_ip2; /* largest power of two <= npcol */
- int col_hdim; /* col_ip2 procs hypercube dimension */
- int col_ip2m1; /* largest power of two <= npcol-1 */
- int col_mask; /* col_ip2m1 procs hypercube mask */
- } HPL_T_grid;
- /*
- * ---------------------------------------------------------------------
- * Data Structures
- * ---------------------------------------------------------------------
- */
- typedef void (*HPL_T_OP)
- ( const int, const void *, void *, const HPL_T_TYPE );
- /*
- * ---------------------------------------------------------------------
- * #define macros definitions
- * ---------------------------------------------------------------------
- */
- #define HPL_2_MPI_TYPE( typ ) \
- ( ( typ == HPL_INT ? MPI_INT : MPI_DOUBLE ) )
- /*
- * The following macros perform common modulo operations; All functions
- * except MPosMod assume arguments are < d (i.e., arguments are themsel-
- * ves within modulo range).
- */
- /* increment with mod */
- #define MModInc(I, d) if(++(I) == (d)) (I) = 0
- /* decrement with mod */
- #define MModDec(I, d) if(--(I) == -1) (I) = (d)-1
- /* positive modulo */
- #define MPosMod(I, d) ( (I) - ((I)/(d))*(d) )
- /* add two numbers */
- #define MModAdd(I1, I2, d) \
- ( ( (I1) + (I2) < (d) ) ? (I1) + (I2) : (I1) + (I2) - (d) )
- /* add 1 to # */
- #define MModAdd1(I, d) ( ((I) != (d)-1) ? (I) + 1 : 0 )
- /* subtract two numbers */
- #define MModSub(I1, I2, d) \
- ( ( (I1) < (I2) ) ? (d) + (I1) - (I2) : (I1) - (I2) )
- /* sub 1 from # */
- #define MModSub1(I, d) ( ((I)!=0) ? (I)-1 : (d)-1 )
- /*
- * ---------------------------------------------------------------------
- * grid function prototypes
- * ---------------------------------------------------------------------
- */
- int HPL_grid_init
- STDC_ARGS( (
- MPI_Comm,
- const HPL_T_ORDER,
- const int,
- const int,
- HPL_T_grid *
- ) );
- int HPL_grid_exit
- STDC_ARGS( (
- HPL_T_grid *
- ) );
- int HPL_grid_info
- STDC_ARGS( (
- const HPL_T_grid *,
- int *,
- int *,
- int *,
- int *
- ) );
- int HPL_pnum
- STDC_ARGS( (
- const HPL_T_grid *,
- const int,
- const int
- ) );
- int HPL_barrier
- STDC_ARGS( (
- MPI_Comm
- ) );
- int HPL_broadcast
- STDC_ARGS( (
- void *,
- const int,
- const HPL_T_TYPE,
- const int,
- MPI_Comm
- ) );
- int HPL_reduce
- STDC_ARGS( (
- void *,
- const int,
- const HPL_T_TYPE,
- const HPL_T_OP ,
- const int,
- MPI_Comm
- ) );
- int HPL_all_reduce
- STDC_ARGS( (
- void *,
- const int,
- const HPL_T_TYPE,
- const HPL_T_OP ,
- MPI_Comm
- ) );
- void HPL_max
- STDC_ARGS( (
- const int,
- const void *,
- void *,
- const HPL_T_TYPE
- ) );
- void HPL_min
- STDC_ARGS( (
- const int,
- const void *,
- void *,
- const HPL_T_TYPE
- ) );
- void HPL_sum
- STDC_ARGS( (
- const int,
- const void *,
- void *,
- const HPL_T_TYPE
- ) );
- #endif
- /*
- * End of hpl_grid.h
- */
|