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_nhr.h"
      12              : 
      13              : namespace Hccl {
      14            0 : TopoMatchNHR::TopoMatchNHR(const RankId vRank, const u32 rankSize, const RankGraph *rankGraph,
      15            0 :                              const DevType devType)
      16            0 :     : TopoMatchBase(vRank, rankSize, rankGraph, devType)
      17              : {
      18            0 : }
      19              : 
      20            0 : TopoMatchNHR::~TopoMatchNHR()
      21              : {
      22            0 : }
      23              : 
      24            0 : HcclResult TopoMatchNHR::MatchTopo(std::vector<std::vector<RankId>> &vTopo, std::vector<RankId> &virtRanks,
      25              :                                     std::map<RankId, u32> &virtRankMap)
      26              : {
      27              :     // 获取并校验通信层数
      28            0 :     std::set<u32> levelSet = rankGraph_->GetLevels(myRank_);
      29            0 :     CHK_PRT_RET((levelSet.size() == COMM_LEVEL_SIZE_0),
      30              :                 HCCL_ERROR("[CollAlgFactory] [TopoMatchNHR] Rank [%d], Invalid virtual topo.", myRank_),
      31              :                 HcclResult::HCCL_E_PARA);
      32            0 :     CHK_RET(NHRTopoForAllRanks());
      33            0 :     virtRanks = rankIds_;
      34            0 :     vTopo.push_back(rankIds_);
      35              : 
      36            0 :     CHK_PRT_RET(GenVirtRankMapping(virtRanks, virtRankMap) != HcclResult::HCCL_SUCCESS,
      37              :                 HCCL_ERROR("[CollAlgFactory] [TopoMatchNHR] Rank [%d], Fail to generate virtRankMapping.", myRank_),
      38              :                 HcclResult::HCCL_E_INTERNAL);
      39              : 
      40            0 :     return HcclResult::HCCL_SUCCESS;
      41            0 : }
      42              : 
      43            0 : HcclResult TopoMatchNHR::NHRTopoForAllRanks()
      44              : {
      45              :     RankId sendToRank;
      46              :     RankId recvFromRank;
      47            0 :     u32 nSteps = GetNHRStepNum(rankSize_);
      48            0 :     std::set<RankId> rankSet;
      49            0 :     for (u32 currentStep = 0; currentStep < nSteps; currentStep++) {
      50            0 :         u32 deltaRank = nSteps - 1 - currentStep;
      51            0 :         sendToRank = (myRank_ + (1 << deltaRank)) % rankSize_;
      52            0 :         recvFromRank = (myRank_ + rankSize_ - (1 << deltaRank)) % rankSize_;
      53            0 :         rankSet.insert(sendToRank);
      54            0 :         rankSet.insert(recvFromRank);
      55              :     }
      56            0 :     for (RankId rankId : rankSet) {
      57            0 :         if (GetPathNum(myRank_, rankId) == 0) {
      58            0 :             HCCL_ERROR("[CollAlgFactory] [TopoMatchNHR] Rank [%d], Invalid virtual topo for NHR.", myRank_);
      59            0 :             return HcclResult::HCCL_E_PARA;
      60              :         }
      61              :     }
      62            0 :     for (u32 rankIdx = 0; rankIdx < rankSize_; rankIdx++) {
      63            0 :         rankIds_.push_back(RankId(rankIdx));
      64              :     }
      65            0 :     return HcclResult::HCCL_SUCCESS;
      66            0 : }
      67              : 
      68              : // NHR的算法步数 = Ceil(log2(N))
      69            0 : u32 TopoMatchNHR::GetNHRStepNum(u32 rankSize) const
      70              : {
      71            0 :     u32 nSteps = 0;
      72            0 :     for (u32 tmp = rankSize - 1; tmp != 0; tmp >>= 1, nSteps++) {
      73              :     }
      74            0 :     HCCL_DEBUG("[NHRBase][GetStepNumInterServer] rankSize[%u] nSteps[%u]", rankSize, nSteps);
      75              : 
      76            0 :     return nSteps;
      77              : }
      78              : } // namespace Hccl