1 #include "surf_routing_cluster_fat_tree.hpp"
3 #include <boost/algorithm/string/split.hpp>
4 #include <boost/algorithm/string/classification.hpp>
10 AsClusterFatTree::AsClusterFatTree() : levels(0) {}
12 AsClusterFatTree::~AsClusterFatTree() {
13 for (int i = 0 ; i < this->nodes.size() ; i++) {
14 delete this->nodes[i];
18 void AsClusterFatTree::getRouteAndLatency(RoutingEdgePtr src,
20 sg_platf_route_cbarg_t into,
21 double *latency) const{
25 /* This function makes the assumption that parse_specific_arguments() and
26 * addNodes() have already been called
28 void AsClusterFatTree::create_links(sg_platf_cluster_cbarg_t cluster) {
30 if(this->levels == 0) {
33 this->nodesByLevel.resize(this->levels, 0);
34 int nodesRequired = 0;
37 for (int i = 0 ; i < this->levels ; i++) {
38 int nodesInThisLevel = 1;
40 for (int j = 0 ; j < i ; j++) {
41 nodesInThisLevel *= this->upperLevelNodesNumber[j];
44 for (int j = i+1 ; j < this->levels ; j++) {
45 nodesInThisLevel *= this->lowerLevelNodesNumber[j];
48 this->nodesByLevel[i] = nodesInThisLevel;
49 nodesRequired += nodesInThisLevel;
52 if(nodesRequired > this->nodes.size()) {
53 surf_parse_error("There is not enough nodes to fit to the described topology."
54 " Please check your platform description (We need %d nodes, we only got %lu)",
55 nodesRequired, this->nodes.size());
59 // Nodes are totally ordered, by level and then by position, in this->nodes
61 for (int i = 0 ; i < this->levels ; i++) {
62 for (int j = 0 ; j < this->nodesByLevel[i] ; j++) {
63 this->nodes[k]->level = i;
64 this->nodes[k]->position = j;
71 void AsClusterFatTree::getLevelPosition(const int level, int &position, int &size) {
72 if (level > this->levels - 1) {
79 for (int i = 0 ; i < level ; i++) {
80 tempPosition += this->nodesByLevel[i];
82 position = tempPosition;
83 size = this->nodesByLevel[level];
86 void AsClusterFatTree::addNodes(std::vector<int> const& id) {
87 for (int i = 0 ; i < id.size() ; i++) {
88 this->nodes.push_back(new FatTreeNode(id[i]));
92 void AsClusterFatTree::addLink(FatTreeNode *parent, FatTreeNode *child) {
94 if (parent->children.size() == this->nodesByLevel[parent->level] ||
95 child->parents.size() == this->nodesByLevel[child->level]) {
96 /* NB : This case should never happen, if this private function is not misused,
97 * so should we keep this test, keep it only for debug, throw an exception
98 * or get rid of it ? In all cases, anytime we get in there, code should be
101 xbt_die("I've been asked to create a link that could not possibly exist");
105 parent->children.push_back(child);
106 child->parents.push_back(parent);
108 // FatTreeLink *newLink;
110 // newLink = new FatTreeLink(parent, child, this->lowerLevelPortsNumber[parent->level]);
111 // this->links.insert(make_pair(make_pair(parent->id, child->id), newLink));
117 void AsClusterFatTree::parse_specific_arguments(sg_platf_cluster_cbarg_t
119 std::vector<string> parameters;
120 std::vector<string> tmp;
121 boost::split(parameters, cluster->topo_parameters, boost::is_any_of(";"));
124 // TODO : we have to check for zeros and negative numbers, or it might crash
125 if (parameters.size() != 4){
126 surf_parse_error("Fat trees are defined by the levels number and 3 vectors"
127 ", see the documentation for more informations");
128 // Well, there's no doc, yet
131 // The first parts of topo_parameters should be the levels number
132 this->levels = std::atoi(tmp[0].c_str()); // stoi() only in C++11...
134 // Then, a l-sized vector standing for the childs number by level
135 boost::split(tmp, parameters[1], boost::is_any_of(","));
136 if(tmp.size() != this->levels) {
137 surf_parse_error("Fat trees are defined by the levels number and 3 vectors"
138 ", see the documentation for more informations");
140 for(unsigned int i = 0 ; i < tmp.size() ; i++){
141 this->lowerLevelNodesNumber.push_back(std::atoi(tmp[i].c_str()));
144 // Then, a l-sized vector standing for the parents number by level
145 boost::split(tmp, parameters[2], boost::is_any_of(","));
146 if(tmp.size() != this->levels) {
147 surf_parse_error("Fat trees are defined by the levels number and 3 vectors"
148 ", see the documentation for more informations");
150 for(unsigned int i = 0 ; i < tmp.size() ; i++){
151 this->upperLevelNodesNumber.push_back(std::atoi(tmp[i].c_str()));
154 // Finally, a l-sized vector standing for the ports number with the lower level
155 boost::split(tmp, parameters[3], boost::is_any_of(","));
156 if(tmp.size() != this->levels) {
157 surf_parse_error("Fat trees are defined by the levels number and 3 vectors"
158 ", see the documentation for more informations");
161 for(unsigned int i = 0 ; i < tmp.size() ; i++){
162 this->lowerLevelPortsNumber.push_back(std::atoi(tmp[i].c_str()));
167 void AsClusterFatTree::generateDotFile(const string& filename) const {
169 /* Maybe should we get directly a char*, as open takes strings only beginning
172 file.open(filename.c_str(), ios::out | ios::trunc);
175 // That could also be greatly clarified with C++11
176 // std::map<std::pair<int,int>,FatTreeLink*>::iterator iter;
177 // file << "graph AsClusterFatTree {\n";
178 // for (iter = this->links.begin() ; iter != this->links.end() ; iter++ ) {
179 // for (int j = 0 ; j < iter->second->ports ; j++) {
180 // file << iter->second->source->id
182 // << iter->second->destination->id
190 std::cerr << "Unable to open file " << filename << std::endl;
195 FatTreeNode::FatTreeNode(int id, int level, int position) : id(id),
199 // FatTreeLink::FatTreeLink(FatTreeNode *source, FatTreeNode *destination,
200 // int ports) : source(source), destination(destination),