A
lgorithmique
N
umérique
D
istribuée
Public GIT Repository
projects
/
simgrid.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
tiny cleanups in the parsing of clusters
[simgrid.git]
/
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
3025387
..
6d6adcf
100644
(file)
--- 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);
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 *upLink;
- /** Link going down in the tree
- */
+ /** Link going down in the tree */
Link *downLink;
Link *downLink;
- /** Upper end of the link
- */
+ /** Upper end of the link */
FatTreeNode *upNode;
FatTreeNode *upNode;
- /** Lower end of the link
- */
+ /** Lower end of the link */
FatTreeNode *downNode;
};
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
*
* 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
@@
-121,7
+120,7
@@
public:
~AsClusterFatTree();
virtual void getRouteAndLatency(NetCard *src, NetCard *dst,
sg_platf_route_cbarg_t into,
~AsClusterFatTree();
virtual void getRouteAndLatency(NetCard *src, NetCard *dst,
sg_platf_route_cbarg_t into,
- double *latency);
+ double *latency)
override
;
/** \brief Generate the fat tree
*
/** \brief Generate the fat tree
*
@@
-134,9
+133,7
@@
public:
*
* It will also store the cluster for future use.
*/
*
* 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;
void addProcessingNode(int id);
void generateDotFile(const std::string& filename = "fatTree.dot") const;