SST  6.1.0
StructuralSimulationToolkit
linpart.h
1 // Copyright 2009-2016 Sandia Corporation. Under the terms
2 // of Contract DE-AC04-94AL85000 with Sandia Corporation, the U.S.
3 // Government retains certain rights in this software.
4 //
5 // Copyright (c) 2009-2016, Sandia Corporation
6 // All rights reserved.
7 //
8 // This file is part of the SST software package. For license
9 // information, see the LICENSE file in the top level directory of the
10 // distribution.
11 
12 
13 #ifndef SST_CORE_PART_LINEAR
14 #define SST_CORE_PART_LINEAR
15 
16 #include <sst/core/part/sstpart.h>
17 
18 using namespace SST;
19 using namespace SST::Partition;
20 
21 namespace SST {
22 
23 class Output;
24 
25 namespace Partition {
26 
27 
28 
29 /**
30 Performs a linear partition scheme of an SST simulation configuration. In this
31 scheme a list of components (supplied as a graph) are grouped by slicing the list
32 into approximately equal parts. A "part" is generated for each MPI rank performing
33 the simulation. This means Components with sequential ids will be placed close together.
34 In general this scheme provides a very effective partition for most parallel
35 simulations which generate man similar components of interest close together in the input
36 Python configuration. It is also very fast to compute a linear partiton scheme. For
37 more aggressive partition schemes users should try either a simple or Zoltan-based
38 partitioner.
39 */
41 
42  public:
43  /**
44  Creates a new linear partition scheme.
45  \param mpiRankCount Number of MPI ranks in the simulation
46  \param verbosity The level of information to output
47  */
48  SSTLinearPartition(RankInfo rankCount, int verbosity);
49 
50  /**
51  Performs a partition of an SST simulation configuration
52  \param graph The simulation configuration to partition
53  */
54  void performPartition(PartitionGraph* graph);
55 
56  bool requiresConfigGraph() { return false; }
57  bool spawnOnAllRanks() { return false; }
58 
59  static SSTPartitioner* allocate(RankInfo total_ranks, RankInfo my_rank, int verbosity) {
60  return new SSTLinearPartition(total_ranks, verbosity);
61  }
62 
63  protected:
64  /** Number of ranks in the simulation */
66  /** Output object to print partitioning information */
68 
69  static bool initialized;
70 };
71 
72 }
73 }
74 
75 #endif
Output object provides consistant method for outputing data to stdout, stderr and/or sst debug file...
Definition: output.h:54
Output * partOutput
Output object to print partitioning information.
Definition: linpart.h:67
Definition: configGraph.h:397
Definition: element.h:38
Definition: action.cc:17
Performs a linear partition scheme of an SST simulation configuration.
Definition: linpart.h:40
Definition: rankInfo.h:21
Base class for Partitioning graphs.
Definition: sstpart.h:27
RankInfo rankcount
Number of ranks in the simulation.
Definition: linpart.h:65