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 "topo_match_mesh_nhr.h"
12 :
13 : namespace Hccl {
14 0 : TopoMatchMeshNHR::TopoMatchMeshNHR(
15 0 : const RankId vRank, const u32 rankSize, const RankGraph* rankGraph, const DevType devType)
16 0 : : TopoMatchBase(vRank, rankSize, rankGraph, devType)
17 0 : {}
18 :
19 0 : TopoMatchMeshNHR::~TopoMatchMeshNHR() {}
20 :
21 : // 在 ranksOnDim[0] 或 ranksOnDim[1] 中找到 myRank 所属的 level 0 子通信域
22 0 : HcclResult TopoMatchMeshNHR::GenerateLevel0(
23 : const std::set<RankId>& rankSet, u32 levelSize, RankId rankId, std::vector<std::vector<std::vector<RankId>>>& vTopo,
24 : std::vector<std::vector<RankId>>& virtRanks)
25 : {
26 : // 计算pod size (m x n)以及level0形状
27 0 : u32 dim0Size = numRanksPerBoard_.at(0);
28 0 : u32 level0Dim0 = GcdTwo(levelSize, dim0Size);
29 0 : u32 level0Dim1 = levelSize / level0Dim0;
30 0 : CHK_PRT_RET(
31 : (level0Dim0 != 1 && level0Dim1 != 1), // 非1d level0
32 : HCCL_ERROR("[CollAlgFactory] [TopoMatchMeshNHR] Rank [%d],Not 1D topo. Invalid level0 virtual topo.", myRank_),
33 : HcclResult::HCCL_E_PARA);
34 : // 查找 rankId 在原始向量中的索引
35 0 : auto it = rankSet.find(rankId);
36 0 : CHK_PRT_RET(
37 : (it == rankSet.end()),
38 : HCCL_ERROR("[CollAlgFactory] [TopoMatchMeshNHR] Rank [%d], Invalid virtual topo.", myRank_),
39 : HcclResult::HCCL_E_PARA);
40 0 : u32 rankIndex = std::distance(rankSet.begin(), it);
41 :
42 : // 计算 rankId 所在的段编号
43 : // 因为每段长度为 levelSize,所以 (目标索引) / (段长) 就是段编号
44 0 : u32 segmentIndex = rankIndex / levelSize;
45 : // 计算该段的起始索引 (start_index)
46 0 : u32 startIndex = segmentIndex * levelSize;
47 :
48 : // 提取子段数据
49 : // 提取范围是 [start_index, start_index + levelSize)
50 0 : std::vector<RankId> level0Vec = {};
51 0 : auto startIter = rankSet.begin();
52 : std::advance(startIter, startIndex);
53 :
54 0 : u32 endIndex = startIndex + levelSize;
55 0 : auto endIter = rankSet.begin();
56 0 : std::advance(endIter, std::min(endIndex, static_cast<u32>(rankSet.size())));
57 :
58 0 : level0Vec.assign(startIter, endIter);
59 0 : HCCL_DEBUG(
60 : "[CollAlgFactory] [TopoMatchMeshNHR] Rank [%d], virtual topo level0 rankSetLevel0[%s]", myRank_,
61 : PrintVector<RankId>(level0Vec).c_str());
62 0 : virtRanks.push_back(level0Vec); // 所有level0子通信域的集合
63 0 : vTopo.push_back({level0Vec});
64 0 : return HcclResult::HCCL_SUCCESS;
65 0 : }
66 :
67 0 : HcclResult TopoMatchMeshNHR::MatchTopo(
68 : std::vector<std::vector<std::vector<RankId>>>& vTopo, std::vector<std::vector<RankId>>& virtRanks,
69 : std::vector<std::map<RankId, u32>>& virtRankMap)
70 : {
71 : // 获取并校验当前通信层数
72 0 : std::set<u32> levelSet = rankGraph_->GetLevels(myRank_);
73 0 : HCCL_DEBUG(
74 : "[CollAlgFactory] [TopoMatchMeshNHR] Rank [%d], virtual topo levelSet[%u][%s]", myRank_, levelSet.size(),
75 : PrintSet<u32>(levelSet).c_str());
76 : // 获取每个pod上rank数量以及pod数量
77 0 : u32 podNum = 0;
78 0 : vector<u32> instanceSizeVec = {};
79 0 : rankGraph_->GetNetInstanceList(0, instanceSizeVec, podNum);
80 0 : u32 rankSizeLevel0 = GcdMultiple(instanceSizeVec); // 作为不规则topo level0的大小
81 0 : HCCL_INFO(
82 : "[CollAlgFactory] [TopoMatchMeshNHR] Rank [%d], [%u] pods ,ranksize on each pod :[%s]", myRank_,
83 : instanceSizeVec.size(), PrintVector<u32>(instanceSizeVec).c_str());
84 : // 得到myrank所在pod的信息
85 0 : const NetInstance* netInstance = rankGraph_->GetNetInstanceByRankId(0, myRank_);
86 0 : if (netInstance == nullptr) {
87 0 : HCCL_ERROR("TopoMatchMeshNHR::MatchTopo netInstance is nullptr");
88 0 : return HcclResult::HCCL_E_PTR;
89 : }
90 0 : std::set<RankId> rankSetR0 = netInstance->GetRankIds(); // 得到此pod上所有rank
91 0 : rankOnSameBoardVector_.resize(RANK_SIZE_EIGHT, {});
92 0 : rankOnSameSlotVector_.resize(RANK_SIZE_EIGHT, {});
93 0 : CHK_RET(CalcRankOnSamePlaneOfR0(rankOnSameBoardVector_, rankOnSameSlotVector_, numRanksPerBoard_));
94 :
95 : // 计算R0的virtRanks 检查level0 mesh连通性 只有board + 每板board多个 rank的情况才需要检查
96 0 : if (numRanksPerBoard_.size() != 1 && numRanksPerBoard_[0] != 1) {
97 0 : if (!IsAllRanksFullMeshConnected(rankSetR0)) {
98 0 : HCCL_ERROR(
99 : "[CollAlgFactory] [TopoMatchMeshNHR] Rank [%d], Invalid virtual topo for "
100 : "mesh_ring in level0.",
101 : myRank_);
102 0 : return HcclResult::HCCL_E_PARA;
103 : }
104 : }
105 : // 计算level0 所有rank
106 0 : CHK_RET(GenerateLevel0(rankSetR0, rankSizeLevel0, myRank_, vTopo, virtRanks));
107 :
108 : // 计算R1的virtRanks
109 0 : const NetInstance* fabGroupLevel1 = rankGraph_->GetNetInstanceByRankId(1, myRank_);
110 0 : if (fabGroupLevel1 == nullptr) {
111 0 : HCCL_ERROR("[CollAlgFactory] [TopoMatchMeshNHR] Rank [%d],fabGroupLevel1 is nullptr", myRank_);
112 0 : return HcclResult::HCCL_E_PTR;
113 : }
114 0 : std::set<RankId> rankSetLevel1 = fabGroupLevel1->GetRankIds(); // 所有pod的所有rank 顺序
115 0 : HCCL_DEBUG(
116 : "[CollAlgFactory] [TopoMatchMeshNHR] Rank [%d], all ranks [%s]", myRank_,
117 : PrintSet<RankId>(rankSetLevel1).c_str());
118 0 : std::vector<RankId> rankOnSamePlaneVector;
119 0 : CHK_RET(GenerateLevel1(rankSetLevel1, rankSizeLevel0, myRank_, vTopo, virtRanks));
120 0 : CHK_PRT_RET(
121 : GenVirtRankMappingMultiLevel(virtRanks, virtRankMap) != HcclResult::HCCL_SUCCESS,
122 : HCCL_ERROR("[CollAlgFactory] [TopoMatchMeshNHR] Rank [%d], Fail to generate virtRankMapping.", myRank_),
123 : HcclResult::HCCL_E_INTERNAL);
124 0 : return HcclResult::HCCL_SUCCESS;
125 0 : }
126 :
127 : } // namespace Hccl
|