/***************************************************************************** * * * Copyright (c) 2003-2006 Intel Corporation. * * All rights reserved. * * * ***************************************************************************** This code is covered by the Community Source License (CPL), version 1.0 as published by IBM and reproduced in the file "license.txt" in the "license" subdirectory. Redistribution in source and binary form, with or without modification, is permitted ONLY within the regulations contained in above mentioned license. Use of the name and trademark "Intel(R) MPI Benchmarks" is allowed ONLY within the regulations of the "License for Use of "Intel(R) MPI Benchmarks" Name and Trademark" as reproduced in the file "use-of-trademark-license.txt" in the "license" subdirectory. THE PROGRAM IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED INCLUDING, WITHOUT LIMITATION, ANY WARRANTIES OR CONDITIONS OF TITLE, NON-INFRINGEMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Each Recipient is solely responsible for determining the appropriateness of using and distributing the Program and assumes all risks associated with its exercise of rights under this Agreement, including but not limited to the risks and costs of program errors, compliance with applicable laws, damage to or loss of data, programs or equipment, and unavailability or interruption of operations. EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, NEITHER RECIPIENT NOR ANY CONTRIBUTORS SHALL HAVE ANY LIABILITY FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING WITHOUT LIMITATION LOST PROFITS), 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 OR DISTRIBUTION OF THE PROGRAM OR THE EXERCISE OF ANY RIGHTS GRANTED HEREUNDER, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. EXPORT LAWS: THIS LICENSE ADDS NO RESTRICTIONS TO THE EXPORT LAWS OF YOUR JURISDICTION. It is licensee's responsibility to comply with any export regulations applicable in licensee's jurisdiction. Under CURRENT U.S. export regulations this software is eligible for export from the U.S. and can be downloaded by or otherwise exported or reexported worldwide EXCEPT to U.S. embargoed destinations which include Cuba, Iraq, Libya, North Korea, Iran, Syria, Sudan, Afghanistan and any other country to which the U.S. has embargoed goods and services. *************************************************************************** For more documentation than found here, see [1] doc/ReadMe_IMB.txt [2] Intel (R) MPI Benchmarks Users Guide and Methodology Description In doc/IMB_ug.pdf File: IMB_pingpong.c Implemented functions: IMB_pingpong; ***************************************************************************/ #include "IMB_declare.h" #include "IMB_benchmark.h" #include "IMB_prototypes.h" /*************************************************************************/ void IMB_pingpong(struct comm_info* c_info, int size, int n_sample, MODES RUN_MODE, double* time) /* MPI-1 benchmark kernel 2 process MPI_Send + MPI_Recv pair Input variables: -c_info (type struct comm_info*) Collection of all base data for MPI; see [1] for more information -size (type int) Basic message size in bytes -n_sample (type int) Number of repetitions (for timing accuracy) -RUN_MODE (type MODES) (only MPI-2 case: see [1]) Output variables: -time (type double*) Timing result per sample */ { double t1, t2; int i; Type_Size s_size,r_size; int s_num, r_num; int s_tag, r_tag; int dest, source; MPI_Status stat; #ifdef CHECK defect=0; #endif ierr = 0; /* GET SIZE OF DATA TYPE */ MPI_Type_size(c_info->s_data_type,&s_size); MPI_Type_size(c_info->r_data_type,&r_size); if ((s_size!=0) && (r_size!=0)) { s_num=size/s_size; r_num=size/r_size; } s_tag = 1; r_tag = c_info->select_tag ? s_tag : MPI_ANY_TAG; if (c_info->rank == c_info->pair0) { /* CALCULATE SOURCE AND DESTINATION */ dest = c_info->pair1; source = c_info->select_source ? dest : MPI_ANY_SOURCE; for(i=0; icommunicator); t1 = MPI_Wtime(); for(i=0;i< n_sample;i++) { ierr = MPI_Send(c_info->s_buffer,s_num,c_info->s_data_type,dest, s_tag,c_info->communicator); MPI_ERRHAND(ierr); ierr = MPI_Recv(c_info->r_buffer,r_num,c_info->r_data_type,source, r_tag,c_info->communicator,&stat); MPI_ERRHAND(ierr); CHK_DIFF("PingPong",c_info, c_info->r_buffer, 0, size, size, asize, put, 0, n_sample, i, dest, &defect); } t2 = MPI_Wtime(); *time=(t2 - t1)/n_sample; } else if (c_info->rank == c_info->pair1) { dest =c_info->pair0 ; source = c_info->select_source ? dest : MPI_ANY_SOURCE; for(i=0; icommunicator); t1 = MPI_Wtime(); for(i=0 ;i< n_sample;i++) { ierr= MPI_Recv(c_info->r_buffer,r_num,c_info->r_data_type,source, r_tag,c_info->communicator,&stat); MPI_ERRHAND(ierr); ierr= MPI_Send(c_info->s_buffer,s_num,c_info->s_data_type,dest, s_tag,c_info->communicator); MPI_ERRHAND(ierr); CHK_DIFF("PingPong",c_info, c_info->r_buffer, 0, size, size, asize, put, 0, n_sample, i, dest, &defect); } t2 = MPI_Wtime(); *time=(t2 - t1)/n_sample; } else { *time = 0.; } }