Centre Blaise Pascal » HPL sur GPU

/*

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

 * ---------------------------------------------------------------------

 */

/*

 * Include files

 */

#include "hpl.h"

#ifdef STDC_HEADERS

int HPL_reduce

(

   void *                           BUFFER,

   const int                        COUNT,

   const HPL_T_TYPE                 DTYPE,

   const HPL_T_OP                   OP,

   const int                        ROOT,

   MPI_Comm                         COMM

)

#else

int HPL_reduce

( BUFFER, COUNT, DTYPE, OP, ROOT, COMM )

   void *                           BUFFER;

   const int                        COUNT;

   const HPL_T_TYPE                 DTYPE;

   const HPL_T_OP                   OP;

   const int                        ROOT;

   MPI_Comm                         COMM;

#endif

{

/*

 * Purpose

 * =======

 *

 * HPL_reduce performs a global reduce operation across all processes of

 * a group.  Note that the input buffer is  used as workarray and in all

 * processes but the accumulating process corrupting the original data.

 *

 * Arguments

 * =========

 *

 * BUFFER  (local input/output)          void *

 *         On entry,  BUFFER  points to  the  buffer to be  reduced.  On

 *         exit,  and  in process of rank  ROOT  this array contains the

 *         reduced data.  This  buffer  is also used as workspace during

 *         the operation in the other processes of the group.

 *

 * COUNT   (global input)                const int

 *         On entry,  COUNT  indicates the number of entries in  BUFFER.

 *         COUNT must be at least zero.

 *

 * DTYPE   (global input)                const HPL_T_TYPE

 *         On entry,  DTYPE  specifies the type of the buffers operands.

 *

 * OP      (global input)                const HPL_T_OP

 *         On entry, OP is a pointer to the local combine function.

 *

 * ROOT    (global input)                const int

 *         On entry, ROOT is the coordinate of the accumulating process.

 *

 * COMM    (global/local input)          MPI_Comm

 *         The MPI communicator identifying the process collection.

 *

 * ---------------------------------------------------------------------

 */

/*

 * .. Local Variables ..

 */

   MPI_Status                 status;

   void                       * buffer = NULL;

   int                        hplerr=MPI_SUCCESS, d=1, i, ip2=1, mask=0,

                              mpierr, mydist, partner, rank, size,

                              tag = MSGID_BEGIN_COLL;

/* ..

 * .. Executable Statements ..

 */

   if( COUNT <= 0 ) return( MPI_SUCCESS );

   mpierr = MPI_Comm_size( COMM, &size );

   if( size  == 1 ) return( MPI_SUCCESS );

   mpierr = MPI_Comm_rank( COMM, &rank );

   i = size - 1; while( i > 1 ) { i >>= 1; d++; }

   if( DTYPE == HPL_INT )

      buffer = (void *)( (int *)   malloc( (size_t)(COUNT) *

                                           sizeof( int    ) ) );

   else

      buffer = (void *)( (double *)malloc( (size_t)(COUNT) *

                                           sizeof( double ) ) );

   if( !( buffer ) )

   { HPL_pabort( __LINE__, "HPL_reduce", "Memory allocation failed" ); }

   if( ( mydist = MModSub( rank, ROOT, size ) ) == 0 )

   {

      do

      {

         mpierr = MPI_Recv( buffer, COUNT, HPL_2_MPI_TYPE( DTYPE ),

                            MModAdd( ROOT, ip2, size ), tag, COMM,

                            &status );

         if( mpierr != MPI_SUCCESS ) hplerr = mpierr;

         OP( COUNT, buffer, BUFFER, DTYPE );

         ip2 <<= 1; d--;

      } while( d );

   }

   else

   {

      do

      {

         if( ( mydist & mask ) == 0 )

         {

            partner = mydist ^ ip2;

            if( mydist & ip2 )

            {

               partner = MModAdd( ROOT, partner, size );

               mpierr = MPI_Send( BUFFER, COUNT, HPL_2_MPI_TYPE( DTYPE ),

                                  partner, tag, COMM );

            }

            else if( partner < size )

            {

               partner = MModAdd( ROOT, partner, size );

               mpierr  = MPI_Recv( buffer, COUNT, HPL_2_MPI_TYPE( DTYPE ),

                                   partner, tag, COMM, &status );

               OP( COUNT, buffer, BUFFER, DTYPE );

            }

            if( mpierr != MPI_SUCCESS ) hplerr = mpierr;

         }

         mask ^= ip2; ip2 <<= 1; d--;

      } while( d );

   }

   if( buffer ) free( buffer );

   return( hplerr );

/*

 * End of HPL_reduce

 */

}