1 /* Copyright (c) 2009, 2010, 2011, 2013. 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. */
7 #include "surf_routing_cluster.hpp"
9 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route_cluster, surf, "Routing part of surf");
11 /* This routing is specifically setup to represent clusters, aka homogeneous sets of machines
12 * Note that a router is created, easing the interconnexion with the rest of the world.
15 AS_t model_cluster_create(void)
17 return new AsCluster();
20 /* Creation routing model functions */
21 AsCluster::AsCluster() : AsNone()
28 p_nb_links_per_node =0;
31 /* Business methods */
32 void AsCluster::getRouteAndLatency(RoutingEdgePtr src, RoutingEdgePtr dst, sg_platf_route_cbarg_t route, double *lat)
34 s_surf_parsing_link_up_down_t info;
35 XBT_VERB("cluster_get_route_and_latency from '%s'[%d] to '%s'[%d]",
36 src->p_name, src->m_id, dst->p_name, dst->m_id);
38 //retrieve the number of links we stored for each node
39 int nb_links_per_node = p_has_loopback + p_has_limiter +
40 (p_dimensions ? xbt_dynar_length(p_dimensions) : 1);
42 if (src->p_rcType != SURF_NETWORK_ELEMENT_ROUTER) { // No specific link for router
44 if((src->m_id == dst->m_id) && p_has_loopback ){
45 info = xbt_dynar_get_as(p_linkUpDownList, src->m_id * nb_links_per_node, s_surf_parsing_link_up_down_t);
46 xbt_dynar_push_as(route->link_list, void *, info.link_up);
48 *lat += static_cast<NetworkLinkPtr>(info.link_up)->getLatency();
53 if (p_has_limiter){ // limiter for sender
54 info = xbt_dynar_get_as(p_linkUpDownList, src->m_id * nb_links_per_node + p_has_loopback, s_surf_parsing_link_up_down_t);
55 xbt_dynar_push_as(route->link_list, void *, info.link_up);
58 info = xbt_dynar_get_as(p_linkUpDownList, src->m_id * nb_links_per_node + p_has_loopback + p_has_limiter, s_surf_parsing_link_up_down_t);
59 if (info.link_up) { // link up
60 xbt_dynar_push_as(route->link_list, void *, info.link_up);
62 *lat += static_cast<NetworkLinkPtr>(info.link_up)->getLatency();
68 xbt_dynar_push_as(route->link_list, void *, static_cast<ResourcePtr>(p_backbone));
70 *lat += p_backbone->getLatency();
73 if (dst->p_rcType != SURF_NETWORK_ELEMENT_ROUTER) { // No specific link for router
74 info = xbt_dynar_get_as(p_linkUpDownList, dst->m_id * nb_links_per_node + p_has_loopback + p_has_limiter, s_surf_parsing_link_up_down_t);
76 if (info.link_down) { // link down
77 xbt_dynar_push_as(route->link_list, void *, info.link_down);
79 *lat += static_cast<NetworkLinkPtr>(info.link_down)->getLatency();
81 if (p_has_limiter){ // limiter for receiver
82 info = xbt_dynar_get_as(p_linkUpDownList, dst->m_id * nb_links_per_node + p_has_loopback, s_surf_parsing_link_up_down_t);
83 xbt_dynar_push_as(route->link_list, void *, info.link_up);
88 void AsCluster::getGraph(xbt_graph_t graph, xbt_dict_t nodes, xbt_dict_t edges)
91 int table_size = xbt_dynar_length(p_indexNetworkElm);
94 xbt_node_t current, previous, backboneNode = NULL, routerNode;
95 s_surf_parsing_link_up_down_t info;
97 xbt_assert(p_router,"Malformed cluster");
99 /* create the router */
100 char *link_name = p_router->p_name;
101 routerNode = new_xbt_graph_node(graph, link_name, nodes);
104 const char *link_nameR = p_backbone->getName();
105 backboneNode = new_xbt_graph_node(graph, link_nameR, nodes);
107 new_xbt_graph_edge(graph, routerNode, backboneNode, edges);
110 for (isrc = 0; isrc < table_size; isrc++) {
111 src = xbt_dynar_get_as(p_indexNetworkElm, isrc, RoutingEdgePtr);
113 if (src->p_rcType != SURF_NETWORK_ELEMENT_ROUTER) {
114 previous = new_xbt_graph_node(graph, src->p_name, nodes);
116 info = xbt_dynar_get_as(p_linkUpDownList, src->m_id, s_surf_parsing_link_up_down_t);
118 if (info.link_up) { // link up
120 const char *link_name = static_cast<ResourcePtr>(info.link_up)->getName();
121 current = new_xbt_graph_node(graph, link_name, nodes);
122 new_xbt_graph_edge(graph, previous, current, edges);
125 new_xbt_graph_edge(graph, current, backboneNode, edges);
127 new_xbt_graph_edge(graph, current, routerNode, edges);
132 if (info.link_down) { // link down
133 const char *link_name = static_cast<ResourcePtr>(info.link_down)->getName();
134 current = new_xbt_graph_node(graph, link_name, nodes);
135 new_xbt_graph_edge(graph, previous, current, edges);
138 new_xbt_graph_edge(graph, current, backboneNode, edges);
140 new_xbt_graph_edge(graph, current, routerNode, edges);
148 void AsCluster::create_links_for_node(sg_platf_cluster_cbarg_t cluster, int id, int , int position){
149 s_sg_platf_link_cbarg_t link;
150 s_surf_parsing_link_up_down_t info;
151 char* link_id = bprintf("%s_link_%d", cluster->id, id);
153 memset(&link, 0, sizeof(link));
155 link.bandwidth = cluster->bw;
156 link.latency = cluster->lat;
157 link.state = SURF_RESOURCE_ON;
158 link.policy = cluster->sharing_policy;
159 sg_platf_new_link(&link);
161 if (link.policy == SURF_LINK_FULLDUPLEX) {
162 char *tmp_link = bprintf("%s_UP", link_id);
164 xbt_lib_get_or_null(link_lib, tmp_link, SURF_LINK_LEVEL);
166 tmp_link = bprintf("%s_DOWN", link_id);
168 xbt_lib_get_or_null(link_lib, tmp_link, SURF_LINK_LEVEL);
171 info.link_up = xbt_lib_get_or_null(link_lib, link_id, SURF_LINK_LEVEL);
172 info.link_down = info.link_up;
174 xbt_dynar_set(p_linkUpDownList, position,
179 int AsCluster::parsePU(RoutingEdgePtr elm) {
180 XBT_DEBUG("Load process unit \"%s\"", elm->p_name);
181 xbt_dynar_push_as(p_indexNetworkElm, RoutingEdgePtr, elm);
182 return xbt_dynar_length(p_indexNetworkElm)-1;
185 int AsCluster::parseAS(RoutingEdgePtr elm) {
186 XBT_DEBUG("Load Autonomous system \"%s\"", elm->p_name);
187 xbt_dynar_push_as(p_indexNetworkElm, RoutingEdgePtr, elm);
188 return xbt_dynar_length(p_indexNetworkElm)-1;