SST
14.0.0
StructuralSimulationToolkit
|
Public Member Functions | |
RankInfo | convertPartNum (uint32_t partNum) |
void | simple_partition_step (PartitionComponentMap_t &component_map, ComponentId_t *setA, const int lengthA, int rankA, ComponentId_t *setB, const int lengthB, int rankB, std::map< ComponentId_t, std::map< ComponentId_t, SimTime_t > *> timeTable, int step) |
SimplePartitioner (RankInfo total_ranks, RankInfo my_rank, int verbosity) | |
void | performPartition (PartitionGraph *graph) override |
Function to be overridden by subclasses. More... | |
bool | requiresConfigGraph () override |
bool | spawnOnAllRanks () override |
![]() | |
virtual void | performPartition (ConfigGraph *graph) |
Function to be overridden by subclasses. More... | |
Data Fields | |
SST_ELI_REGISTER_PARTITIONER(SimplePartitioner, "sst", "simple", SST_ELI_ELEMENT_VERSION(1, 0, 0), "Simple partitioning scheme which attempts to partition on high latency links " "while balancing number of components per rank.") private uint32_t | total_parts |
|
overridevirtual |
Function to be overridden by subclasses.
Performs the partitioning of the Graph using the PartitionGraph object.
Result of this function is that every ConfigComponent in graph has a Rank applied to it.
Reimplemented from SST::Partition::SSTPartitioner.
References SST::SparseVectorMap< keyT, classT >::begin(), SST::SparseVectorMap< keyT, classT >::end(), SST::PartitionLink::getMinLatency(), and SST::SparseVectorMap< keyT, classT >::insert().