1 /* Copyright (c) 2014-2016. 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/TorusZone.hpp"
7 #include "src/kernel/routing/NetCard.hpp"
9 #include "src/surf/network_interface.hpp"
11 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route_cluster_torus, surf_route_cluster, "Torus Routing part of surf");
13 inline unsigned int* rankId_to_coords(int rankId, xbt_dynar_t dimensions)
16 unsigned int i = 0, cur_dim_size = 1, dim_size_product = 1;
17 unsigned int* coords = (unsigned int*)malloc(xbt_dynar_length(dimensions) * sizeof(unsigned int));
18 for (i = 0; i < xbt_dynar_length(dimensions); i++) {
19 cur_dim_size = xbt_dynar_get_as(dimensions, i, int);
20 coords[i] = (rankId / dim_size_product) % cur_dim_size;
21 dim_size_product *= cur_dim_size;
30 TorusZone::TorusZone(NetZone* father, const char* name) : ClusterZone(father, name)
33 TorusZone::~TorusZone()
35 xbt_dynar_free(&dimensions_);
38 void TorusZone::create_links_for_node(sg_platf_cluster_cbarg_t cluster, int id, int rank, int position)
41 * Create all links that exist in the torus.
42 * Each rank creates @a dimensions-1 links
44 int neighbor_rank_id = 0; // The other node the link connects
45 int current_dimension = 0, // which dimension are we currently in?
46 // we need to iterate over all dimensions
47 // and create all links there
48 dim_product = 1; // Needed to calculate the next neighbor_id
49 for (unsigned int j = 0; j < xbt_dynar_length(dimensions_); j++) {
51 s_sg_platf_link_cbarg_t link;
52 memset(&link, 0, sizeof(link));
53 current_dimension = xbt_dynar_get_as(dimensions_, j, int);
54 neighbor_rank_id = (((int)rank / dim_product) % current_dimension == current_dimension - 1)
55 ? rank - (current_dimension - 1) * dim_product
57 // name of neighbor is not right for non contiguous cluster radicals (as id != rank in this case)
58 char* link_id = bprintf("%s_link_from_%i_to_%i", cluster->id, id, neighbor_rank_id);
60 link.bandwidth = cluster->bw;
61 link.latency = cluster->lat;
62 link.policy = cluster->sharing_policy;
63 sg_platf_new_link(&link);
66 if (link.policy == SURF_LINK_FULLDUPLEX) {
67 char* tmp_link = bprintf("%s_UP", link_id);
68 linkUp = Link::byName(tmp_link);
70 tmp_link = bprintf("%s_DOWN", link_id);
71 linkDown = Link::byName(tmp_link);
74 linkUp = Link::byName(link_id);
78 * Add the link to its appropriate position;
79 * note that position rankId*(xbt_dynar_length(dimensions)+has_loopback?+has_limiter?)
80 * holds the link "rankId->rankId"
82 privateLinks_.insert({position + j, {linkUp, linkDown}});
83 dim_product *= current_dimension;
89 void TorusZone::parse_specific_arguments(sg_platf_cluster_cbarg_t cluster)
94 xbt_dynar_t dimensions = xbt_str_split(cluster->topo_parameters, ",");
96 if (!xbt_dynar_is_empty(dimensions)) {
97 dimensions_ = xbt_dynar_new(sizeof(int), nullptr);
98 /* We are in a torus cluster
99 * Parse attribute dimensions="dim1,dim2,dim3,...,dimN"
100 * and safe it in a dynarray.
101 * Additionally, we need to know how many ranks we have in total
103 xbt_dynar_foreach (dimensions, iter, groups) {
104 int tmp = surf_parse_get_int(xbt_dynar_get_as(dimensions, iter, char*));
105 xbt_dynar_set_as(dimensions_, iter, int, tmp);
108 linkCountPerNode_ = xbt_dynar_length(dimensions_);
110 xbt_dynar_free(&dimensions);
113 void TorusZone::getLocalRoute(NetCard* src, NetCard* dst, sg_platf_route_cbarg_t route, double* lat)
116 XBT_VERB("torus getLocalRoute from '%s'[%d] to '%s'[%d]", src->name().c_str(), src->id(), dst->name().c_str(),
119 if (dst->isRouter() || src->isRouter())
122 if (src->id() == dst->id() && hasLoopback_) {
123 std::pair<Link*, Link*> info = privateLinks_.at(src->id() * linkCountPerNode_);
125 route->link_list->push_back(info.first);
127 *lat += info.first->latency();
132 * Dimension based routing routes through each dimension consecutively
133 * TODO Change to dynamic assignment
135 unsigned int j, cur_dim, dim_product = 1;
136 unsigned int current_node = src->id();
137 unsigned int next_node = 0;
139 * Arrays that hold the coordinates of the current node and
140 * the target; comparing the values at the i-th position of
141 * both arrays, we can easily assess whether we need to route
142 * into this dimension or not.
144 unsigned int* myCoords = rankId_to_coords(src->id(), dimensions_);
145 unsigned int* targetCoords = rankId_to_coords(dst->id(), dimensions_);
147 * linkOffset describes the offset where the link
148 * we want to use is stored
149 * (+1 is added because each node has a link from itself to itself,
150 * which can only be the case if src->m_id == dst->m_id -- see above
151 * for this special case)
153 int nodeOffset = (xbt_dynar_length(dimensions_) + 1) * src->id();
155 int linkOffset = nodeOffset;
156 bool use_lnk_up = false; // Is this link of the form "cur -> next" or "next -> cur"?
157 // false means: next -> cur
158 while (current_node != dst->id()) {
159 dim_product = 1; // First, we will route in x-dimension
160 for (j = 0; j < xbt_dynar_length(dimensions_); j++) {
161 cur_dim = xbt_dynar_get_as(dimensions_, j, int);
163 // current_node/dim_product = position in current dimension
164 if ((current_node / dim_product) % cur_dim != (dst->id() / dim_product) % cur_dim) {
166 if ((targetCoords[j] > myCoords[j] &&
167 targetCoords[j] <= myCoords[j] + cur_dim / 2) // Is the target node on the right, without the wrap-around?
168 || (myCoords[j] > cur_dim / 2 &&
169 (myCoords[j] + cur_dim / 2) % cur_dim >=
170 targetCoords[j])) { // Or do we need to use the wrap around to reach it?
171 if ((current_node / dim_product) % cur_dim == cur_dim - 1)
172 next_node = (current_node + dim_product - dim_product * cur_dim);
174 next_node = (current_node + dim_product);
176 // HERE: We use *CURRENT* node for calculation (as opposed to next_node)
177 nodeOffset = current_node * (linkCountPerNode_);
178 linkOffset = nodeOffset + (hasLoopback_ ? 1 : 0) + (hasLimiter_ ? 1 : 0) + j;
180 assert(linkOffset >= 0);
181 } else { // Route to the left
182 if ((current_node / dim_product) % cur_dim == 0)
183 next_node = (current_node - dim_product + dim_product * cur_dim);
185 next_node = (current_node - dim_product);
187 // HERE: We use *next* node for calculation (as opposed to current_node!)
188 nodeOffset = next_node * (linkCountPerNode_);
189 linkOffset = nodeOffset + j + (hasLoopback_ ? 1 : 0) + (hasLimiter_ ? 1 : 0);
192 assert(linkOffset >= 0);
194 XBT_DEBUG("torus_get_route_and_latency - current_node: %i, next_node: %u, linkOffset is %i", current_node,
195 next_node, linkOffset);
200 dim_product *= cur_dim;
203 std::pair<Link*, Link*> info;
205 if (hasLimiter_) { // limiter for sender
206 info = privateLinks_.at(nodeOffset + hasLoopback_);
207 route->link_list->push_back(info.first);
210 info = privateLinks_.at(linkOffset);
212 if (use_lnk_up == false) {
213 route->link_list->push_back(info.second);
215 *lat += info.second->latency();
217 route->link_list->push_back(info.first);
219 *lat += info.first->latency();
221 current_node = next_node;