SimGrid
3.16
Versatile Simulation of Distributed Systems
|
NetZone using a Fat-Tree topology.
Generate fat trees according to the topology asked for, according to: Eitan Zahavi, D-Mod-K Routing Providing Non-Blocking Traffic for Shift Permutations on Real Life Fat Trees (2010).
RLFT are PGFT with some restrictions to address real world constraints, which are not currently enforced.
The exact topology is described in the mandatory topo_parameters field, and follow the "h ; m_h, ..., m_1 ; w_h, ..., w_1 ; p_h, ..., p_1" format. h stands for the switches levels number, i.e. the fat tree is of height h, without the processing nodes. m_i stands for the number of lower level nodes connected to a node in level i. w_i stands for the number of upper levels nodes connected to a node in level i-1. p_i stands for the number of parallel links connecting two nodes between level i and i - 1. Level h is the topmost switch level, level 1 is the lowest switch level, and level 0 represents the processing nodes. The number of provided nodes must be exactly the number of processing nodes required to fit the topology, which is the product of the m_i's.
Routing is made using a destination-mod-k scheme.
#include <FatTreeZone.hpp>
Public Member Functions | |
FatTreeZone (NetZone *father, const char *name) | |
~FatTreeZone () override | |
void | getLocalRoute (NetPoint *src, NetPoint *dst, sg_platf_route_cbarg_t into, double *latency) override |
Probe the routing path between two points that are local to the called NetZone. More... | |
void | seal () override |
Generate the fat tree. More... | |
void | parse_specific_arguments (sg_platf_cluster_cbarg_t cluster) override |
Read the parameters in topo_parameters field. More... | |
void | addProcessingNode (int id) |
void | generateDotFile (const std::string &filename="fatTree.dot") const |
![]() | |
ClusterZone (NetZone *father, const char *name) | |
void | getGraph (xbt_graph_t graph, xbt_dict_t nodes, xbt_dict_t edges) override |
virtual void | create_links_for_node (sg_platf_cluster_cbarg_t cluster, int id, int rank, int position) |
![]() | |
simgrid::s4u::Host * | createHost (const char *name, std::vector< double > *speedPerPstate, int coreAmount, std::unordered_map< std::string, std::string > *props) |
Make an host within that NetZone. More... | |
void | addBypassRoute (sg_platf_route_cbarg_t e_route) override |
Creates a new route in this NetZone. More... | |
![]() | |
char * | name () |
NetZone * | father () |
std::vector< NetZone * > * | children () |
void | hosts (std::vector< s4u::Host *> *whereto) |
std::unordered_map< std::string, std::string > * | properties () |
Get the properties assigned to a host. More... | |
const char * | property (const char *key) |
Retrieve the property value (or nullptr if not set) More... | |
void | setProperty (const char *key, const char *value) |
virtual int | addComponent (kernel::routing::NetPoint *elm) |
virtual void | addRoute (sg_platf_route_cbarg_t route) |
|
explicit |
|
override |
|
overridevirtual |
Probe the routing path between two points that are local to the called NetZone.
src | where from |
dst | where to |
into | Container into which the traversed links and gateway informations should be pushed |
latency | Accumulator in which the latencies should be added (caller must set it to 0) |
Reimplemented from simgrid::kernel::routing::ClusterZone.
|
overridevirtual |
Generate the fat tree.
Once all processing nodes have been added, this will make sure the fat tree is generated by calling generateLabels(), generateSwitches() and then connection all nodes between them, using their label.
Reimplemented from simgrid::s4u::NetZone.
|
overridevirtual |
Read the parameters in topo_parameters field.
It will also store the cluster for future use.
Reimplemented from simgrid::kernel::routing::ClusterZone.
void simgrid::kernel::routing::FatTreeZone::addProcessingNode | ( | int | id | ) |
void simgrid::kernel::routing::FatTreeZone::generateDotFile | ( | const std::string & | filename = "fatTree.dot" | ) | const |