Line data Source code
1 : /**
2 : * Copyright (c) 2025 Huawei Technologies Co., Ltd.
3 : * This program is free software, you can redistribute it and/or modify it under the terms and conditions of
4 : * CANN Open Software License Agreement Version 2.0 (the "License").
5 : * Please refer to the License for details. You may not use this file except in compliance with the License.
6 : * THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OF ANY KIND, EITHER EXPRESS OR IMPLIED,
7 : * INCLUDING BUT NOT LIMITED TO NON-INFRINGEMENT, MERCHANTABILITY, OR FITNESS FOR A PARTICULAR PURPOSE.
8 : * See LICENSE in the root of the software repository for the full text of the License.
9 : */
10 :
11 : #include "log.h"
12 :
13 : #include "alg_data_trans_wrapper.h"
14 : #include "ins_alg_template/ins_temp_all_gather_nhr.h"
15 :
16 : namespace Hccl {
17 0 : InsTempAllGatherNHR::InsTempAllGatherNHR(
18 : const RankId virtualRank, const u32 tempRankSize, const std::vector<std::vector<RankId>>& tempVTopo,
19 0 : const std::map<RankId, u32>& tempVirtRankMap)
20 0 : : InsAlgTemplateBase(virtualRank, tempRankSize, tempVTopo, tempVirtRankMap)
21 0 : {}
22 :
23 0 : InsTempAllGatherNHR::~InsTempAllGatherNHR() {}
24 :
25 0 : HcclResult InsTempAllGatherNHR::CalcRes(AlgTempResReq& tempResReq)
26 : {
27 0 : CHK_PRT_RET(
28 : CalcResLinksNHR(myRank_, tempRankSize_, tempVTopo_, tempResReq) != HcclResult::HCCL_SUCCESS,
29 : HCCL_ERROR("[CollAlgFactory] [InsTempAllGatherNHR] Rank [%d], resLinks calculation error!", myRank_),
30 : HcclResult::HCCL_E_INTERNAL);
31 0 : auto& linkReq = tempResReq.links;
32 0 : u32 pathNum = 0;
33 0 : for (auto resReqIter = linkReq.begin(); resReqIter != linkReq.end(); resReqIter++) {
34 0 : auto remoteRank = resReqIter->first;
35 0 : if (rank2PathNumMap_.find(remoteRank) == rank2PathNumMap_.end() || rank2PathNumMap_[remoteRank] == 0) {
36 0 : HCCL_ERROR("[InsTempAllGatherNHR] No path to remoteRank[%d]", remoteRank);
37 0 : return HcclResult::HCCL_E_INTERNAL;
38 : }
39 0 : if (pathNum == 0) {
40 0 : pathNum = rank2PathNumMap_[remoteRank];
41 0 : } else if (rank2PathNumMap_[remoteRank] != pathNum) {
42 0 : HCCL_ERROR(
43 : "[InsTempAllGatherNHR] Inconsistency pathNum to remoteRanks, Previous consistent pathNum=[%u], "
44 : "mismatched "
45 : "remoteRank=[%d], pathNum=[%u]",
46 : pathNum, remoteRank, rank2PathNumMap_[remoteRank]);
47 0 : return HcclResult::HCCL_E_INTERNAL;
48 : }
49 0 : resReqIter->second = pathNum;
50 : }
51 :
52 : // NHR 需要的 que Num 为 1
53 0 : tempResReq.queNum = 1 * pathNum;
54 0 : HCCL_INFO("[InsTempAllGatherNHR] tempResReq.queNum = %u", tempResReq.queNum);
55 0 : tempResReq.streamNum = tempResReq.queNum;
56 0 : tempResReq.queNotifys = CreateMasterSlaveQueNotifiesRequest(tempResReq.queNum);
57 :
58 0 : return HcclResult::HCCL_SUCCESS;
59 : }
60 :
61 : HcclResult
62 0 : InsTempAllGatherNHR::CalcSliceInfo(const AllignInfo& allignInfo, const u64 dataSize, RankSliceInfo& sliceInfoVec)
63 : {
64 0 : std::vector<SliceInfo> tmp(tempVTopo_.size());
65 0 : sliceInfoVec.resize(tempRankSize_, tmp);
66 :
67 0 : CHK_RET(CalcRsAgSliceInfoNHR(myRank_, tempRankSize_, allignInfo, dataSize, sliceInfoVec));
68 :
69 0 : return HcclResult::HCCL_SUCCESS;
70 0 : }
71 :
72 0 : HcclResult InsTempAllGatherNHR::GenExtIns(
73 : const TempFuncs& tempFuncs, const TemplateDataParams& tempAlgParams, const ResLinks& tempLinks,
74 : std::vector<InsQuePtr>& tempInsQues)
75 : {
76 0 : if (IsPcieLink(tempLinks)) {
77 0 : dmaMode_ = DmaMode::GET;
78 : }
79 0 : opMode_ = tempFuncs.opMode;
80 0 : tempAlgParams_ = tempAlgParams;
81 0 : tempLinks_ = tempLinks;
82 :
83 0 : uint32_t linkNum = tempLinks.begin()->second.size();
84 : // 流的数量不能少于linkNum
85 0 : CHK_PRT_RET(
86 : linkNum > tempInsQues.size(),
87 : HCCL_ERROR("[CollAlgFactory] [InsTempAllReduceNHR] Rank [%d], requiredQue Error.", myRank_),
88 : HcclResult::HCCL_E_INTERNAL);
89 0 : CHK_RET(LocalDataCopy(tempInsQues));
90 0 : CHK_RET(RunNHR(tempInsQues));
91 0 : CHK_RET(PostLocalCopy(tempInsQues));
92 :
93 0 : return HcclResult::HCCL_SUCCESS;
94 : }
95 :
96 0 : HcclResult InsTempAllGatherNHR::GetStepInfo(u32 step, u32 nSteps, AicpuNHRStepInfo& stepInfo)
97 : {
98 0 : u32 rankIdx = 0;
99 0 : CHK_RET(GetAlgRank(myRank_, tempVTopo_[0], rankIdx));
100 0 : stepInfo.txSliceIdxs.clear();
101 0 : stepInfo.rxSliceIdxs.clear();
102 0 : stepInfo.step = step;
103 0 : stepInfo.myRank = rankIdx;
104 :
105 : // 计算通信对象
106 0 : u32 deltaRank = 1 << (nSteps - 1 - step);
107 0 : u32 recvFrom = (rankIdx + tempRankSize_ - deltaRank) % tempRankSize_;
108 0 : u32 sendTo = (rankIdx + deltaRank) % tempRankSize_;
109 :
110 : // 数据份数和数据编号增量
111 0 : u32 nSlices = (tempRankSize_ - 1 + (1 << (nSteps - 1 - step))) / (1 << (nSteps - step));
112 0 : u32 deltaSliceIndex = 1 << (nSteps - step);
113 0 : u32 txSliceIdx = rankIdx;
114 0 : u32 rxSliceIdx = (rankIdx - (1 << (nSteps - 1 - step)) + tempRankSize_) % tempRankSize_;
115 :
116 0 : stepInfo.nSlices = nSlices;
117 0 : stepInfo.toRank = sendTo;
118 0 : stepInfo.fromRank = recvFrom;
119 :
120 0 : for (u32 i = 0; i < nSlices; i++) {
121 0 : stepInfo.txSliceIdxs.push_back(txSliceIdx);
122 0 : stepInfo.rxSliceIdxs.push_back(rxSliceIdx);
123 0 : HCCL_DEBUG("[AllGatherNHR][GetStepInfo] i[%u] txSliceIdx[%u] rxSliceIdx[%u]", i, txSliceIdx, rxSliceIdx);
124 :
125 0 : txSliceIdx = (txSliceIdx + tempRankSize_ - deltaSliceIndex) % tempRankSize_;
126 0 : rxSliceIdx = (rxSliceIdx + tempRankSize_ - deltaSliceIndex) % tempRankSize_;
127 : }
128 0 : return HcclResult::HCCL_SUCCESS;
129 : }
130 :
131 0 : RankId InsTempAllGatherNHR::GetRankFromMap(const u32 rankIdx) { return tempVTopo_[0].at(rankIdx); }
132 :
133 0 : HcclResult InsTempAllGatherNHR::LocalDataCopy(std::vector<InsQuePtr>& tempInsQues)
134 : {
135 0 : u32 algRankIdx = 0;
136 0 : CHK_RET(GetAlgRank(myRank_, tempVTopo_[0], algRankIdx));
137 : // 做个保护，tailSize填写为0就认为尾块是正常块
138 0 : u64 tailSize = (tempAlgParams_.tailSize == 0) ? tempAlgParams_.sliceSize : tempAlgParams_.tailSize;
139 0 : u64 sliceSize = (algRankIdx == tempRankSize_ - 1) ? tailSize : tempAlgParams_.sliceSize;
140 0 : for (u64 rpt = 0; rpt < tempAlgParams_.repeatNum; ++rpt) {
141 0 : const u64 inBaseOff = tempAlgParams_.buffInfo.inBuffBaseOff + rpt * tempAlgParams_.inputRepeatStride;
142 0 : const u64 scratchBase = tempAlgParams_.buffInfo.scratchBuffBaseOff
143 0 : + rpt * (tempAlgParams_.sliceSize * (tempRankSize_ - 1) + tailSize);
144 :
145 0 : const u64 inOff = tempAlgParams_.inputSliceStride * algRankIdx + inBaseOff;
146 0 : const u64 scOff = scratchBase + tempAlgParams_.sliceSize * algRankIdx;
147 :
148 0 : DataSlice src(tempAlgParams_.buffInfo.inBuffType, inOff, sliceSize);
149 0 : DataSlice dst(tempAlgParams_.buffInfo.scratBuffType, scOff, sliceSize);
150 :
151 0 : auto ins = std::make_unique<InsLocalCopy>(src, dst);
152 0 : tempInsQues[0]->Append(std::move(ins));
153 0 : }
154 0 : return HcclResult::HCCL_SUCCESS;
155 : }
156 :
157 0 : HcclResult InsTempAllGatherNHR::PostLocalCopy(std::vector<InsQuePtr>& tempInsQues)
158 : {
159 0 : CHK_PRT_RET(
160 : tempInsQues.empty(), HCCL_ERROR("[AllGatherNHR][PostLocalCopy] empty queue"), HcclResult::HCCL_E_INTERNAL);
161 0 : CHK_PTR_NULL(tempInsQues[0]);
162 : // 做个保护，tailSize填写为0就认为尾块是正常块
163 0 : u64 tailSize = (tempAlgParams_.tailSize == 0) ? tempAlgParams_.sliceSize : tempAlgParams_.tailSize;
164 0 : for (u64 rpt = 0; rpt < tempAlgParams_.repeatNum; ++rpt) {
165 0 : const u64 outBaseOff = tempAlgParams_.buffInfo.outBuffBaseOff + rpt * tempAlgParams_.outputRepeatStride;
166 0 : const u64 scratchBase = tempAlgParams_.buffInfo.scratchBuffBaseOff
167 0 : + rpt * (tempAlgParams_.sliceSize * (tempRankSize_ - 1) + tailSize);
168 :
169 0 : for (u32 algIdx = 0; algIdx < tempRankSize_; ++algIdx) {
170 0 : const u64 scratchOffset = scratchBase + tempAlgParams_.sliceSize * algIdx;
171 0 : const u64 outOffset = tempAlgParams_.outputSliceStride * algIdx + outBaseOff;
172 : // 如果是最后一张卡需要用尾部数据计算
173 0 : u64 sliceSize = (algIdx == tempRankSize_ - 1) ? tailSize : tempAlgParams_.sliceSize;
174 0 : DataSlice src(tempAlgParams_.buffInfo.scratBuffType, scratchOffset, sliceSize);
175 0 : DataSlice dst(tempAlgParams_.buffInfo.outBuffType, outOffset, sliceSize);
176 :
177 0 : auto ins = std::make_unique<InsLocalCopy>(src, dst);
178 0 : tempInsQues[0]->Append(std::move(ins));
179 0 : }
180 : }
181 0 : return HcclResult::HCCL_SUCCESS;
182 : }
183 :
184 0 : HcclResult InsTempAllGatherNHR::RunNHR(std::vector<InsQuePtr>& tempInsQues)
185 : {
186 0 : u32 mainQueIdx = 0;
187 : // 流间前同步，主流通知从流，只有一个流则不做任何事
188 0 : CHK_RET(PreSyncQues(tempInsQues, mainQueIdx));
189 0 : const u32 nSteps = GetNHRStepNum(tempRankSize_);
190 0 : u32 myAlgRank = 0;
191 0 : CHK_RET(GetAlgRank(myRank_, tempVTopo_[0], myAlgRank));
192 : // 做个保护，tailSize填写为0就认为尾块是正常块
193 0 : u64 tailSize = (tempAlgParams_.tailSize == 0) ? tempAlgParams_.sliceSize : tempAlgParams_.tailSize;
194 0 : for (u32 step = 0; step < nSteps; ++step) {
195 0 : AicpuNHRStepInfo stepInfo;
196 0 : CHK_RET(GetStepInfo(step, nSteps, stepInfo));
197 0 : const std::vector<LinkData>& linkRecv = tempLinks_.at(GetRankFromMap(stepInfo.fromRank));
198 0 : const std::vector<LinkData>& linkSend = tempLinks_.at(GetRankFromMap(stepInfo.toRank));
199 0 : HCCL_DEBUG(
200 : "[InsTempAllGatherNHR] rank[%d] rankSize[%u] recvFrom[%u] sendTo[%u] step[%u] nSteps[%u] nSlices[%u]",
201 : myRank_, tempRankSize_, stepInfo.fromRank, stepInfo.toRank, step, nSteps, stepInfo.nSlices);
202 0 : if (linkRecv.size() != linkSend.size()) {
203 0 : HCCL_ERROR("linkRecv.size()!=linkSend.size()");
204 0 : return HcclResult::HCCL_E_INTERNAL;
205 : }
206 0 : HCCL_INFO("GetRankFromMap(stepInfo.fromRank)=%d", GetRankFromMap(stepInfo.fromRank));
207 0 : u32 linkNum = rank2PathNumMap_.at(GetRankFromMap(stepInfo.fromRank));
208 0 : if (linkNum != linkRecv.size()) {
209 0 : HCCL_ERROR("InsTempAllGatherMesh1D::RunMesh linkNum != linkRecv.size()");
210 0 : return HcclResult::HCCL_E_INTERNAL;
211 : }
212 0 : std::vector<float> dataSplitRate(linkNum);
213 0 : CHK_RET(CalcDataSplitRateForLinks(
214 : linkRecv, dataSplitRate)); // todo, 修改CalcDataSplitRateForLinks接口，变为对每个对端分别计算
215 0 : for (u32 j = 0; j < linkNum; j++) {
216 0 : std::vector<DataSlice> txSrcSlices;
217 0 : std::vector<DataSlice> txDstSlices;
218 0 : std::vector<DataSlice> rxSrcSlices;
219 0 : std::vector<DataSlice> rxDstSlices;
220 0 : for (u32 rpt = 0; rpt < tempAlgParams_.repeatNum; ++rpt) {
221 0 : const u64 scratchRepeatStride = tempAlgParams_.sliceSize * (tempRankSize_ - 1) + tailSize;
222 0 : const u64 scratchBase = tempAlgParams_.buffInfo.scratchBuffBaseOff + rpt * scratchRepeatStride;
223 0 : for (u32 i = 0; i < stepInfo.nSlices; ++i) {
224 0 : const u32 txIdx = stepInfo.txSliceIdxs[i];
225 0 : const u32 rxIdx = stepInfo.rxSliceIdxs[i];
226 0 : const u64 txScratchOff = scratchBase + tempAlgParams_.sliceSize * txIdx;
227 0 : const u64 rxScratchOff = scratchBase + tempAlgParams_.sliceSize * rxIdx;
228 0 : u64 sliceSize = (myAlgRank == tempRankSize_ - 1) ? tailSize : tempAlgParams_.sliceSize;
229 0 : DataSlice txSrcSliceAllLink(tempAlgParams_.buffInfo.scratBuffType, txScratchOff, sliceSize);
230 0 : DataSlice txDstSliceAllLink(tempAlgParams_.buffInfo.scratBuffType, txScratchOff, sliceSize);
231 0 : DataSlice rxSrcSliceAllLink(tempAlgParams_.buffInfo.scratBuffType, rxScratchOff, sliceSize);
232 0 : DataSlice rxDstSliceAllLink(tempAlgParams_.buffInfo.scratBuffType, rxScratchOff, sliceSize);
233 0 : txSrcSlices.emplace_back(CalcDataSliceForLinks(txSrcSliceAllLink, dataSplitRate, j, dataType_));
234 0 : txDstSlices.emplace_back(CalcDataSliceForLinks(txDstSliceAllLink, dataSplitRate, j, dataType_));
235 0 : rxSrcSlices.emplace_back(CalcDataSliceForLinks(rxSrcSliceAllLink, dataSplitRate, j, dataType_));
236 0 : rxDstSlices.emplace_back(CalcDataSliceForLinks(rxDstSliceAllLink, dataSplitRate, j, dataType_));
237 : }
238 : }
239 0 : TxRxSlicesList sendRecvSlicesList({txSrcSlices, txDstSlices}, {rxSrcSlices, rxDstSlices});
240 0 : TxRxLinks sendRecvLinks(linkSend[j], linkRecv[j]);
241 0 : SendRecvInfo sendRecvInfo(sendRecvLinks, sendRecvSlicesList);
242 0 : CHK_PRT_RET(
243 : SendRecv(sendRecvInfo, tempInsQues[j], 0, true, dmaMode_),
244 : HCCL_ERROR("[InsTempAllGatherNHR] sendrecv failed (step=%u)", step), HcclResult::HCCL_E_INTERNAL);
245 0 : }
246 0 : }
247 : // 流间后同步，从流通知主流
248 0 : CHK_RET(PostSyncQues(tempInsQues, mainQueIdx));
249 0 : return HcclResult::HCCL_SUCCESS;
250 : }
251 :
252 : } // namespace Hccl
|
