1 /* Copyright (c) 2013-2017. 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. */
8 * Copyright (c) 2004-2005 The Trustees of Indiana University and Indiana
9 * University Research and Technology
10 * Corporation. All rights reserved.
11 * Copyright (c) 2004-2012 The University of Tennessee and The University
12 * of Tennessee Research Foundation. All rights
14 * Copyright (c) 2004-2005 High Performance Computing Center Stuttgart,
15 * University of Stuttgart. All rights reserved.
16 * Copyright (c) 2004-2005 The Regents of the University of California.
17 * All rights reserved.
18 * Copyright (c) 2008 Sun Microsystems, Inc. All rights reserved.
19 * Copyright (c) 2009 University of Houston. All rights reserved.
21 * Additional copyrights may follow
26 * (C) 2001 by Argonne National Laboratory.
27 * See COPYRIGHT in top-level directory.
29 /* Copyright (c) 2001-2014, The Ohio State University. All rights
32 * This file is part of the MVAPICH2 software package developed by the
33 * team members of The Ohio State University's Network-Based Computing
34 * Laboratory (NBCL), headed by Professor Dhabaleswar K. (DK) Panda.
36 * For detailed copyright and licensing information, please refer to the
37 * copyright file COPYRIGHT in the top level MVAPICH2 directory.
41 #include "../colls_private.hpp"
42 extern int mv2_reduce_intra_knomial_factor;
43 extern int mv2_reduce_inter_knomial_factor;
45 #define SMPI_DEFAULT_KNOMIAL_FACTOR 4
47 // int mv2_reduce_knomial_factor = 2;
51 static int MPIR_Reduce_knomial_trace(int root, int reduce_knomial_factor,
52 MPI_Comm comm, int *dst, int *expected_send_count,
53 int *expected_recv_count, int **src_array)
55 int mask=0x1, k, comm_size, src, rank, relative_rank, lroot=0;
57 int recv_iter=0, send_iter=0;
58 int *knomial_reduce_src_array=NULL;
59 comm_size = comm->size();
63 relative_rank = (rank - lroot + comm_size) % comm_size;
65 /* First compute to whom we need to send data */
66 while (mask < comm_size) {
67 if (relative_rank % (reduce_knomial_factor*mask)) {
68 *dst = relative_rank/(reduce_knomial_factor*mask)*
69 (reduce_knomial_factor*mask)+root;
70 if (*dst >= comm_size) {
76 mask *= reduce_knomial_factor;
78 mask /= reduce_knomial_factor;
80 /* Now compute how many children we have in the knomial-tree */
83 for(k=1;k<reduce_knomial_factor;k++) {
84 if (relative_rank + mask*k < comm_size) {
88 mask /= reduce_knomial_factor;
91 /* Finally, fill up the src array */
93 knomial_reduce_src_array = static_cast<int*>(smpi_get_tmp_sendbuffer(sizeof(int)*recv_iter));
99 for(k=1;k<reduce_knomial_factor;k++) {
100 if (relative_rank + mask*k < comm_size) {
102 if (src >= comm_size) {
105 knomial_reduce_src_array[recv_iter++] = src;
108 mask /= reduce_knomial_factor;
111 *expected_recv_count = recv_iter;
112 *expected_send_count = send_iter;
113 *src_array = knomial_reduce_src_array;
119 int Coll_reduce_mvapich2_knomial::reduce (
123 MPI_Datatype datatype,
128 int mpi_errno = MPI_SUCCESS;
129 int rank, is_commutative;
131 MPI_Request send_request;
133 MPI_Aint true_lb, true_extent, extent;
135 int recv_iter=0, dst=-1, expected_send_count, expected_recv_count;
138 MPI_Request *requests=NULL;
141 if (count == 0) return MPI_SUCCESS;
145 /* Create a temporary buffer */
147 datatype->extent(&true_lb, &true_extent);
148 extent = datatype->get_extent();
150 is_commutative = (op==MPI_OP_NULL || op->is_commutative());
153 recvbuf=(void *)smpi_get_tmp_recvbuffer(count*(MAX(extent,true_extent)));
154 recvbuf = (void *)((char*)recvbuf - true_lb);
157 if ((rank != root) || (sendbuf != MPI_IN_PLACE)) {
158 mpi_errno = Datatype::copy(sendbuf, count, datatype, recvbuf,
163 if(mv2_reduce_intra_knomial_factor<0)
165 mv2_reduce_intra_knomial_factor = SMPI_DEFAULT_KNOMIAL_FACTOR;
167 if(mv2_reduce_inter_knomial_factor<0)
169 mv2_reduce_inter_knomial_factor = SMPI_DEFAULT_KNOMIAL_FACTOR;
173 MPIR_Reduce_knomial_trace(root, mv2_reduce_intra_knomial_factor, comm,
174 &dst, &expected_send_count, &expected_recv_count, &src_array);
176 if(expected_recv_count > 0 ) {
177 tmp_buf = static_cast<void**>(xbt_malloc(sizeof(void *)*expected_recv_count));
178 requests = static_cast<MPI_Request*>(xbt_malloc(sizeof(MPI_Request)*expected_recv_count));
179 for(k=0; k < expected_recv_count; k++ ) {
180 tmp_buf[k] = smpi_get_tmp_sendbuffer(count*(MAX(extent,true_extent)));
181 tmp_buf[k] = (void *)((char*)tmp_buf[k] - true_lb);
184 while(recv_iter < expected_recv_count) {
185 src = src_array[expected_recv_count - (recv_iter+1)];
187 requests[recv_iter]=Request::irecv (tmp_buf[recv_iter], count, datatype ,src,
188 COLL_TAG_REDUCE, comm);
194 while(recv_iter < expected_recv_count) {
195 index=Request::waitany(expected_recv_count, requests,
199 if (is_commutative) {
200 if(op!=MPI_OP_NULL) op->apply( tmp_buf[index], recvbuf, &count, datatype);
204 for(k=0; k < expected_recv_count; k++ ) {
205 smpi_free_tmp_buffer(tmp_buf[k]);
211 if(src_array != NULL) {
216 send_request=Request::isend(recvbuf,count, datatype, dst,
217 COLL_TAG_REDUCE,comm);
219 Request::waitall(1, &send_request, &status);
221 smpi_free_tmp_buffer((void *)((char*)recvbuf + true_lb));
224 /* --END ERROR HANDLING-- */