You can not select more than 25 topics Topics must start with a chinese character,a letter or number, can include dashes ('-') and can be up to 35 characters long.

context.cc 11 kB

5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281
  1. /**
  2. * Copyright 2019 Huawei Technologies Co., Ltd
  3. *
  4. * Licensed under the Apache License, Version 2.0 (the "License");
  5. * you may not use this file except in compliance with the License.
  6. * You may obtain a copy of the License at
  7. *
  8. * http://www.apache.org/licenses/LICENSE-2.0
  9. *
  10. * Unless required by applicable law or agreed to in writing, software
  11. * distributed under the License is distributed on an "AS IS" BASIS,
  12. * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  13. * See the License for the specific language governing permissions and
  14. * limitations under the License.
  15. */
  16. #include "frontend/parallel/context.h"
  17. #include <algorithm>
  18. #include <cstdint>
  19. #include <functional>
  20. #include <map>
  21. #include <memory>
  22. #include <utility>
  23. #include "frontend/parallel/device_manager.h"
  24. namespace mindspore {
  25. namespace parallel {
  26. static std::map<std::string, Shape> param_shapes;
  27. std::vector<std::string> PARALLEL_MODE_LIST = {STAND_ALONE, DATA_PARALLEL, HYBRID_PARALLEL, SEMI_AUTO_PARALLEL,
  28. AUTO_PARALLEL};
  29. std::vector<std::string> STRATEGY_SEARCH_MODE_LIST = {DYNAMIC_PROGRAMMING, RECURSIVE_PROGRAMMING};
  30. std::vector<std::string> COMMUNI_PARALLEL_MODE_LIST = {ALL_GROUP_PARALLEL, SAME_SERVER_GROUP_PARALLEL,
  31. NO_GROUP_PARALLEL};
  32. std::shared_ptr<ParallelContext> ParallelContext::inst_context_ = nullptr;
  33. std::shared_ptr<ParallelContext> ParallelContext::GetInstance() {
  34. if (inst_context_ == nullptr) {
  35. inst_context_.reset(new (std::nothrow) ParallelContext());
  36. }
  37. return inst_context_;
  38. }
  39. ParallelContext::ParallelContext() { Reset(); }
  40. void ParallelContext::Reset() {
  41. gradients_mean_ = false;
  42. full_batch_ = false;
  43. gradient_fp32_sync_ = true;
  44. loss_repeated_mean_ = true;
  45. device_num_ = 1;
  46. global_rank_ = 0;
  47. device_num_is_set_ = false;
  48. global_rank_is_set_ = false;
  49. parallel_mode_ = STAND_ALONE;
  50. parameter_broadcast_ = false;
  51. parameter_broadcast_is_set_ = false;
  52. enable_all_reduce_fusion_ = false;
  53. strategy_ckpt_load_file_ = "";
  54. strategy_ckpt_save_file_ = "";
  55. enable_parallel_optimizer_ = false;
  56. all_reduce_fusion_split_indices_.clear();
  57. all_reduce_fusion_split_sizes_.clear();
  58. strategy_search_mode_ = DYNAMIC_PROGRAMMING;
  59. pipeline_stage_split_num_ = 1;
  60. grad_accumulation_step_ = 1;
  61. communi_parallel_mode_ = ALL_GROUP_PARALLEL;
  62. optimizer_weight_shard_size_ = -1;
  63. optimizer_weight_shard_aggregated_save_ = false;
  64. sharding_propagation_ = false;
  65. enable_all2all_ = false;
  66. dataset_strategy_.clear();
  67. }
  68. void ParallelContext::set_device_num(int64_t device_num) {
  69. device_num_ = device_num;
  70. device_num_is_set_ = true;
  71. }
  72. void ParallelContext::set_global_rank(int64_t global_rank) {
  73. global_rank_ = global_rank;
  74. global_rank_is_set_ = true;
  75. }
  76. void ParallelContext::set_gradients_mean(bool gradients_mean) { gradients_mean_ = gradients_mean; }
  77. void ParallelContext::set_full_batch(bool full_batch) { full_batch_ = full_batch; }
  78. void ParallelContext::set_dataset_strategy(const std::vector<std::vector<int64_t>> &dataset_strategy) {
  79. dataset_strategy_ = dataset_strategy;
  80. }
  81. void ParallelContext::set_grad_accumulation_step(int64_t grad_accumulation_step) {
  82. grad_accumulation_step_ = grad_accumulation_step;
  83. }
  84. void ParallelContext::set_gradient_fp32_sync(bool gradient_fp32_sync) { gradient_fp32_sync_ = gradient_fp32_sync; }
  85. void ParallelContext::set_loss_repeated_mean(bool loss_repeated_mean) { loss_repeated_mean_ = loss_repeated_mean; }
  86. void ParallelContext::set_pipeline_stage_split_num(const int64_t stage_num) { pipeline_stage_split_num_ = stage_num; }
  87. bool ParallelContext::set_parallel_mode(const std::string &parallel_mode) {
  88. auto iter = std::find(PARALLEL_MODE_LIST.begin(), PARALLEL_MODE_LIST.end(), parallel_mode);
  89. if (iter == PARALLEL_MODE_LIST.end()) {
  90. MS_LOG(INFO) << "Invalid parallel mode:" << parallel_mode;
  91. return false;
  92. }
  93. parallel_mode_ = parallel_mode;
  94. return true;
  95. }
  96. bool ParallelContext::set_strategy_search_mode(const std::string &strategy_search_mode) {
  97. auto iter = std::find(STRATEGY_SEARCH_MODE_LIST.begin(), STRATEGY_SEARCH_MODE_LIST.end(), strategy_search_mode);
  98. if (iter == STRATEGY_SEARCH_MODE_LIST.end()) {
  99. MS_LOG(INFO) << "Invalid strategy search mode mode: " << strategy_search_mode;
  100. return false;
  101. }
  102. strategy_search_mode_ = strategy_search_mode;
  103. return true;
  104. }
  105. void ParallelContext::set_parameter_broadcast(bool parameter_broadcast) {
  106. parameter_broadcast_ = parameter_broadcast;
  107. parameter_broadcast_is_set_ = true;
  108. }
  109. void ParallelContext::set_strategy_ckpt_load_file(const std::string &strategy_ckpt_load_file) {
  110. strategy_ckpt_load_file_ = strategy_ckpt_load_file;
  111. }
  112. void ParallelContext::set_strategy_ckpt_save_file(const std::string &strategy_ckpt_save_file) {
  113. strategy_ckpt_save_file_ = strategy_ckpt_save_file;
  114. }
  115. void ParallelContext::set_group_ckpt_save_file(const std::string &group_ckpt_save_file) {
  116. group_ckpt_save_file_ = group_ckpt_save_file;
  117. }
  118. void ParallelContext::set_optimizer_weight_shard_size(int64_t optimizer_weight_shard_size) {
  119. optimizer_weight_shard_size_ = optimizer_weight_shard_size;
  120. }
  121. void ParallelContext::set_optimizer_weight_shard_aggregated_save(bool optimizer_weight_shard_aggregated_save) {
  122. optimizer_weight_shard_aggregated_save_ = optimizer_weight_shard_aggregated_save;
  123. }
  124. void ParallelContext::SetAllReduceFusionSplitIndices(const std::vector<uint32_t> &indices, const std::string &group) {
  125. if (!group.empty() && group.find(TypeIdLabel(kNumberTypeFloat)) == std::string::npos &&
  126. group.find(TypeIdLabel(kNumberTypeFloat16)) == std::string::npos &&
  127. group.find(TypeIdLabel(kNumberTypeFloat32)) == std::string::npos) {
  128. all_reduce_fusion_split_indices_[group + TypeIdLabel(kNumberTypeFloat)] = indices;
  129. all_reduce_fusion_split_indices_[group + TypeIdLabel(kNumberTypeFloat16)] = indices;
  130. all_reduce_fusion_split_indices_[group + TypeIdLabel(kNumberTypeFloat32)] = indices;
  131. }
  132. all_reduce_fusion_split_indices_[group] = indices;
  133. }
  134. std::vector<uint32_t> ParallelContext::GetAllReduceFusionSplitIndices(const std::string &group) const {
  135. auto iter = all_reduce_fusion_split_indices_.find(group);
  136. if (iter != all_reduce_fusion_split_indices_.end()) {
  137. return iter->second;
  138. }
  139. return {};
  140. }
  141. void ParallelContext::SetAllReduceFusionSplitSizes(const std::vector<uint32_t> &sizes, const std::string &group) {
  142. if (!group.empty() && group.find(TypeIdLabel(kNumberTypeFloat)) == std::string::npos &&
  143. group.find(TypeIdLabel(kNumberTypeFloat16)) == std::string::npos &&
  144. group.find(TypeIdLabel(kNumberTypeFloat32)) == std::string::npos) {
  145. all_reduce_fusion_split_sizes_[group + TypeIdLabel(kNumberTypeFloat)] = sizes;
  146. all_reduce_fusion_split_sizes_[group + TypeIdLabel(kNumberTypeFloat16)] = sizes;
  147. all_reduce_fusion_split_sizes_[group + TypeIdLabel(kNumberTypeFloat32)] = sizes;
  148. }
  149. all_reduce_fusion_split_sizes_[group] = sizes;
  150. }
  151. std::vector<uint32_t> ParallelContext::GetAllReduceFusionSplitSizes(const std::string &group) const {
  152. auto iter = all_reduce_fusion_split_sizes_.find(group);
  153. if (iter != all_reduce_fusion_split_sizes_.end()) {
  154. return iter->second;
  155. }
  156. return {};
  157. }
  158. bool ParallelContext::set_communi_parallel_mode(const std::string &communi_parallel_mode) {
  159. auto iter = std::find(COMMUNI_PARALLEL_MODE_LIST.begin(), COMMUNI_PARALLEL_MODE_LIST.end(), communi_parallel_mode);
  160. if (iter == COMMUNI_PARALLEL_MODE_LIST.end()) {
  161. MS_LOG(INFO) << "Invalid communication parallel mode:" << communi_parallel_mode;
  162. return false;
  163. }
  164. communi_parallel_mode_ = communi_parallel_mode;
  165. return true;
  166. }
  167. // Clear param_shapes before training in auto-parallel or semi-auto-parallel mode
  168. void ParallelContext::ParallelParameterContextInitShape(const FuncGraphPtr &func_graph) {
  169. MS_EXCEPTION_IF_NULL(func_graph);
  170. if (!func_graph->has_flag(AUTO_PARALLEL)) {
  171. return;
  172. }
  173. if (func_graph->has_flag(IS_FIRST_ITERATION)) {
  174. param_shapes.clear();
  175. init_param_shape_ = true;
  176. MS_LOG(INFO) << "Init the parameter shape dict in increment predict with two graph";
  177. return;
  178. }
  179. if (!func_graph->has_flag(TRAINING)) {
  180. init_param_shape_ = false;
  181. MS_LOG(INFO) << "In parallel evaluation or prediction, may be need to restore the parameter shape";
  182. return;
  183. }
  184. if ((ParallelContext::GetInstance()->grad_accumulation_step() > 1) && !func_graph->has_flag(ACCUMULATION)) {
  185. init_param_shape_ = false;
  186. MS_LOG(INFO) << "In parallel grad accumulation second graph, need to restore the parameter shape";
  187. } else {
  188. param_shapes.clear();
  189. init_param_shape_ = true;
  190. MS_LOG(INFO) << "Init the parameter shape dict";
  191. }
  192. }
  193. // Restore the parameters' shape for evaluation/prediction in auto-parallel or semi-auto-parallel mode
  194. void ParallelContext::ParallelParameterContextRestoreShape(const FuncGraphPtr &func_graph,
  195. const ParameterPtr &param_node, AbstractBasePtr ptr) {
  196. MS_EXCEPTION_IF_NULL(func_graph);
  197. MS_EXCEPTION_IF_NULL(param_node);
  198. MS_EXCEPTION_IF_NULL(ptr);
  199. if (!func_graph->has_flag(AUTO_PARALLEL)) {
  200. return;
  201. }
  202. if (init_param_shape_) {
  203. return;
  204. }
  205. auto iter = param_shapes.find(param_node->name());
  206. if (iter == param_shapes.end()) {
  207. MS_LOG(WARNING) << "Can not found the shape for parameter " << param_node->name();
  208. return;
  209. }
  210. Shape shape = iter->second;
  211. std::shared_ptr<abstract::BaseShape> base_shape = std::make_shared<abstract::Shape>(shape);
  212. ptr->set_shape(base_shape);
  213. MS_LOG(INFO) << "The parameter name is " << param_node->name() << ", the shape is " << shape;
  214. }
  215. // Clear param_shapes before training in auto-parallel or semi-auto-parallel mode
  216. // Checkpoint the parameters' shape for training in auto-parallel or semi-auto-parallel mode
  217. void ParallelContext::ParallelParameterContextCkptShape(const FuncGraphPtr &func_graph, const ParameterPtr &param_node,
  218. const AbstractBasePtr &ptr) {
  219. MS_EXCEPTION_IF_NULL(func_graph);
  220. MS_EXCEPTION_IF_NULL(param_node);
  221. MS_EXCEPTION_IF_NULL(ptr);
  222. if (!func_graph->has_flag(AUTO_PARALLEL)) {
  223. return;
  224. }
  225. if (!init_param_shape_) {
  226. return;
  227. }
  228. std::vector<int64_t> shape = dyn_cast<abstract::Shape>(ptr->GetShapeTrack())->shape();
  229. auto ret = param_shapes.try_emplace(param_node->name(), shape);
  230. if (!ret.second) {
  231. MS_LOG(EXCEPTION) << "The shape for parameter name " << param_node->name() << " is existed";
  232. return;
  233. }
  234. MS_LOG(DEBUG) << "The parameter name is " << param_node->name() << ", the shape is " << shape;
  235. }
  236. void ParallelContext::set_sharding_propagation(const bool stra_pto) { sharding_propagation_ = stra_pto; }
  237. void ParallelContext::set_enable_all2all(const bool enable) { enable_all2all_ = enable; }
  238. } // namespace parallel
  239. } // namespace mindspore