Logo AND Algorithmique Numérique Distribuée

Public GIT Repository
Merge branch 'smpi_cpp'
[simgrid.git] / src / smpi / colls / smpi_automatic_selector.cpp
1 /* Copyright (c) 2013-2015. The SimGrid Team.
2  * All rights reserved.                                                     */
3
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. */
6
7 #include <float.h>
8
9 #include <exception>
10
11 #include "colls_private.h"
12
13 //attempt to do a quick autotuning version of the collective,
14
15 #define TRACE_AUTO_COLL(cat) if (TRACE_is_enabled()){\
16         type_t type = PJ_type_get_or_null (#cat, PJ_type_get_root());\
17          if (!type){\
18              type=PJ_type_event_new(#cat, PJ_type_get_root());\
19          }\
20          char cont_name[25];\
21          snprintf(cont_name,25, "rank-%d", smpi_process_index());\
22          val_t value = PJ_value_get_or_new(mpi_coll_##cat##_description[i].name,"1.0 1.0 1.0", type);\
23          new_pajeNewEvent (SIMIX_get_clock(), PJ_container_get(cont_name), type, value);\
24       }
25
26
27 #define AUTOMATIC_COLL_BENCH(cat, ret, args, args2)\
28     ret smpi_coll_tuned_ ## cat ## _ ## automatic(COLL_UNPAREN args)\
29 {\
30   double time1, time2, time_min=DBL_MAX;\
31   int min_coll=-1, global_coll=-1;\
32   int i;\
33   double buf_in, buf_out, max_min=DBL_MAX;\
34   for (i = 0; mpi_coll_##cat##_description[i].name; i++){\
35       if(!strcmp(mpi_coll_##cat##_description[i].name, "automatic"))continue;\
36       if(!strcmp(mpi_coll_##cat##_description[i].name, "default"))continue;\
37       smpi_mpi_barrier(comm);\
38       TRACE_AUTO_COLL(cat)\
39       time1 = SIMIX_get_clock();\
40       try {\
41       ((int (*) args)\
42           mpi_coll_##cat##_description[i].coll) args2 ;\
43       }\
44       catch (std::exception& ex) {\
45         continue;\
46       }\
47       time2 = SIMIX_get_clock();\
48       buf_out=time2-time1;\
49       smpi_mpi_reduce((void*)&buf_out,(void*)&buf_in, 1, MPI_DOUBLE, MPI_MAX, 0,comm );\
50       if(time2-time1<time_min){\
51           min_coll=i;\
52           time_min=time2-time1;\
53       }\
54       if(comm->rank()==0){\
55           if(buf_in<max_min){\
56               max_min=buf_in;\
57               global_coll=i;\
58           }\
59       }\
60   }\
61   if(comm->rank()==0){\
62       XBT_WARN("For rank 0, the quickest was %s : %f , but global was %s : %f at max",mpi_coll_##cat##_description[min_coll].name, time_min,mpi_coll_##cat##_description[global_coll].name, max_min);\
63   }else\
64   XBT_WARN("The quickest %s was %s on rank %d and took %f",#cat,mpi_coll_##cat##_description[min_coll].name, comm->rank(), time_min);\
65   return (min_coll!=-1)?MPI_SUCCESS:MPI_ERR_INTERN;\
66 }\
67
68
69 COLL_APPLY(AUTOMATIC_COLL_BENCH, COLL_ALLGATHERV_SIG, (send_buff, send_count, send_type, recv_buff, recv_count, recv_disps, recv_type, comm));
70 COLL_APPLY(AUTOMATIC_COLL_BENCH, COLL_ALLREDUCE_SIG, (sbuf, rbuf, rcount, dtype, op, comm));
71 COLL_APPLY(AUTOMATIC_COLL_BENCH, COLL_GATHER_SIG, (send_buff, send_count, send_type, recv_buff, recv_count, recv_type, root, comm));
72 COLL_APPLY(AUTOMATIC_COLL_BENCH, COLL_ALLGATHER_SIG, (send_buff,send_count,send_type,recv_buff,recv_count,recv_type,comm));
73 COLL_APPLY(AUTOMATIC_COLL_BENCH, COLL_ALLTOALL_SIG,(send_buff, send_count, send_type, recv_buff, recv_count, recv_type,comm));
74 COLL_APPLY(AUTOMATIC_COLL_BENCH, COLL_ALLTOALLV_SIG, (send_buff, send_counts, send_disps, send_type, recv_buff, recv_counts, recv_disps, recv_type, comm));
75 COLL_APPLY(AUTOMATIC_COLL_BENCH, COLL_BCAST_SIG , (buf, count, datatype, root, comm));
76 COLL_APPLY(AUTOMATIC_COLL_BENCH, COLL_REDUCE_SIG,(buf,rbuf, count, datatype, op, root, comm));
77 COLL_APPLY(AUTOMATIC_COLL_BENCH, COLL_REDUCE_SCATTER_SIG ,(sbuf,rbuf, rcounts,dtype,op,comm));
78 COLL_APPLY(AUTOMATIC_COLL_BENCH, COLL_SCATTER_SIG ,(sendbuf, sendcount, sendtype,recvbuf, recvcount, recvtype,root, comm));
79 COLL_APPLY(AUTOMATIC_COLL_BENCH, COLL_BARRIER_SIG,(comm));