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"
9 /*****************************************************************************
11 Copyright (c) 2006, Ahmad Faraj & Xin Yuan,
14 Redistribution and use in source and binary forms, with or without
15 modification, are permitted provided that the following conditions are met:
17 * Redistributions of source code must retain the above copyright notice,
18 this list of conditions and the following disclaimer.
20 * Redistributions in binary form must reproduce the above copyright notice,
21 this list of conditions and the following disclaimer in the documentation
22 and/or other materials provided with the distribution.
24 * Neither the name of the Florida State University nor the names of its
25 contributors may be used to endorse or promote products derived from this
26 software without specific prior written permission.
28 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
29 ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
30 WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
31 DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
32 ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
33 (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
34 LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
35 ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
36 (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
37 SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
39 *************************************************************************
40 * Any results obtained from executing this software require the *
41 * acknowledgment and citation of the software and its owners. *
42 * The full citation is given below: *
44 * A. Faraj and X. Yuan. "Automatic Generation and Tuning of MPI *
45 * Collective Communication Routines." The 19th ACM International *
46 * Conference on Supercomputing (ICS), Cambridge, Massachusetts, *
48 *************************************************************************
50 *****************************************************************************/
53 /*****************************************************************************
54 * Function: allgather_bruck
57 * send_buff: send input buffer
58 * send_count: number of elements to send
59 * send_type: data type of elements being sent
60 * recv_buff: receive output buffer
61 * recv_count: number of elements to received
62 * recv_type: data type of elements being received
64 * Descrp: Function realizes the allgather operation using the bruck
67 * Comment: Original bruck algorithm from MPICH is slightly modified by
69 ****************************************************************************/
76 int Coll_allgather_bruck::allgather(void *send_buff, int send_count,
77 MPI_Datatype send_type, void *recv_buff,
78 int recv_count, MPI_Datatype recv_type,
85 // local int variables
86 int src, dst, rank, num_procs, count, remainder;
87 int tag = COLL_TAG_ALLGATHER;
90 // local string variables
92 char *send_ptr = (char *) send_buff;
93 char *recv_ptr = (char *) recv_buff;
95 // get size of the communicator, followed by rank
96 num_procs = comm->size();
99 // get size of single element's type for recv buffer
100 recv_extent = recv_type->get_extent();
104 tmp_buff = (char *) smpi_get_tmp_sendbuffer(num_procs * recv_count * recv_extent);
106 // perform a local copy
107 Datatype::copy(send_ptr, send_count, send_type, tmp_buff, recv_count, recv_type);
108 while (pof2 <= (num_procs / 2)) {
109 src = (rank + pof2) % num_procs;
110 dst = (rank - pof2 + num_procs) % num_procs;
112 Request::sendrecv(tmp_buff, count, recv_type, dst, tag,
113 tmp_buff + count * recv_extent, count, recv_type,
114 src, tag, comm, &status);
119 remainder = num_procs - pof2;
121 src = (rank + pof2) % num_procs;
122 dst = (rank - pof2 + num_procs) % num_procs;
124 Request::sendrecv(tmp_buff, remainder * recv_count, recv_type, dst, tag,
125 tmp_buff + count * recv_extent, remainder * recv_count,
126 recv_type, src, tag, comm, &status);
129 Request::sendrecv(tmp_buff, (num_procs - rank) * recv_count, recv_type, rank,
130 tag, recv_ptr + rank * recv_count * recv_extent,
131 (num_procs - rank) * recv_count, recv_type, rank, tag, comm,
135 Request::sendrecv(tmp_buff + (num_procs - rank) * recv_count * recv_extent,
136 rank * recv_count, recv_type, rank, tag, recv_ptr,
137 rank * recv_count, recv_type, rank, tag, comm, &status);
138 smpi_free_tmp_buffer(tmp_buff);