Logo AND Algorithmique Numérique Distribuée

Public GIT Repository
plug (massive) leak with ptaskL07
[simgrid.git] / src / surf / network_ib.cpp
1 /* Copyright (c) 2014-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 <utility>
8
9 #include "simgrid/sg_config.h"
10 #include "src/surf/HostImpl.hpp"
11 #include "src/surf/maxmin_private.hpp"
12 #include "src/surf/network_ib.hpp"
13 #include "src/surf/xml/platf.hpp"
14 #include <boost/algorithm/string/classification.hpp>
15 #include <boost/algorithm/string/split.hpp>
16
17 XBT_LOG_EXTERNAL_DEFAULT_CATEGORY(surf_network);
18
19 static void IB_create_host_callback(simgrid::s4u::Host& host){
20   using simgrid::surf::NetworkIBModel;
21   using simgrid::surf::IBNode;
22
23   static int id=0;
24   // pour t->id -> rajouter une nouvelle struct dans le dict, pour stocker les comms actives
25   if(((NetworkIBModel*)surf_network_model)->active_nodes==nullptr)
26     ((NetworkIBModel*)surf_network_model)->active_nodes = xbt_dict_new_homogeneous(nullptr);
27
28   IBNode* act = new IBNode(id);
29
30   id++;
31   xbt_dict_set(((NetworkIBModel*)surf_network_model)->active_nodes, host.cname(), act, nullptr);
32 }
33
34 static void IB_action_state_changed_callback(simgrid::surf::NetworkAction* action)
35 {
36   using simgrid::surf::NetworkIBModel;
37   using simgrid::surf::IBNode;
38
39   if (action->getState() != simgrid::surf::Action::State::done)
40     return;
41   std::pair<IBNode*,IBNode*> pair = ((NetworkIBModel*)surf_network_model)->active_comms[action];
42   XBT_DEBUG("IB callback - action %p finished", action);
43
44   ((NetworkIBModel*)surf_network_model)->updateIBfactors(action, pair.first, pair.second, 1);
45
46   ((NetworkIBModel*)surf_network_model)->active_comms.erase(action);
47
48 }
49
50 static void IB_action_init_callback(simgrid::surf::NetworkAction* action, simgrid::s4u::Host* src,
51                                     simgrid::s4u::Host* dst)
52 {
53   simgrid::surf::NetworkIBModel* ibModel = (simgrid::surf::NetworkIBModel*)surf_network_model;
54
55   simgrid::surf::IBNode* act_src = (simgrid::surf::IBNode*)xbt_dict_get_or_null(ibModel->active_nodes, src->cname());
56   xbt_assert(act_src, "could not find src node active comms !");
57
58   simgrid::surf::IBNode* act_dst = (simgrid::surf::IBNode*)xbt_dict_get_or_null(ibModel->active_nodes, dst->cname());
59   xbt_assert(act_dst, "could not find dst node active comms !");
60
61   ibModel->active_comms[action]=std::make_pair(act_src, act_dst);
62
63   ibModel->updateIBfactors(action, act_src, act_dst, 0);
64 }
65
66 /*********
67  * Model *
68  *********/
69
70 /************************************************************************/
71 /* New model based on MPI contention model for Infiniband platforms */
72 /************************************************************************/
73 /* @Inproceedings{mescal_vienne_phd, */
74 /*  author={Jérôme Vienne}, */
75 /*  title={prédiction de performances d’applications de calcul haute performance sur réseau Infiniband}, */
76 /*  address={Grenoble FRANCE}, */
77 /*  month=june, */
78 /*  year={2010} */
79 /*  } */
80 void surf_network_model_init_IB()
81 {
82   if (surf_network_model)
83     return;
84
85   surf_network_model = new simgrid::surf::NetworkIBModel();
86   all_existing_models->push_back(surf_network_model);
87   simgrid::s4u::Link::onCommunicationStateChange.connect(IB_action_state_changed_callback);
88   simgrid::s4u::Link::onCommunicate.connect(IB_action_init_callback);
89   simgrid::s4u::Host::onCreation.connect(IB_create_host_callback);
90   xbt_cfg_setdefault_double("network/weight-S", 8775);
91
92 }
93
94 namespace simgrid {
95   namespace surf {
96
97     NetworkIBModel::NetworkIBModel()
98     : NetworkSmpiModel() {
99       haveGap_=false;
100       active_nodes=nullptr;
101
102       const char* IB_factors_string=xbt_cfg_get_string("smpi/IB-penalty-factors");
103       std::vector<std::string> radical_elements;
104       boost::split(radical_elements, IB_factors_string, boost::is_any_of(";"));
105
106       surf_parse_assert(radical_elements.size() == 3, "smpi/IB-penalty-factors should be provided and contain 3 "
107                                                       "elements, semi-colon separated. Example: 0.965;0.925;1.35");
108
109       Be = xbt_str_parse_double(radical_elements.front().c_str(),
110                                 "First part of smpi/IB-penalty-factors is not numerical: %s");
111       Bs = xbt_str_parse_double((radical_elements.at(1)).c_str(),
112                                 "Second part of smpi/IB-penalty-factors is not numerical: %s");
113       ys = xbt_str_parse_double(radical_elements.back().c_str(),
114                                 "Third part of smpi/IB-penalty-factors is not numerical: %s");
115     }
116
117     NetworkIBModel::~NetworkIBModel()
118     {
119       xbt_dict_cursor_t cursor = nullptr;
120       IBNode* instance = nullptr;
121       char *name = nullptr;
122       xbt_dict_foreach(active_nodes, cursor, name, instance)
123       delete instance;
124       xbt_dict_free(&active_nodes);
125     }
126
127     void NetworkIBModel::computeIBfactors(IBNode *root) {
128       double penalized_bw=0.0;
129       double num_comm_out = (double) root->ActiveCommsUp.size();
130       double max_penalty_out=0.0;
131       //first, compute all outbound penalties to get their max
132       for (std::vector<ActiveComm*>::iterator it= root->ActiveCommsUp.begin(); it != root->ActiveCommsUp.end(); ++it) {
133         double my_penalty_out = 1.0;
134
135         if(num_comm_out!=1){
136           if((*it)->destination->nbActiveCommsDown > 2)//number of comms sent to the receiving node
137             my_penalty_out = num_comm_out * Bs * ys;
138           else
139             my_penalty_out = num_comm_out * Bs;
140         }
141
142         max_penalty_out = std::max(max_penalty_out,my_penalty_out);
143       }
144
145       for (std::vector<ActiveComm*>::iterator it= root->ActiveCommsUp.begin(); it != root->ActiveCommsUp.end(); ++it) {
146
147         //compute inbound penalty
148         double my_penalty_in = 1.0;
149         int nb_comms = (*it)->destination->nbActiveCommsDown;//total number of incoming comms
150         if(nb_comms!=1)
151           my_penalty_in = ((*it)->destination->ActiveCommsDown)[root] //number of comm sent to dest by root node
152                                                                 * Be
153                                                                 * (*it)->destination->ActiveCommsDown.size();//number of different nodes sending to dest
154
155         double penalty = std::max(my_penalty_in,max_penalty_out);
156
157         double rate_before_update = (*it)->action->getBound();
158         //save initial rate of the action
159         if((*it)->init_rate==-1)
160           (*it)->init_rate= rate_before_update;
161
162         penalized_bw= ! num_comm_out ? (*it)->init_rate : (*it)->init_rate /penalty;
163
164         if (!double_equals(penalized_bw, rate_before_update, sg_surf_precision)){
165           XBT_DEBUG("%d->%d action %p penalty updated : bw now %f, before %f , initial rate %f", root->id,(*it)->destination->id,(*it)->action,penalized_bw, (*it)->action->getBound(), (*it)->init_rate );
166           lmm_update_variable_bound(maxminSystem_, (*it)->action->getVariable(), penalized_bw);
167         }else{
168           XBT_DEBUG("%d->%d action %p penalty not updated : bw %f, initial rate %f", root->id,(*it)->destination->id,(*it)->action,penalized_bw, (*it)->init_rate );
169         }
170
171       }
172       XBT_DEBUG("Finished computing IB penalties");
173     }
174
175     void NetworkIBModel::updateIBfactors_rec(IBNode *root, bool* updatedlist) {
176       if(updatedlist[root->id]==0){
177         XBT_DEBUG("IB - Updating rec %d", root->id);
178         computeIBfactors(root);
179         updatedlist[root->id]=1;
180         for (std::vector<ActiveComm*>::iterator it= root->ActiveCommsUp.begin(); it != root->ActiveCommsUp.end(); ++it) {
181           if(updatedlist[(*it)->destination->id]!=1)
182             updateIBfactors_rec((*it)->destination, updatedlist);
183         }
184         for (std::map<IBNode*, int>::iterator it= root->ActiveCommsDown.begin(); it != root->ActiveCommsDown.end(); ++it) {
185           if(updatedlist[it->first->id]!=1)
186             updateIBfactors_rec(it->first, updatedlist);
187         }
188       }
189     }
190
191
192     void NetworkIBModel::updateIBfactors(NetworkAction *action, IBNode *from, IBNode * to, int remove) {
193       if (from == to)//disregard local comms (should use loopback)
194         return;
195
196       bool* updated=(bool*)xbt_malloc0(xbt_dict_size(active_nodes)*sizeof(bool));
197       ActiveComm* comm=nullptr;
198       if(remove){
199         if(to->ActiveCommsDown[from]==1)
200           to->ActiveCommsDown.erase(from);
201         else
202           to->ActiveCommsDown[from]-=1;
203
204         to->nbActiveCommsDown--;
205         for (std::vector<ActiveComm*>::iterator it= from->ActiveCommsUp.begin();
206             it != from->ActiveCommsUp.end(); ++it) {
207           if((*it)->action==action){
208             comm=(*it);
209             from->ActiveCommsUp.erase(it);
210             break;
211           }
212         }
213         action->unref();
214
215       }else{
216         action->ref();
217         ActiveComm* comm=new ActiveComm();
218         comm->action=action;
219         comm->destination=to;
220         from->ActiveCommsUp.push_back(comm);
221
222         to->ActiveCommsDown[from]+=1;
223         to->nbActiveCommsDown++;
224       }
225       XBT_DEBUG("IB - Updating %d", from->id);
226       updateIBfactors_rec(from, updated);
227       XBT_DEBUG("IB - Finished updating %d", from->id);
228       if(comm)
229         delete comm;
230       xbt_free(updated);
231     }
232
233   }
234 }