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