130 using PriorityQueue_t = std::priority_queue<DisCosTiC_OP, Operations, OpTimeComparator>;
131 using Event = std::pair<DisCosTiC_Indextype, DisCosTiC::AST_OP *>;
149 for (DisCosTiC::ListqueueOp::iterator it = Q->begin(); it != Q->end(); ++it)
163 template <
typename... T>
166 using first_type =
typename std::tuple_element<0, std::tuple<T...>>::type;
167 return std::vector<first_type>{std::forward<T>(args)...};
std::size_t DisCosTiC_Indextype
std::size_t DisCosTiC_Datatype
double DisCosTiC_Timetype
static const DisCosTiC_Indextype MPI_ANY_SOURC
static const DisCosTiC_Indextype MPI_ANY_TA
std::list< DisCosTiC_queueOP > ListqueueOp
auto make_vector(T &&...args)
std::priority_queue< DisCosTiC_OP, Operations, OpTimeComparator > PriorityQueue_t
std::map< std::string, std::set< int > > NCMInterClusterData
std::pair< DisCosTiC_Indextype, DisCosTiC::AST_OP * > Event
std::pair< DisCosTiC_Indextype, DisCosTiC::AST_OP_ > idNodeTypePairT
std::vector< std::vector< idNodeTypePairT > > idNodeTypePair
std::vector< std::vector< Event > > idNodePair
std::array< DisCosTiC_Timetype, 4 > Networktype
std::vector< AST_OP_TYPE > VecDeserialNode
std::vector< DisCosTiC_OP > Operations
std::map< std::string, std::map< std::string, std::set< int > > > NCMIntraAndInterNodeData
std::tuple< idNodePair, idNodePair, idNodePair > tupleIdNodePair
std::vector< ListqueueOp > VecListqueueOp
DisCosTiC_Indextype collectiveNumRanks
nubmer of ranks participating in collective
char mode
TODO: add blocking/non-blocking mode.
uint8_t algorithm
algo choice for collective
DisCosTiC_Indextype network
std::vector< DisCosTiC_Indextype > IdepOperations
DisCosTiC_Indextype depCount
std::vector< DisCosTiC_Indextype > DepOperations
uint8_t collectiveType
collective operation type
DisCosTiC_Indextype label
DisCosTiC_Indextype collectiveRoot
root rank for collectives which have root (-1 if no root)
DisCosTiC_Indextype target
DisCosTiC_Datatype bufSize
DisCosTiC_Indextype depCount
DisCosTiC_Indextype depApdxStartLabel
DisCosTiC_Datatype bufSize
DisCosTiC_Indextype collectiveNumRanks
nubmer of ranks participating in collective
DisCosTiC_Indextype network
DisCosTiC_Indextype idepsCount
DisCosTiC_Indextype idepApdxStartLabel
DisCosTiC_Indextype label
DisCosTiC_Indextype target
uint8_t collectiveType
collective operation type
char mode
TODO: add blocking/non-blocking mode.
DisCosTiC_Indextype collectiveRoot
root rank for collectives which have root (-1 if no root)
DisCosTiC_Indextype depsCount
uint8_t algorithm
algo choice for collective
DisCosTiC_Indextype collectiveRoot
root rank for collectives which have root (-1 if no root)
DisCosTiC_Timetype bufSize
number of bytes (data size) of this operation
char mode
TODO: add blocking/non-blocking mode.
std::vector< AST_OP * > DepOperations
dependencies for blocking routines, i.e., other operations that depend on this current operation
DisCosTiC_Indextype collectiveNumRanks
nubmer of ranks participating in collective
DisCosTiC_Indextype depCount
DisCosTiC_Indextype label
index/identifier of this operation for each rack
DisCosTiC_Indextype node
node or proceessing element for this operation
DisCosTiC_Indextype network
type of network for this operation
uint8_t collectiveType
collective operation type
DisCosTiC_Indextype target
rank of target/partner (source for recv / dest for send / no real target for comp,...
DisCosTiC_Indextype tag
tag of AST_OP (no real tag for comp, just added for completeness)
char type
type of AST_OP send, receive or computation
uint8_t algorithm
algo choice for collective
std::vector< AST_OP * > IdepOperations
dependencies for non-blocking routines, i.e., other operations that depend on current operation
char mode
TODO: add blocking/non-blocking mode.
DisCosTiC_Indextype network
uint8_t algorithm
algo choice for collective
uint8_t collectiveType
collective operation type
DisCosTiC_Timetype syncstart
ifdef RANKSYNC
DisCosTiC_Timetype numOpsInQueue
STRICT_ORDER a timestamp that determines the (original) insertion order of elemenqueueOp in the queue...
DisCosTiC_Datatype bufSize
DisCosTiC_Indextype label
DisCosTiC_Indextype collectiveNumRanks
nubmer of ranks participating in collective
DisCosTiC_Indextype collectiveRoot
root rank for collectives which have root (-1 if no root)
DisCosTiC_Timetype starttime
only used for MSGs to identify start times
DisCosTiC_Indextype target
DisCosTiC_Indextype rank
owning rank of this operation
DisCosTiC_Indextype tag
TODO: tag can go, if matching.
DisCosTiC_Indextype src
TODO: src can go, if matching.
DisCosTiC_Timetype starttime
for visualization
DisCosTiC_Datatype bufSize
DisCosTiC_Indextype label
this matches and removes operations from list if found, otherwise returns false
static bool listmatch(const DisCosTiC::DisCosTiC_OP &OP, DisCosTiC::ListqueueOp *Q, DisCosTiC::DisCosTiC_queueOP *matchedOP_=NULL)
this is a comparison functor that can be used to compare and sort DisCosTiC_OP by time
bool operator()(DisCosTiC_OP a, DisCosTiC_OP b)