1 /* Copyright (c) 2014-2017. The SimGrid Team. All rights reserved. */
3 /* This program is free software; you can redistribute it and/or modify it
4 * under the terms of the license (GNU LGPL) which comes with this package. */
6 #include "src/kernel/routing/DragonflyZone.hpp"
7 #include "src/kernel/routing/NetPoint.hpp"
8 #include "src/surf/network_interface.hpp"
10 #include <boost/algorithm/string/classification.hpp>
11 #include <boost/algorithm/string/split.hpp>
14 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route_cluster_dragonfly, surf_route_cluster, "Dragonfly Routing part of surf");
20 DragonflyZone::DragonflyZone(NetZone* father, std::string name) : ClusterZone(father, name)
24 DragonflyZone::~DragonflyZone()
26 if (this->routers_ != nullptr) {
27 for (unsigned int i = 0; i < this->numGroups_ * this->numChassisPerGroup_ * this->numBladesPerChassis_; i++)
33 void DragonflyZone::rankId_to_coords(int rankId, unsigned int (*coords)[4])
35 // coords : group, chassis, blade, node
36 (*coords)[0] = rankId / (numChassisPerGroup_ * numBladesPerChassis_ * numNodesPerBlade_);
37 rankId = rankId % (numChassisPerGroup_ * numBladesPerChassis_ * numNodesPerBlade_);
38 (*coords)[1] = rankId / (numBladesPerChassis_ * numNodesPerBlade_);
39 rankId = rankId % (numBladesPerChassis_ * numNodesPerBlade_);
40 (*coords)[2] = rankId / numNodesPerBlade_;
41 (*coords)[3] = rankId % numNodesPerBlade_;
44 void DragonflyZone::parse_specific_arguments(ClusterCreationArgs* cluster)
46 std::vector<std::string> parameters;
47 std::vector<std::string> tmp;
48 boost::split(parameters, cluster->topo_parameters, boost::is_any_of(";"));
50 // TODO : we have to check for zeros and negative numbers, or it might crash
51 if (parameters.size() != 4) {
53 "Dragonfly are defined by the number of groups, chassis per groups, blades per chassis, nodes per blade");
56 // Blue network : number of groups, number of links between each group
57 boost::split(tmp, parameters[0], boost::is_any_of(","));
58 if (tmp.size() != 2) {
59 surf_parse_error("Dragonfly topologies are defined by 3 levels with 2 elements each, and one with one element");
63 this->numGroups_ = std::stoi(tmp[0]);
64 } catch (std::invalid_argument& ia) {
65 throw std::invalid_argument(std::string("Invalid number of groups:") + tmp[0]);
69 this->numLinksBlue_ = std::stoi(tmp[1]);
70 } catch (std::invalid_argument& ia) {
71 throw std::invalid_argument(std::string("Invalid number of links for the blue level:") + tmp[1]);
73 // Black network : number of chassis/group, number of links between each router on the black network
74 boost::split(tmp, parameters[1], boost::is_any_of(","));
75 if (tmp.size() != 2) {
76 surf_parse_error("Dragonfly topologies are defined by 3 levels with 2 elements each, and one with one element");
80 this->numChassisPerGroup_ = std::stoi(tmp[0]);
81 } catch (std::invalid_argument& ia) {
82 throw std::invalid_argument(std::string("Invalid number of groups:") + tmp[0]);
86 this->numLinksBlack_ = std::stoi(tmp[1]);
87 } catch (std::invalid_argument& ia) {
88 throw std::invalid_argument(std::string("Invalid number of links for the black level:") + tmp[1]);
91 // Green network : number of blades/chassis, number of links between each router on the green network
92 boost::split(tmp, parameters[2], boost::is_any_of(","));
93 if (tmp.size() != 2) {
94 surf_parse_error("Dragonfly topologies are defined by 3 levels with 2 elements each, and one with one element");
98 this->numBladesPerChassis_ = std::stoi(tmp[0]);
99 } catch (std::invalid_argument& ia) {
100 throw std::invalid_argument(std::string("Invalid number of groups:") + tmp[0]);
104 this->numLinksGreen_ = std::stoi(tmp[1]);
105 } catch (std::invalid_argument& ia) {
106 throw std::invalid_argument(std::string("Invalid number of links for the green level:") + tmp[1]);
109 // The last part of topo_parameters should be the number of nodes per blade
111 this->numNodesPerBlade_ = std::stoi(parameters[3]);
112 } catch (std::invalid_argument& ia) {
113 throw std::invalid_argument(std::string("Last parameter is not the amount of nodes per blade:") + parameters[3]);
116 this->cluster_ = cluster;
120 * Generate the cluster once every node is created
122 void DragonflyZone::seal()
124 if (this->numNodesPerBlade_ == 0) {
128 this->generateRouters();
129 this->generateLinks();
132 DragonflyRouter::DragonflyRouter(int group, int chassis, int blade) : group_(group), chassis_(chassis), blade_(blade)
136 DragonflyRouter::~DragonflyRouter()
138 if (this->myNodes_ != nullptr)
140 if (this->greenLinks_ != nullptr)
141 xbt_free(greenLinks_);
142 if (this->blackLinks_ != nullptr)
143 xbt_free(blackLinks_);
144 if (this->blueLinks_ != nullptr)
145 xbt_free(blueLinks_);
148 void DragonflyZone::generateRouters()
150 this->routers_ = static_cast<DragonflyRouter**>(xbt_malloc0(this->numGroups_ * this->numChassisPerGroup_ *
151 this->numBladesPerChassis_ * sizeof(DragonflyRouter*)));
153 for (unsigned int i = 0; i < this->numGroups_; i++) {
154 for (unsigned int j = 0; j < this->numChassisPerGroup_; j++) {
155 for (unsigned int k = 0; k < this->numBladesPerChassis_; k++) {
156 DragonflyRouter* router = new DragonflyRouter(i, j, k);
157 this->routers_[i * this->numChassisPerGroup_ * this->numBladesPerChassis_ + j * this->numBladesPerChassis_ +
164 void DragonflyZone::createLink(const std::string& id, int numlinks, surf::LinkImpl** linkup, surf::LinkImpl** linkdown)
168 LinkCreationArgs linkTemplate;
169 linkTemplate.bandwidth = this->cluster_->bw * numlinks;
170 linkTemplate.latency = this->cluster_->lat;
171 linkTemplate.policy = this->cluster_->sharing_policy; // sthg to do with that ?
172 linkTemplate.id = id;
173 sg_platf_new_link(&linkTemplate);
174 XBT_DEBUG("Generating link %s", id.c_str());
175 surf::LinkImpl* link;
177 if (this->cluster_->sharing_policy == SURF_LINK_FULLDUPLEX) {
178 tmpID = linkTemplate.id + "_UP";
179 link = surf::LinkImpl::byName(tmpID);
180 *linkup = link; // check link?
181 tmpID = linkTemplate.id + "_DOWN";
182 link = surf::LinkImpl::byName(tmpID);
183 *linkdown = link; // check link ?
185 link = surf::LinkImpl::byName(linkTemplate.id);
191 void DragonflyZone::generateLinks()
193 static int uniqueId = 0;
194 surf::LinkImpl* linkup;
195 surf::LinkImpl* linkdown;
197 unsigned int numRouters = this->numGroups_ * this->numChassisPerGroup_ * this->numBladesPerChassis_;
199 if (this->cluster_->sharing_policy == SURF_LINK_FULLDUPLEX)
200 numLinksperLink_ = 2;
202 // Links from routers to their local nodes.
203 for (unsigned int i = 0; i < numRouters; i++) {
204 // allocate structures
205 this->routers_[i]->myNodes_ = static_cast<surf::LinkImpl**>(
206 xbt_malloc0(numLinksperLink_ * this->numNodesPerBlade_ * sizeof(surf::LinkImpl*)));
207 this->routers_[i]->greenLinks_ =
208 static_cast<surf::LinkImpl**>(xbt_malloc0(this->numBladesPerChassis_ * sizeof(surf::LinkImpl*)));
209 this->routers_[i]->blackLinks_ =
210 static_cast<surf::LinkImpl**>(xbt_malloc0(this->numChassisPerGroup_ * sizeof(surf::LinkImpl*)));
212 for (unsigned int j = 0; j < numLinksperLink_ * this->numNodesPerBlade_; j += numLinksperLink_) {
213 std::string id = "local_link_from_router_"+ std::to_string(i) + "_to_node_" +
214 std::to_string(j / numLinksperLink_) + "_" + std::to_string(uniqueId);
215 this->createLink(id, 1, &linkup, &linkdown);
217 if (this->cluster_->sharing_policy == SURF_LINK_FULLDUPLEX) {
218 this->routers_[i]->myNodes_[j] = linkup;
219 this->routers_[i]->myNodes_[j + 1] = linkdown;
221 this->routers_[i]->myNodes_[j] = linkup;
227 // Green links from routers to same chassis routers - alltoall
228 for (unsigned int i = 0; i < this->numGroups_ * this->numChassisPerGroup_; i++) {
229 for (unsigned int j = 0; j < this->numBladesPerChassis_; j++) {
230 for (unsigned int k = j + 1; k < this->numBladesPerChassis_; k++) {
231 std::string id = "green_link_in_chassis_" + std::to_string(i % numChassisPerGroup_) +"_between_routers_" +
232 std::to_string(j) + "_and_" + std::to_string(k) + "_" + std::to_string(uniqueId);
233 this->createLink(id, this->numLinksGreen_, &linkup, &linkdown);
235 this->routers_[i * numBladesPerChassis_ + j]->greenLinks_[k] = linkup;
236 this->routers_[i * numBladesPerChassis_ + k]->greenLinks_[j] = linkdown;
242 // Black links from routers to same group routers - alltoall
243 for (unsigned int i = 0; i < this->numGroups_; i++) {
244 for (unsigned int j = 0; j < this->numChassisPerGroup_; j++) {
245 for (unsigned int k = j + 1; k < this->numChassisPerGroup_; k++) {
246 for (unsigned int l = 0; l < this->numBladesPerChassis_; l++) {
247 std::string id = "black_link_in_group_" + std::to_string(i) + "_between_chassis_" + std::to_string(j) +
248 "_and_" + std::to_string(k) +"_blade_" + std::to_string(l) + "_" + std::to_string(uniqueId);
249 this->createLink(id, this->numLinksBlack_, &linkup, &linkdown);
251 this->routers_[i * numBladesPerChassis_ * numChassisPerGroup_ + j * numBladesPerChassis_ + l]
252 ->blackLinks_[k] = linkup;
253 this->routers_[i * numBladesPerChassis_ * numChassisPerGroup_ + k * numBladesPerChassis_ + l]
254 ->blackLinks_[j] = linkdown;
261 // Blue links between groups - Not all routers involved, only one per group is linked to others. Let's say router n of
262 // each group is linked to group n.
263 // FIXME: in reality blue links may be attached to several different routers
264 for (unsigned int i = 0; i < this->numGroups_; i++) {
265 for (unsigned int j = i + 1; j < this->numGroups_; j++) {
266 unsigned int routernumi = i * numBladesPerChassis_ * numChassisPerGroup_ + j;
267 unsigned int routernumj = j * numBladesPerChassis_ * numChassisPerGroup_ + i;
268 this->routers_[routernumi]->blueLinks_ = static_cast<surf::LinkImpl**>(xbt_malloc0(sizeof(surf::LinkImpl*)));
269 this->routers_[routernumj]->blueLinks_ = static_cast<surf::LinkImpl**>(xbt_malloc0(sizeof(surf::LinkImpl*)));
270 std::string id = "blue_link_between_group_"+ std::to_string(i) +"_and_" + std::to_string(j) +"_routers_" +
271 std::to_string(routernumi) + "_and_" + std::to_string(routernumj) + "_" + std::to_string(uniqueId);
272 this->createLink(id, this->numLinksBlue_, &linkup, &linkdown);
274 this->routers_[routernumi]->blueLinks_[0] = linkup;
275 this->routers_[routernumj]->blueLinks_[0] = linkdown;
281 void DragonflyZone::getLocalRoute(NetPoint* src, NetPoint* dst, sg_platf_route_cbarg_t route, double* latency)
283 // Minimal routing version.
284 // TODO : non-minimal random one, and adaptive ?
286 if (dst->isRouter() || src->isRouter())
289 XBT_VERB("dragonfly getLocalRout from '%s'[%u] to '%s'[%u]", src->name().c_str(), src->id(), dst->name().c_str(),
292 if ((src->id() == dst->id()) && hasLoopback_) {
293 std::pair<surf::LinkImpl*, surf::LinkImpl*> info = privateLinks_.at(nodePosition(src->id()));
295 route->link_list->push_back(info.first);
297 *latency += info.first->latency();
301 unsigned int myCoords[4];
302 rankId_to_coords(src->id(), &myCoords);
303 unsigned int targetCoords[4];
304 rankId_to_coords(dst->id(), &targetCoords);
305 XBT_DEBUG("src : %u group, %u chassis, %u blade, %u node", myCoords[0], myCoords[1], myCoords[2], myCoords[3]);
306 XBT_DEBUG("dst : %u group, %u chassis, %u blade, %u node", targetCoords[0], targetCoords[1], targetCoords[2],
309 DragonflyRouter* myRouter = routers_[myCoords[0] * (numChassisPerGroup_ * numBladesPerChassis_) +
310 myCoords[1] * numBladesPerChassis_ + myCoords[2]];
311 DragonflyRouter* targetRouter = routers_[targetCoords[0] * (numChassisPerGroup_ * numBladesPerChassis_) +
312 targetCoords[1] * numBladesPerChassis_ + targetCoords[2]];
313 DragonflyRouter* currentRouter = myRouter;
315 // node->router local link
316 route->link_list->push_back(myRouter->myNodes_[myCoords[3] * numLinksperLink_]);
318 *latency += myRouter->myNodes_[myCoords[3] * numLinksperLink_]->latency();
320 if (hasLimiter_) { // limiter for sender
321 std::pair<surf::LinkImpl*, surf::LinkImpl*> info = privateLinks_.at(nodePositionWithLoopback(src->id()));
322 route->link_list->push_back(info.first);
325 if (targetRouter != myRouter) {
327 // are we on a different group ?
328 if (targetRouter->group_ != currentRouter->group_) {
329 // go to the router of our group connected to this one.
330 if (currentRouter->blade_ != targetCoords[0]) {
331 // go to the nth router in our chassis
332 route->link_list->push_back(currentRouter->greenLinks_[targetCoords[0]]);
334 *latency += currentRouter->greenLinks_[targetCoords[0]]->latency();
335 currentRouter = routers_[myCoords[0] * (numChassisPerGroup_ * numBladesPerChassis_) +
336 myCoords[1] * numBladesPerChassis_ + targetCoords[0]];
339 if (currentRouter->chassis_ != 0) {
340 // go to the first chassis of our group
341 route->link_list->push_back(currentRouter->blackLinks_[0]);
343 *latency += currentRouter->blackLinks_[0]->latency();
344 currentRouter = routers_[myCoords[0] * (numChassisPerGroup_ * numBladesPerChassis_) + targetCoords[0]];
347 // go to destination group - the only optical hop
348 route->link_list->push_back(currentRouter->blueLinks_[0]);
350 *latency += currentRouter->blueLinks_[0]->latency();
351 currentRouter = routers_[targetCoords[0] * (numChassisPerGroup_ * numBladesPerChassis_) + myCoords[0]];
354 // same group, but same blade ?
355 if (targetRouter->blade_ != currentRouter->blade_) {
356 route->link_list->push_back(currentRouter->greenLinks_[targetCoords[2]]);
358 *latency += currentRouter->greenLinks_[targetCoords[2]]->latency();
359 currentRouter = routers_[targetCoords[0] * (numChassisPerGroup_ * numBladesPerChassis_) + targetCoords[2]];
362 // same blade, but same chassis ?
363 if (targetRouter->chassis_ != currentRouter->chassis_) {
364 route->link_list->push_back(currentRouter->blackLinks_[targetCoords[1]]);
366 *latency += currentRouter->blackLinks_[targetCoords[1]]->latency();
370 if (hasLimiter_) { // limiter for receiver
371 std::pair<surf::LinkImpl*, surf::LinkImpl*> info = privateLinks_.at(nodePositionWithLoopback(dst->id()));
372 route->link_list->push_back(info.first);
375 // router->node local link
376 route->link_list->push_back(targetRouter->myNodes_[targetCoords[3] * numLinksperLink_ + numLinksperLink_ - 1]);
378 *latency += targetRouter->myNodes_[targetCoords[3] * numLinksperLink_ + numLinksperLink_ - 1]->latency();