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 <ios>
12 : #include <iostream>
13 :
14 : #include "log.h"
15 : #include "ccu_temp_all_to_all_v_mesh_2D.h"
16 : #include "ccu_rank_group.h"
17 : #include "ccu_ctx_creator_registry.h"
18 : #include "ccu_context_all_to_all_v_mesh2d.h"
19 : #include "ccu_ins_group.h"
20 :
21 : namespace Hccl {
22 : constexpr u32 MESH_2D_DIMENSION_NUM = 2;
23 :
24 : static CcuInstRegister<CcuContextAllToAllVMesh2D> g_registerAlltoAllV(CcuInstType::CCU_ALLTOALLV_MESH_2D_DIRECT);
25 :
26 0 : CcuTempAlltoAllVMesh2D::CcuTempAlltoAllVMesh2D(
27 : const RankId virtualRank, const u32 tempRankSize, const std::vector<std::vector<RankId>>& tempVTopo,
28 0 : const std::map<RankId, u32>& tempVirtRankMap)
29 0 : : CcuAlgTemplateBase(virtualRank, tempRankSize, tempVTopo, tempVirtRankMap)
30 : {
31 : // 填充框内的维度大小
32 0 : if (tempVTopo_.size() != MESH_2D_DIMENSION_NUM || tempVTopo_[0].size() <= 1
33 0 : || tempVTopo_[1].size() <= 1) { // concurrmesh的topoMatch返回的vTopo大小应当为2，对应X轴和Y轴的大小
34 0 : THROW<InvalidParamsException>(StringFormat(
35 : "[CcuTempAlltoAllVMesh2D] Rank[%d], Invalid tempVTopo "
36 : "Size[%u] or Invalid tempVTopo[0] size [%u] or tempVTopo[1] size [%u].",
37 0 : myRank_, tempVTopo_.size(), tempVTopo_[0].size(), tempVTopo_[1].size()));
38 : }
39 0 : dimSize_.emplace_back(tempVTopo[0].size());
40 0 : dimSize_.emplace_back(tempVTopo[1].size());
41 0 : }
42 :
43 0 : CcuTempAlltoAllVMesh2D::~CcuTempAlltoAllVMesh2D() {}
44 :
45 0 : void CcuTempAlltoAllVMesh2D::SetA2ASendRecvInfo(const A2ASendRecvInfo& sendRecvInfo)
46 : {
47 0 : localSendRecvInfo_ = sendRecvInfo;
48 0 : return;
49 : }
50 :
51 0 : HcclResult CcuTempAlltoAllVMesh2D::CalcRes(AlgTempResReq& tempResReq)
52 : {
53 0 : tempResReq.queNum = 1; // 只申请一个insQue，填充一个insGroup，由框架将其中的ins放在多个stream上
54 0 : tempResReq.streamNum = tempResReq.queNum + 1; // 多申请一个 stream 给 ccuInsGroup
55 0 : uint32_t dieNum = tempVTopo_.size();
56 0 : if (dieNum != 2) { // concurrmesh的topoMatch返回的vTopo大小应当为2，对应X轴和Y轴的大小
57 0 : THROW<InvalidParamsException>(
58 0 : StringFormat("[CcuTempAlltoAllVMesh2D] Rank[%d], Invalid IODieNum[%u].", myRank_, dieNum));
59 : }
60 0 : HCCL_INFO(
61 : "[CcuTempAlltoAllVMesh2D] Rank[%d] requiredQueNum[%u] VtopoSize[%u], VtopoSize0[%u] VtopoSize1[%u].", myRank_,
62 : tempResReq.queNum, tempVTopo_.size(), tempVTopo_[0].size(), tempVTopo_[1].size());
63 :
64 : uint32_t myAlgRank;
65 0 : for (u32 dim = 0; dim < tempVTopo_.size(); dim++) {
66 0 : CHK_RET(GetAlgRank(myRank_, tempVTopo_[dim], myAlgRank));
67 0 : for (u32 queIdx = 0; queIdx < tempVTopo_[dim].size() - 1; queIdx++) {
68 : // find neighbors -> virtualRank
69 0 : u32 neighborAlgRank = (myAlgRank + 1 + queIdx) % (tempVTopo_[dim].size());
70 0 : RankId neighborRank = tempVTopo_[dim][neighborAlgRank];
71 0 : HCCL_INFO(
72 : "[CollAlgFactory] [CcuTempAlltoAllVMesh2D] Rank[%d], Dim[%u], NeighborRank[%d].", myRank_, dim,
73 : neighborRank);
74 :
75 : // LinkNum
76 0 : tempResReq.links[neighborRank] = 1;
77 : }
78 : }
79 :
80 0 : return HcclResult::HCCL_SUCCESS;
81 : }
82 :
83 0 : uint64_t CcuTempAlltoAllVMesh2D::CalcSendRecvNumSubStep(uint64_t sliceSize)
84 : {
85 0 : sendNumSubStep_.clear();
86 0 : recvNumSubStep_.clear();
87 0 : uint64_t numSubStep = 0;
88 0 : if (localSendRecvInfo_.sendLength.size() != localSendRecvInfo_.recvLength.size()) {
89 0 : THROW<InvalidParamsException>(StringFormat(
90 : "[CcuTempAlltoAllVMesh2D][CalcSendRecvNumSubStep] Rank[%d] sendLength size[%u] is not equal to"
91 : "recvLength size[%u]",
92 : myRank_, localSendRecvInfo_.sendLength.size(), localSendRecvInfo_.recvLength.size()));
93 : }
94 0 : u32 rankSize = localSendRecvInfo_.sendLength.size();
95 0 : if (rankSize == 0 || sliceSize == 0) {
96 0 : THROW<InvalidParamsException>(StringFormat(
97 : "[CcuTempAlltoAllVMesh2D][CalcSendRecvNumSubStep] Invalid rankSize [%u] or invalid slicesize[%u].",
98 : rankSize, sliceSize));
99 : }
100 0 : for (u32 destRank = 0; destRank < rankSize; destRank++) {
101 0 : uint64_t currRankSendSubStep = ((localSendRecvInfo_.sendLength[destRank] + sliceSize - 1) / sliceSize);
102 0 : sendNumSubStep_[destRank] = currRankSendSubStep;
103 :
104 0 : uint64_t currRankRecvSubStep = ((localSendRecvInfo_.recvLength[destRank] + sliceSize - 1) / sliceSize);
105 0 : recvNumSubStep_[destRank] = currRankRecvSubStep;
106 0 : HCCL_INFO(
107 : "[CcuTempAlltoAllVMesh2D][CalcNumSubStep] myRank [%d] currRankSendSubStep[%llu]"
108 : "currRankRecvSubStep[%llu]",
109 : myRank_, currRankSendSubStep, currRankRecvSubStep);
110 0 : numSubStep = std::max(numSubStep, std::max(currRankSendSubStep, currRankRecvSubStep));
111 : }
112 0 : HCCL_INFO("[CcuTempAlltoAllVMesh1D][CalcNumSubStep] myRank [%d] max communication step[%u]", myRank_, numSubStep);
113 0 : return numSubStep;
114 : }
115 :
116 0 : HcclResult CcuTempAlltoAllVMesh2D::FillLinks(const ResLinks& tempLinks)
117 : {
118 0 : for (auto pair : tempLinks) {
119 0 : if (pair.second.size() == 0) { // ESL环境上暂只有直连链路
120 0 : THROW<InvalidParamsException>(
121 0 : StringFormat("[CcuTempAlltoAllVMesh2D] Rank[%d]--Peer[%d].", myRank_, pair.first));
122 : }
123 0 : if (pair.first / dimSize_[0] == myRank_ / dimSize_[0]) {
124 0 : HCCL_INFO("[CcuTempAlltoAllVMesh2D][Run] Rank[%d] insert link to Rank[%d] in linksX", myRank_, pair.first);
125 0 : linksX_.emplace_back(pair.second[0]);
126 0 : } else if (pair.first % dimSize_[0] == myRank_ % dimSize_[0]) {
127 0 : HCCL_INFO("[CcuTempAlltoAllVMesh2D][Run] Rank[%d] insert link to Rank[%d] in linksY", myRank_, pair.first);
128 0 : linksY_.emplace_back(pair.second[0]);
129 : } else {
130 0 : THROW<InvalidParamsException>(StringFormat(
131 0 : "[CcuTempAlltoAllVMesh2D] Rank[%d], Unexpected peerRank[%d] in tempLinks.", myRank_, pair.first));
132 : }
133 0 : }
134 0 : return HcclResult::HCCL_SUCCESS;
135 : }
136 :
137 0 : HcclResult CcuTempAlltoAllVMesh2D::FillRankGroup()
138 : {
139 0 : for (auto& peer : tempVTopo_[0]) {
140 0 : rankGroupX_.AddRank(peer);
141 : }
142 0 : for (auto& peer : tempVTopo_[1]) {
143 0 : rankGroupY_.AddRank(peer);
144 : }
145 0 : return HcclResult::HCCL_SUCCESS;
146 : }
147 :
148 0 : HcclResult CcuTempAlltoAllVMesh2D::CalcSliceSize(uint32_t sendRecvTime, uint64_t maxTransportSize)
149 : {
150 0 : sendSliceSize_.resize(tempRankSize_);
151 0 : recvSliceSize_.resize(tempRankSize_);
152 0 : for (u32 j = 0; j < tempRankSize_; j++) {
153 0 : if ((sendRecvTime + 1) < sendNumSubStep_[j]) {
154 0 : sendSliceSize_[j] = maxTransportSize;
155 0 : } else if ((sendRecvTime + 1) == sendNumSubStep_[j]) {
156 0 : sendSliceSize_[j] = localSendRecvInfo_.sendLength[j] - sliceBias_;
157 : } else {
158 0 : sendSliceSize_[j] = 0;
159 : }
160 : }
161 0 : for (u32 j = 0; j < tempRankSize_; j++) {
162 0 : if ((sendRecvTime + 1) < recvNumSubStep_[j]) {
163 0 : recvSliceSize_[j] = maxTransportSize;
164 0 : } else if ((sendRecvTime + 1) == recvNumSubStep_[j]) {
165 0 : recvSliceSize_[j] = localSendRecvInfo_.recvLength[j] - sliceBias_;
166 : } else {
167 0 : recvSliceSize_[j] = 0;
168 : }
169 : }
170 0 : return HcclResult::HCCL_SUCCESS;
171 : }
172 :
173 0 : HcclResult CcuTempAlltoAllVMesh2D::Run(
174 : const TempFuncs& tempFuncs, const RankSliceInfo& sliceInfoVec, const BuffInfo& buffInfo, const ResLinks& tempLinks,
175 : std::vector<InsQuePtr>& tempInsQues)
176 : {
177 0 : if (tempVTopo_.size() == 0 || tempInsQues.size() == 0) {
178 0 : THROW<NullPtrException>(StringFormat(
179 : "[CcuTempAlltoAllVMesh2D][Run] invalid tempVTopo size is [%u] or invalid tempInsQues size is [%u].",
180 : tempVTopo_.size(), tempInsQues.size()));
181 : }
182 : // 分别记录两个Die上的link，构造rankGroup
183 : (void)tempFuncs;
184 : (void)sliceInfoVec;
185 : (void)buffInfo;
186 0 : CHK_RET(FillLinks(tempLinks));
187 0 : CHK_RET(FillRankGroup());
188 :
189 : // scratch分两组，每组rankSize份，放一个分片，按照传输大小限制与buffer大小限制分多轮执行算子
190 0 : HCCL_INFO("[CcuTempAlltoAllVMesh2D] dataType[%d] sendType[%d]", op_.dataType, op_.all2AllVDataDes.sendType);
191 0 : if (!op_.scratchMem) {
192 0 : HCCL_ERROR("[CcuTempAlltoAllVMesh2D][Run] Rank[%d] inputmem or outputmem or scratchMem is null", myRank_);
193 0 : return HcclResult::HCCL_E_PTR;
194 : }
195 :
196 0 : uint64_t inputAddr = op_.inputMem == nullptr ? 0 : op_.inputMem->GetAddr();
197 0 : uint64_t outputAddr = op_.outputMem == nullptr ? 0 : op_.outputMem->GetAddr();
198 0 : uint64_t scratchAddr = op_.scratchMem->GetAddr();
199 : uint64_t token;
200 0 : CHK_RET(GetToken(op_, token));
201 0 : uint32_t typeSize = DataTypeSizeGet(op_.all2AllVDataDes.sendType);
202 : // scratchmem需要切成blockSize大小的格子,发送的数据块blockBufferSize是scratchmem每一格大小的两倍
203 0 : uint32_t blockSize = (tempVTopo_[0].size() - 1) * (tempVTopo_[1].size() - 1) * 2;
204 0 : uint64_t blockBufferSize = static_cast<uint64_t>((scratchBufferSize_ / blockSize) / typeSize) * typeSize * 2;
205 :
206 0 : HCCL_INFO(
207 : "[CcuTempAlltoAllVMesh2D] Rank[%d], input[%llu], output[%llu], scratch[%llu], blockSize[%llu],"
208 : "blockBufferSize[%llu].",
209 : myRank_, inputAddr, outputAddr, scratchAddr, blockSize, blockBufferSize);
210 :
211 0 : if (tempRankSize_ == 1) {
212 : // alltoallv算子的单P场景单独处理
213 0 : DataSlice usrInSlice = DataSlice(BufferType::INPUT, 0, localSendRecvInfo_.sendLength[0]);
214 0 : DataSlice usrOutSlice = DataSlice(BufferType::OUTPUT, 0, localSendRecvInfo_.sendLength[0]);
215 0 : std::unique_ptr<Instruction> insLocalCopy = std::make_unique<InsLocalCopy>(usrInSlice, usrOutSlice);
216 0 : tempInsQues[0]->Append(std::move(insLocalCopy));
217 0 : HCCL_INFO(
218 : "[CcuTempAlltoAllVMesh2D] rankSize = 1, use InsLocalCopy for sliceSize[%llu].",
219 : localSendRecvInfo_.sendLength[0]);
220 0 : }
221 :
222 0 : uint64_t scratchSliceSize = blockBufferSize / 2;
223 0 : uint64_t scratchSliceBias = scratchSliceSize * (tempVTopo_[0].size() - 1) * (tempVTopo_[1].size() - 1);
224 0 : std::unique_ptr<CcuInsGroup> insGroupPtr = std::make_unique<CcuInsGroup>();
225 0 : for (uint32_t axisId = 0; axisId < 2; axisId++) { // 2D算法，需要执行两次
226 0 : CcuInstructionAllToAllVMesh2D ins = CcuInstructionAllToAllVMesh2D(op_, dimSize_, tempVTopo_);
227 0 : ins.Init(
228 0 : myRank_, axisId, inputAddr, outputAddr, scratchAddr, token, scratchSliceSize, scratchSliceBias,
229 0 : localSendRecvInfo_);
230 0 : ins.SetLinks(axisId == 0 ? linksX_ : linksY_);
231 0 : ins.SetRankGroup(axisId == 0 ? rankGroupX_ : rankGroupY_);
232 0 : u32 ckeNum = 5 + 2 * std::max(dimSize_[0], dimSize_[1]);
233 0 : ins.SetCntCkeNum(ckeNum);
234 0 : insGroupPtr->Append(std::move(std::make_unique<CcuInstructionAllToAllVMesh2D>(ins)));
235 0 : }
236 0 : tempInsQues[0]->Append(std::move(insGroupPtr)); // 只有一条流
237 :
238 0 : return HcclResult::HCCL_SUCCESS;
239 0 : }
240 :
241 0 : HcclResult CcuTempAlltoAllVMesh2D::GetScratchBufferInfo(const uint64_t scratchBufferSize, DataType dataType)
242 : {
243 0 : scratchBufferSize_ = scratchBufferSize;
244 0 : dataType_ = dataType;
245 0 : return HcclResult::HCCL_SUCCESS;
246 : }
247 :
248 : } // namespace Hccl
|
