xbt_graph_new_edge(platform_graph, node1, node2, (void*)link_id);
}
+double platf_node_distance(xbt_node_t node1, xbt_node_t node2) {
+ context_node_t node1_data;
+ context_node_t node2_data;
+ double delta_x;
+ double delta_y;
+ double distance;
+ node1_data = (context_node_t) xbt_graph_node_get_data(node1);
+ node2_data = (context_node_t) xbt_graph_node_get_data(node2);
+ delta_x = node1_data->x - node2_data->x;
+ delta_y = node1_data->y - node2_data->y;
+ distance = sqrt(delta_x*delta_x + delta_y*delta_y);
+ return distance;
+}
+
void platf_graph_uniform(unsigned long node_count) {
xbt_dynar_t dynar_nodes = NULL;
xbt_node_t graph_node = NULL;
}
}
+void platf_graph_interconnect_ring(void) {
+ /* Create a simple topology where all nodes are connected along a ring */
+ xbt_dynar_t dynar_nodes = NULL;
+ xbt_node_t graph_node = NULL;
+ xbt_node_t old_node = NULL;
+ xbt_node_t first_node = NULL;
+ unsigned int i;
+
+ dynar_nodes = xbt_graph_get_nodes(platform_graph);
+ xbt_dynar_foreach(dynar_nodes, i, graph_node) {
+ if(i == 0) {
+ // this is the first node, let's keep it somewhere
+ first_node = graph_node;
+ } else {
+ //connect each node to the previous one
+ platf_node_connect(graph_node, old_node);
+ }
+ old_node = graph_node;
+ }
+ //we still have to connect the first and the last node together
+ platf_node_connect(first_node, graph_node);
+}
+
+void platf_graph_interconnect_clique(void) {
+ /* Create a simple topology where all nodes are connected to each other, in a clique manner */
+ xbt_dynar_t dynar_nodes = NULL;
+ xbt_node_t first_node = NULL;
+ xbt_node_t second_node = NULL;
+ unsigned int i,j;
+
+ dynar_nodes = xbt_graph_get_nodes(platform_graph);
+ xbt_dynar_foreach(dynar_nodes, i, first_node) {
+ xbt_dynar_foreach(dynar_nodes, j, second_node) {
+ platf_node_connect(first_node, second_node);
+ }
+ }
+}
+
+void platf_graph_interconnect_uniform(double alpha) {
+ /* Creates a topology where the probability to connect two nodes is uniform (unrealistic, but simple)
+ alpha : Probability for two nodes to get connected */
+ xbt_dynar_t dynar_nodes = NULL;
+ xbt_node_t first_node = NULL;
+ xbt_node_t second_node = NULL;
+ unsigned int i,j;
+
+ dynar_nodes = xbt_graph_get_nodes(platform_graph);
+ xbt_dynar_foreach(dynar_nodes, i, first_node) {
+ xbt_dynar_foreach(dynar_nodes, j, second_node) {
+ if(j>=i)
+ break;
+ if(RngStream_RandU01(rng_stream) < alpha) {
+ platf_node_connect(first_node, second_node);
+ }
+ }
+ }
+}
+
+void platf_graph_interconnect_exponential(double alpha) {
+ /* Create a topology where the probability follows an exponential law
+ Number of edges increases with alpha */
+ xbt_dynar_t dynar_nodes = NULL;
+ xbt_node_t first_node = NULL;
+ xbt_node_t second_node = NULL;
+ unsigned int i,j;
+ double L = sqrt(2.0); /* L = c*sqrt(2); c=side of placement square */
+ dynar_nodes = xbt_graph_get_nodes(platform_graph);
+ xbt_dynar_foreach(dynar_nodes, i, first_node) {
+ xbt_dynar_foreach(dynar_nodes, j, second_node) {
+ if(j>=i)
+ break;
+ double d = platf_node_distance(first_node, second_node);
+ if(RngStream_RandU01(rng_stream) < alpha*exp(-d/(L-d))) {
+ platf_node_connect(first_node, second_node);
+ }
+ }
+ }
+}
+
+void platf_graph_promote_to_host(xbt_node_t node, sg_platf_host_cbarg_t parameters) {
+ context_node_t node_data = (context_node_t) xbt_graph_node_get_data(node);
+ node_data->kind = HOST;
+ memcpy(&(node_data->host_parameters), parameters, sizeof(s_sg_platf_host_cbarg_t));
+}
+
+void platf_graph_promote_to_cluster(xbt_node_t node, sg_platf_cluster_cbarg_t parameters) {
+ context_node_t node_data = (context_node_t) xbt_graph_node_get_data(node);
+ node_data->kind = CLUSTER;
+ memcpy(&(node_data->cluster_parameters), parameters, sizeof(s_sg_platf_cluster_cbarg_t));
+}
/* Functions used to generate interesting random values */