1 /* Copyright (c) 2013-2019. The SimGrid Team.
2 * All rights reserved. */
4 /* This program is free software; you can redistribute it and/or modify it
5 * under the terms of the license (GNU LGPL) which comes with this package. */
7 #include "../colls_private.hpp"
8 /*****************************************************************************
10 * Function: alltoall_pair_mpi_barrier
15 send_buff: send input buffer
16 send_count: number of elements to send
17 send_type: data type of elements being sent
18 recv_buff: receive output buffer
19 recv_count: number of elements to received
20 recv_type: data type of elements being received
23 * Descrp: Function works when P is power of two. In each phase of P - 1
24 phases, nodes in pair communicate their data. MPI barriers are
25 inserted between each two phases.
29 ****************************************************************************/
32 int alltoallv__pair_mpi_barrier(const void *send_buff, const int *send_counts, const int *send_disps,
33 MPI_Datatype send_type,
34 void *recv_buff, const int *recv_counts, const int *recv_disps,
35 MPI_Datatype recv_type, MPI_Comm comm)
38 MPI_Aint send_chunk, recv_chunk;
39 int i, src, dst, rank, num_procs;
40 int tag = COLL_TAG_ALLTOALLV;
41 char *send_ptr = (char *) send_buff;
42 char *recv_ptr = (char *) recv_buff;
45 num_procs = comm->size();
47 if((num_procs&(num_procs-1)))
48 throw std::invalid_argument("alltoallv pair algorithm can't be used with non power of two number of processes!");
50 send_chunk = send_type->get_extent();
51 recv_chunk = recv_type->get_extent();
53 for (i = 0; i < num_procs; i++) {
56 Request::sendrecv(send_ptr + send_disps[dst] * send_chunk, send_counts[dst], send_type, dst,
57 tag, recv_ptr + recv_disps[src] * recv_chunk, recv_counts[src], recv_type,