4#ifndef COLLECTIVEMODEL_HPP
5#define COLLECTIVEMODEL_HPP
31 if (numRanks <= 1)
return 0;
34 if (messageSize > 0) {
35 if (messageSize <= eagerLimit) {
37 stageTime += messageSize * std::max(g, G);
40 stageTime += messageSize * inverse_bandwidth;
51 std::ceil(std::log2(numRanks))
54 return totalStages * stageTime;
60 std::ceil(std::log2(relRank + 1)) - 1
69 std::ceil(std::log2(numRanks))
75 if (relRank + distance < numRanks) {
77 lastSendStage = stage;
82 if (lastSendStage == receiveStage) {
88 return (lastSendStage + 1) * stageTime;
105 if (messageSize > 0) {
106 if (messageSize <= eagerLimit) {
108 hopTime += messageSize * std::max(g, G);
111 hopTime += messageSize * inverse_bandwidth;
138 if (numRanks <= 1)
return 0;
144 if (messageSize > 0) {
145 if (messageSize <= eagerLimit) {
147 stageTime += messageSize * std::max(g, G);
150 stageTime += messageSize * inverse_bandwidth;
155 return numStages * stageTime;
162 return (rankStage + 1) * stageTime;
178 if (numRanks <= 1)
return 0;
185 if (messageSize > 0) {
186 if (messageSize <= eagerLimit) {
188 stageTime += messageSize * std::max(g, G);
191 stageTime += messageSize * inverse_bandwidth;
198 return totalStages * stageTime + numStages * gamma + rankDelay;
212 uint8_t algorithm = 0,
216 switch(collectiveType) {
220 return calculateRingBroadcast(rank, root, numRanks, messageSize, L, o, g, G, inverse_bandwidth, eagerLimit);
228 return calculateBinomialTreeReduce(rank, root, numRanks, messageSize, L, o, g, G, gamma, inverse_bandwidth, eagerLimit);
232 return calculateAllreduce(rank, numRanks, messageSize, L, o, g, G, gamma, inverse_bandwidth, eagerLimit);
std::size_t DisCosTiC_Datatype
double DisCosTiC_Timetype
static DisCosTiC_Timetype calculateBinomialTreeBroadcast(DisCosTiC_Datatype rank, DisCosTiC_Datatype root, DisCosTiC_Datatype numRanks, DisCosTiC_Datatype messageSize, DisCosTiC_Timetype L, DisCosTiC_Timetype o, DisCosTiC_Timetype g, DisCosTiC_Timetype G, DisCosTiC_Timetype inverse_bandwidth=0, DisCosTiC_Datatype eagerLimit=65535)
static DisCosTiC_Timetype calculateRingBroadcast(DisCosTiC_Datatype rank, DisCosTiC_Datatype root, DisCosTiC_Datatype numRanks, DisCosTiC_Datatype messageSize, DisCosTiC_Timetype L, DisCosTiC_Timetype o, DisCosTiC_Timetype g, DisCosTiC_Timetype G, DisCosTiC_Timetype inverse_bandwidth=0, DisCosTiC_Datatype eagerLimit=65535)
static DisCosTiC_Timetype calculateAllreduce(DisCosTiC_Datatype rank, DisCosTiC_Datatype numRanks, DisCosTiC_Datatype messageSize, DisCosTiC_Timetype L, DisCosTiC_Timetype o, DisCosTiC_Timetype g, DisCosTiC_Timetype G, DisCosTiC_Timetype gamma=0, DisCosTiC_Timetype inverse_bandwidth=0, DisCosTiC_Datatype eagerLimit=65535)
static DisCosTiC_Timetype calculateBinomialTreeReduce(DisCosTiC_Datatype rank, DisCosTiC_Datatype root, DisCosTiC_Datatype numRanks, DisCosTiC_Datatype messageSize, DisCosTiC_Timetype L, DisCosTiC_Timetype o, DisCosTiC_Timetype g, DisCosTiC_Timetype G, DisCosTiC_Timetype gamma=0, DisCosTiC_Timetype inverse_bandwidth=0, DisCosTiC_Datatype eagerLimit=65535)
static DisCosTiC_Timetype calculateCollectiveTime(CollectiveType collectiveType, DisCosTiC_Datatype rank, DisCosTiC_Datatype root, DisCosTiC_Datatype numRanks, DisCosTiC_Datatype messageSize, DisCosTiC_Timetype L, DisCosTiC_Timetype o, DisCosTiC_Timetype g, DisCosTiC_Timetype G, uint8_t algorithm=0, DisCosTiC_Timetype inverse_bandwidth=0, DisCosTiC_Datatype eagerLimit=65535)