DisCostiC v2.0.0
Distributed Cost in Cluster: a cross-architecture simulator for massively parallel MPI programs
Loading...
Searching...
No Matches
DisCosTiC Namespace Reference

< benchmark test cases More...

Classes

struct  AST_OP
 
struct  AST_OP_
 
struct  AST_OP_TYPE
 
class  Benchmark
 end of Benchmark class More...
 
class  CollectiveModel
 
class  CompModel
 
struct  DisCosTiC_OP
 
struct  DisCosTiC_queueOP
 
class  Grid
 
class  Grid_Init
 this class exposes all P graphVec and manages dependencies and execution order. It returns a list of executable operations and offers an interface to mark operations as executed. More...
 
struct  iteratorRange
 iterator ranges for each entityTypes to support iteration with range-based for loops. Iterating over sets of entityTypes is one of the most common operation. Our infrastructure implements this custom range-based for loops in the C++ ways by providing iterators and matching begin(), end() and stepSize(scalarT stepSize) methods. More...
 
struct  OpMatcher
 this matches and removes operations from list if found, otherwise returns false More...
 
struct  OpTimeComparator
 this is a comparison functor that can be used to compare and sort DisCosTiC_OP by time More...
 
struct  std_iter
 a time stepping loop More...
 

Typedefs

using VecDeserialNode = std::vector<AST_OP_TYPE>
 
using Operations = std::vector<DisCosTiC_OP>
 
using ListqueueOp = std::list<DisCosTiC_queueOP>
 
using VecListqueueOp = std::vector<ListqueueOp>
 
using PriorityQueue_t = std::priority_queue<DisCosTiC_OP, Operations, OpTimeComparator>
 
using Event = std::pair<DisCosTiC_Indextype, DisCosTiC::AST_OP *>
 
using idNodeTypePairT = std::pair<DisCosTiC_Indextype, DisCosTiC::AST_OP_>
 
using idNodePair = std::vector<std::vector<Event>>
 
using idNodeTypePair = std::vector<std::vector<idNodeTypePairT>>
 
using tupleIdNodePair = std::tuple<idNodePair, idNodePair, idNodePair>
 
using Networktype = std::array<DisCosTiC_Timetype, 4>
 
using NCMIntraAndInterNodeData = std::map<std::string, std::map<std::string, std::set<int>>>
 
using NCMInterClusterData = std::map<std::string, std::set<int>>
 
using VecSeqGraph_t = std::vector<Grid>
 
using VecGraph_t = std::vector<Benchmark>
 

Enumerations

enum  Operation_t {
  SEND = 1 , RECV = 2 , COMP = 3 , MSG =4 ,
  COMPADD = 5 , COLLECTIVE = 6
}
 The Operation_t enum defines different opertation types of entities. More...
 
enum  Mode_t { NONBLOCKING , BLOCKING }
 The Mode_t enum defines operation type of SEND and RECV entities (i.e., either blocking calls that reutn on;y on completion of operation or non-blocking calls that return with start of operation) More...
 
enum  CollectiveType { COLL_BCAST = 0 , COLL_REDUCE = 1 , COLL_ALLREDUCE = 2 }
 
enum  BcastAlgorithm { BCAST_BINOMIAL = 0 , BCAST_RING = 1 }
 
enum  ReduceAlgorithm { REDUCE_BINOMIAL = 0 }
 
enum  AllreduceAlgorithm { ALLREDUCE_RECURSIVE_DOUBLING = 0 }
 

Functions

template<typename... T>
auto make_vector (T &&...args)
 
template<typename scalarT >
iteratorRange< scalarT > getRange (scalarT begin, scalarT end)
 
template<typename scalarT >
iteratorRange< scalarT > getRange (scalarT end)
 

Detailed Description

< benchmark test cases

< enumerated types < data structures

Typedef Documentation

◆ Event

Definition at line 131 of file DataStruct.hpp.

◆ idNodePair

using DisCosTiC::idNodePair = std::vector<std::vector<Event>>

Definition at line 133 of file DataStruct.hpp.

◆ idNodeTypePair

using DisCosTiC::idNodeTypePair = std::vector<std::vector<idNodeTypePairT>>

Definition at line 134 of file DataStruct.hpp.

◆ idNodeTypePairT

Definition at line 132 of file DataStruct.hpp.

◆ ListqueueOp

Definition at line 128 of file DataStruct.hpp.

◆ NCMInterClusterData

using DisCosTiC::NCMInterClusterData = std::map<std::string, std::set<int>>

Definition at line 139 of file DataStruct.hpp.

◆ NCMIntraAndInterNodeData

using DisCosTiC::NCMIntraAndInterNodeData = std::map<std::string, std::map<std::string, std::set<int>>>

Definition at line 138 of file DataStruct.hpp.

◆ Networktype

Definition at line 137 of file DataStruct.hpp.

◆ Operations

using DisCosTiC::Operations = std::vector<DisCosTiC_OP>

Definition at line 127 of file DataStruct.hpp.

◆ PriorityQueue_t

Definition at line 130 of file DataStruct.hpp.

◆ tupleIdNodePair

Definition at line 135 of file DataStruct.hpp.

◆ VecDeserialNode

Definition at line 126 of file DataStruct.hpp.

◆ VecGraph_t

using DisCosTiC::VecGraph_t = std::vector<Benchmark>

Definition at line 227 of file STREAM_COLLECTIVE.hpp.

◆ VecListqueueOp

using DisCosTiC::VecListqueueOp = std::vector<ListqueueOp>

Definition at line 129 of file DataStruct.hpp.

◆ VecSeqGraph_t

using DisCosTiC::VecSeqGraph_t = std::vector<Grid>

Definition at line 230 of file Grid.hpp.

Enumeration Type Documentation

◆ AllreduceAlgorithm

Enumerator
ALLREDUCE_RECURSIVE_DOUBLING 

Definition at line 53 of file enum.hpp.

◆ BcastAlgorithm

Enumerator
BCAST_BINOMIAL 
BCAST_RING 

Definition at line 44 of file enum.hpp.

◆ CollectiveType

Enumerator
COLL_BCAST 
COLL_REDUCE 
COLL_ALLREDUCE 

Definition at line 38 of file enum.hpp.

◆ ReduceAlgorithm

Enumerator
REDUCE_BINOMIAL 

Definition at line 49 of file enum.hpp.

Function Documentation

◆ getRange() [1/2]

template<typename scalarT >
iteratorRange< scalarT > DisCosTiC::getRange ( scalarT begin,
scalarT end )

Definition at line 161 of file DataType.hpp.

Referenced by DisCosTiC::Grid::getOp(), DisCosTiC::Grid::getTypeSortedOps(), DisCosTiC::Grid_Init::Grid_Init(), main(), DisCosTiC::Benchmark::Oneway_PositiveDisplacement(), AST::print_depTable(), AST::print_indicesDeserializedTable(), AST::print_indicesTable(), DisCosTiC::Grid::setOp(), and DisCosTiC::Grid::unsetOp().

+ Here is the caller graph for this function:

◆ getRange() [2/2]

template<typename scalarT >
iteratorRange< scalarT > DisCosTiC::getRange ( scalarT end)

Definition at line 166 of file DataType.hpp.

◆ make_vector()

template<typename... T>
auto DisCosTiC::make_vector ( T &&... args)

Definition at line 164 of file DataStruct.hpp.