* should certainly be checked for)
*/
+/* TODO : limiter link ? Loopback?
+ *
+ */
+
class FatTreeNode {
public:
- int id; // ID as given by the user
+ int id; // ID as given by the user, should be unique
int level; // The 0th level represents the leafs of the PGFT
int position; // Position in the level
class FatTreeLink {
public:
+ FatTreeLink(sg_platf_cluster_cbarg_t cluster, FatTreeNode *source,
+ FatTreeNode *destination, unsigned int ports = 0);
unsigned int ports;
- std::vector<NetworkLink> linksUp; // From source to destination
- std::vector<NetworkLink> linksDown; // From destination to source
- FatTreeNode source;
- FatTreeNode destination;
- FatTreeLink(int source, int destination, unsigned int ports = 0);
+ /* Links are dependant of the chosen network model, but must implement
+ * NetworkLink
+ */
+ std::vector<NetworkLink*> linksUp; // From source to destination
+ std::vector<NetworkLink*> linksDown; // From destination to source
+ /* As it is symetric, it might as well be first / second instead
+ * of source / destination
+ */
+ FatTreeNode *source;
+ FatTreeNode *destination;
};
class AsClusterFatTree : public AsCluster {
public:
AsClusterFatTree();
~AsClusterFatTree();
- virtual void getRouteAndLatency(RoutingEdgePtr src, RoutingEdgePtr dst, sg_platf_route_cbarg_t into, double *latency) const;
+ virtual void getRouteAndLatency(RoutingEdgePtr src, RoutingEdgePtr dst,
+ sg_platf_route_cbarg_t into,
+ double *latency);
+ // virtual void getRouteAndLatency(const int src, const int dst,
+ // std::vector<NetworkLink> *route,
+ // double *latency) const;
virtual void create_links(sg_platf_cluster_cbarg_t cluster);
void parse_specific_arguments(sg_platf_cluster_cbarg_t cluster);
void addNodes(std::vector<int> const& id);
- void generateDotFile(string filename = "fatTree.dot");
+ void generateDotFile(const string& filename = "fatTree.dot") const;
protected:
//description of a PGFT (TODO : better doc)
unsigned int levels;
- std::vector<int> lowerLevelNodesNumber;
- std::vector<int> upperLevelNodesNumber;
- std::vector<int> lowerLevelPortsNumber;
+ std::vector<int> lowerLevelNodesNumber; // number of children by node
+ std::vector<int> upperLevelNodesNumber; // number of parents by node
+ std::vector<int> lowerLevelPortsNumber; // ports between each level l and l-1
std::vector<FatTreeNode*> nodes;
std::map<std::pair<int,int>, FatTreeLink*> links;
-
-};
-
+ std::vector<unsigned int> nodesByLevel;
-
+ void addLink(sg_platf_cluster_cbarg_t cluster, FatTreeNode *parent,
+ FatTreeNode *child);
+ void getLevelPosition(const unsigned int level, int *position, int *size);
+};
#endif