X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/7f4f03348bd07609e258eb3b545bdafc2c881847..703e8696289393e60554250c2ada4ea97ed89435:/src/surf/surf_routing_cluster_fat_tree.hpp diff --git a/src/surf/surf_routing_cluster_fat_tree.hpp b/src/surf/surf_routing_cluster_fat_tree.hpp index 8aae47c2ea..6d6adcf668 100644 --- a/src/surf/surf_routing_cluster_fat_tree.hpp +++ b/src/surf/surf_routing_cluster_fat_tree.hpp @@ -80,22 +80,21 @@ class FatTreeLink { public: FatTreeLink(sg_platf_cluster_cbarg_t cluster, FatTreeNode *source, FatTreeNode *destination); - /** Link going up in the tree - */ + /** Link going up in the tree */ Link *upLink; - /** Link going down in the tree - */ + /** Link going down in the tree */ Link *downLink; - /** Upper end of the link - */ + /** Upper end of the link */ FatTreeNode *upNode; - /** Lower end of the link - */ + /** Lower end of the link */ FatTreeNode *downNode; }; -/** \brief Fat tree representation and routing. +/** + * \class AsClusterFatTree + * + * \brief Fat tree representation and routing. * * Generate fat trees according to the topology asked for. Almost everything * is based on the work of Eitan Zahavi in "D-Mod-K Routing Providing @@ -119,9 +118,9 @@ class XBT_PRIVATE AsClusterFatTree : public AsCluster { public: AsClusterFatTree(); ~AsClusterFatTree(); - virtual void getRouteAndLatency(RoutingEdge *src, RoutingEdge *dst, + virtual void getRouteAndLatency(NetCard *src, NetCard *dst, sg_platf_route_cbarg_t into, - double *latency); + double *latency) override; /** \brief Generate the fat tree * @@ -134,9 +133,7 @@ public: * * It will also store the cluster for future use. */ - void parse_specific_arguments(sg_platf_cluster_cbarg_t cluster); - /** \brief Add a processing node. - */ + void parse_specific_arguments(sg_platf_cluster_cbarg_t cluster) override; void addProcessingNode(int id); void generateDotFile(const std::string& filename = "fatTree.dot") const;