#include <fstream>
+
AsClusterFatTree::AsClusterFatTree() : levels(0) {}
AsClusterFatTree::~AsClusterFatTree() {
}
}
+bool AsClusterFatTree::isInSubTree(FatTreeNode *root, FatTreeNode *node) {
+ for (unsigned int i = 0 ; i < node->level ; i++) {
+ if(root->label[i] != node->label[i]) {
+ return false;
+ }
+ }
+
+ for (unsigned int i = root->level + 1 ; i < this->levels ; i++) {
+ if(root->label[i] != node->label[i]) {
+ return false;
+ }
+ }
+ return true;
+}
void AsClusterFatTree::getRouteAndLatency(RoutingEdgePtr src,
RoutingEdgePtr dst,
sg_platf_route_cbarg_t into,
double *latency) {
- // TODO
+ FatTreeNode *source, *destination, *currentNode;
+ std::vector<NetworkLink*> route;
+ source = this->nodes.find(src->getId())->second;
+ destination = this->nodes.find(dst->getId())->second;
+
+ int d, k; // as in d-mod-k
+
+ currentNode = source;
+
+ // up part
+ while (!isInSubTree(currentNode, destination)) {
+ d = destination->position;
+
+ for (unsigned int i = 0 ; i < currentNode->level ; i++) {
+ d /= this->upperLevelNodesNumber[i];
+ }
+ k = this->upperLevelNodesNumber[currentNode->level] *
+ this->lowerLevelNodesNumber[currentNode->level];
+ d = d % k;
+ route.push_back(currentNode->parents[d]->upLink);
+ if(latency) {
+ *latency += currentNode->parents[d]->upLink->getLatency();
+ }
+ currentNode = currentNode->parents[d]->upNode;
+ }
+
+ // Down part
+ while(currentNode != destination) {
+ for(unsigned int i = 0 ; i < currentNode->children.size() ; i++) {
+ if(i % this->lowerLevelNodesNumber[currentNode->level] ==
+ destination->label[currentNode->level]) {
+ route.push_back(currentNode->children[i]->downLink);
+ if(latency) {
+ *latency += currentNode->children[d]->downLink->getLatency();
+ }
+ currentNode = currentNode->children[i]->downNode;
+ }
+ }
+ }
+
+ for (unsigned int i = 0 ; i < route.size() ; i++) {
+ xbt_dynar_push_as(into->link_list, void*, route[i]);
+ }
+
}
/* This function makes the assumption that parse_specific_arguments() and
currentParentNode = this->nodes[this->getLevelPosition(level + 1)];
for (unsigned int i = 0 ; i < this->nodesByLevel[level] ; i++ ) {
if(this->areRelated(currentParentNode, node)) {
- this->addLink(cluster, currentParentNode, node->label[level + 1], node,
- currentParentNode->label[level + 1]);
+ for (unsigned int j = 0 ; j < this->lowerLevelPortsNumber[level + 1] ; j++) {
+ this->addLink(cluster, currentParentNode, node->label[level + 1] +
+ j * this->lowerLevelNodesNumber[level + 1], node,
+ currentParentNode->label[level + 1] +
+ j * this->upperLevelNodesNumber[level + 1]);
+ }
connectionsNumber++;
}
}
for (unsigned int i = this->nodesByLevel[0] ; i < this->nodes.size() ; i++) {
delete this->nodes[i];
}
- this->nodes.resize(this->nodesByLevel[0]);
}
// We create the switches
int k = 0;
- for (unsigned int i = 1 ; i < this->levels ; i++) {
+ for (unsigned int i = 0 ; i < this->levels ; i++) {
for (unsigned int j = 0 ; j < this->nodesByLevel[i] ; j++) {
FatTreeNode* newNode;
- newNode = new FatTreeNode(--k, i, j);
- newNode->children.resize(this->lowerLevelNodesNumber[i]);
- newNode->parents.resize(this->upperLevelNodesNumber[i]);
- this->nodes.push_back(newNode);
+ newNode = new FatTreeNode(--k, i + 1, j);
+ newNode->children.resize(this->lowerLevelNodesNumber[i] *
+ this->lowerLevelPortsNumber[i]);
+ if (i != this->levels - 1) {
+ newNode->parents.resize(this->upperLevelNodesNumber[i + 1]);
+ }
+ this->nodes.insert(std::make_pair(k,newNode));
}
}
}
}
void AsClusterFatTree::addComputeNodes(std::vector<int> const& id) {
+ using std::make_pair;
+ FatTreeNode* newNode;
for (size_t i = 0 ; i < id.size() ; i++) {
- this->nodes.push_back(new FatTreeNode(id[i]));
+ newNode = new FatTreeNode(id[i], 0, i);
+ newNode->parents.resize(this->upperLevelNodesNumber[0] * this->lowerLevelPortsNumber[i]);
+ this->nodes.insert(make_pair(id[i],newNode));
}
}
void AsClusterFatTree::addLink(sg_platf_cluster_cbarg_t cluster,
FatTreeNode *parent, unsigned int parentPort,
FatTreeNode *child, unsigned int childPort) {
- using std::make_pair;
-
-
FatTreeLink *newLink;
newLink = new FatTreeLink(cluster, parent, child);
parent->children[parentPort] = newLink;
child->parents[childPort] = newLink;
- this->links.insert(make_pair(make_pair(parent->id, child->id), newLink));
+ this->links.push_back(newLink);
if(file.is_open()) {
// That could also be greatly clarified with C++11
- std::map<std::pair<int,int>,FatTreeLink*>::const_iterator iter;
+ std::vector<FatTreeLink*>::const_iterator iter;
file << "graph AsClusterFatTree {\n";
for (iter = this->links.begin() ; iter != this->links.end() ; iter++ ) {
- file << iter->second->source->id
+ file << (*iter)->downNode->id
<< " -- "
- << iter->second->destination->id
+ << (*iter)->upNode->id
<< ";\n";
}
file << "}";
level(level),
position(position){}
-FatTreeLink::FatTreeLink(sg_platf_cluster_cbarg_t cluster, FatTreeNode *source,
- FatTreeNode *destination) : source(source),
- destination(destination) {
+FatTreeLink::FatTreeLink(sg_platf_cluster_cbarg_t cluster, FatTreeNode *downNode,
+ FatTreeNode *upNode) : upNode(upNode),
+ downNode(downNode) {
static int uniqueId = 0;
s_sg_platf_link_cbarg_t linkTemplate;
linkTemplate.bandwidth = cluster->bw;
NetworkLink* link;
- linkTemplate.id = bprintf("link_from_%d_to_%d_%d_UP", source->id, destination->id, uniqueId);
+ linkTemplate.id = bprintf("link_from_%d_to_%d_%d_UP", downNode->id, upNode->id, uniqueId);
sg_platf_new_link(&linkTemplate);
link = (NetworkLink*) xbt_lib_get_or_null(link_lib, linkTemplate.id, SURF_LINK_LEVEL);
- this->linkUp = link; // check link?
- linkTemplate.id = bprintf("link_from_%d_to_%d_%d_DOWN", source->id, destination->id, uniqueId);
+ this->upLink = link; // check link?
+ linkTemplate.id = bprintf("link_from_%d_to_%d_%d_DOWN", downNode->id, upNode->id, uniqueId);
sg_platf_new_link(&linkTemplate);
link = (NetworkLink*) xbt_lib_get_or_null(link_lib, linkTemplate.id, SURF_LINK_LEVEL);
- this->linkDown = link; // check link ?
+ this->downLink = link; // check link ?
uniqueId++;
