Searched refs:cost_list (Results 1 – 13 of 13) sorted by relevance
/third_party/mindspore/tests/ut/cpp/parallel/ops_info/ |
D | activation_test.cc | 79 ASSERT_GT(swc->cost_list.size(), 0); in TEST_F() 82 Cost cost = *(swc->cost_list[0]); in TEST_F() 99 ASSERT_GT(swc->cost_list.size(), 0); in TEST_F() 102 Cost cost = *(swc->cost_list[0]); in TEST_F()
|
D | tensor_add_info_test.cc | 187 Cost cost = *(swc->cost_list[0]); in TEST_F() 209 Cost cost = *(swc->cost_list[0]); in TEST_F()
|
D | tmpidentity_test.cc | 143 Cost cost = *(swc->cost_list[0]); in TEST_F()
|
D | matmul_info_test.cc | 568 Cost cost = *(swc->cost_list[0]); in TEST_F() 584 Cost cost = *(swc->cost_list[0]); in TEST_F()
|
/third_party/mindspore/mindspore/ccsrc/frontend/parallel/auto_parallel/ |
D | costmodel.h | 84 : strategy_ptr(std::move(strategy)), cost_list(std::move(c_list)) {} in StrategyWithCost() 91 cost_list(swc.cost_list) {} in StrategyWithCost() 97 CostPtrList cost_list; variable 144 explicit EdgeEliminationDecision(CostPtrList cost_list) : edges_cost_list_(std::move(cost_list)) { in EdgeEliminationDecision()
|
D | graph_costmodel.cc | 246 CostPtrList clist1 = u_strategy->cost_list; in CreateFinalCostList() 248 CostPtrList clist3 = v_strategy->cost_list; in CreateFinalCostList() 291 CostPtrList clist1 = u_strategy->cost_list; in CreateFinalSingleCostList() 312 CostPtr CostGraph::SelectCostWithMinInferenceTime(const CostPtrList &cost_list, double memory) { in SelectCostWithMinInferenceTime() argument 315 if (cost_list.empty()) { in SelectCostWithMinInferenceTime() 322 for (auto &a_cost : cost_list) { in SelectCostWithMinInferenceTime() 367 CostPtr CostGraph::SelectCostWithMinTrainingTime(const CostPtrList &cost_list, double memory) { in SelectCostWithMinTrainingTime() argument 370 if (cost_list.empty()) { in SelectCostWithMinTrainingTime() 377 for (auto &a_cost : cost_list) { in SelectCostWithMinTrainingTime() 512 auto cost_list = one_component->CreateFinalCostList(u, e, v); in SearchStrategyForMultiNodeFinalGraph() local [all …]
|
D | graph_costmodel.h | 71 CostPtr SelectCostWithMinInferenceTime(const CostPtrList &cost_list, double memory); 72 CostPtr SelectCostWithMinTrainingTime(const CostPtrList &cost_list, double memory);
|
D | edge_costmodel.cc | 273 … op_strategy->cost_list, e2->GetCostList(middle_strategy, input_st_ptr), &result); in CreateOpEliminationCostList()
|
/third_party/mindspore/mindspore/ccsrc/frontend/parallel/ops_info/ |
D | operator_info.cc | 1398 swc->cost_list.push_back(result); in SetCostUnderStrategyBase() 1426 …if (alpha * s1->cost_list[0]->computation_cost_ + beta * s1->cost_list[0]->communication_with_part… in ApproximateStrategies() 1427 …alpha * s2->cost_list[0]->computation_cost_ + beta * s2->cost_list[0]->communication_with_partial_… in ApproximateStrategies() 1530 swc->cost_list[0]->memory_with_reuse_ = mem_cost; in CalculateMemoryCost() 1545 swc->cost_list[0]->memory_with_reuse_ = mem_cost; in CalculateMemoryCostForInference() 1554 swc->cost_list[0]->memory_with_reuse_ -= parameter_mem_cost; in CorrectMemoryCost() 1555 if (swc->cost_list[0]->memory_with_reuse_ < 0) { in CorrectMemoryCost() 1556 … MS_LOG(ERROR) << "The memory cost after correction is: " << swc->cost_list[0]->memory_with_reuse_ in CorrectMemoryCost()
|
D | reshape_info.cc | 413 swc->cost_list.push_back(result); in SetCostForReshape()
|
D | matmul_info.cc | 636 swc->cost_list.push_back(result); in SetCostUnderStrategy()
|
/third_party/mindspore/tests/st/networks/models/bert/bert_performance/ |
D | test_bert_thor.py | 223 cost_list = output['cost'] 225 sum_cost_list = np.sum([cost_list, sum_cost_list], axis=0)
|
/third_party/mindspore/tests/ut/cpp/parallel/auto_parallel/ |
D | graph_costmodel_test.cc | 371 auto cost_list = cost_graph.CreateFinalCostList(matmul1, edge_m1_m2, matmul2); in TEST_F() local 373 cost_graph.SelectCostWithMinInferenceTime(cost_list, device_mem_capacity); in TEST_F()
|