SimGrid  3.11
Versatile Simulation of Distributed Systems
 All Data Structures Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
FatTreeNode Class Reference

A node in a fat tree. A FatTreeNode can either be a switch or a processing node. Switches are identified by a negative ID. This class is closely related to fat. More...

#include <surf_routing_cluster_fat_tree.hpp>

Data Fields

int id
 
std::vector< unsigned int > label
 
std::vector< FatTreeLink * > children
 
std::vector< FatTreeLink * > parents
 
NetworkLinklimiterLink
 
NetworkLinkloopback
 

Detailed Description

A node in a fat tree. A FatTreeNode can either be a switch or a processing node. Switches are identified by a negative ID. This class is closely related to fat.

Field Documentation

int FatTreeNode::id

Unique ID which identifies every node.

std::vector<unsigned int> FatTreeNode::label

In order to link nodes between them, each one must be assigned a label, consisting of l integers, l being the levels number of the tree. Each label is unique in the level, and the way it is generated allows the construction of a fat tree which fits the desired topology.

std::vector<FatTreeLink*> FatTreeNode::children

Links to the lower level, where the position in the vector corresponds to a port number.

std::vector<FatTreeLink*> FatTreeNode::parents

Links to the upper level, where the position in the vector corresponds to a port number.

NetworkLink* FatTreeNode::limiterLink

Virtual link standing for the node global capacity.

NetworkLink* FatTreeNode::loopback

If present, communications from this node to this node will pass through it instead of passing by an upper level switch.


The documentation for this class was generated from the following files: