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.

util.cc 4.1 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145
  1. /**
  2. * Copyright 2020 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/ps/util.h"
  17. #include <unordered_map>
  18. #include "frontend/parallel/ps/common.h"
  19. #include "utils/ms_utils.h"
  20. namespace mindspore {
  21. namespace parallel {
  22. namespace ps {
  23. std::unordered_map<std::string, int> Util::optimizer_to_ids{
  24. {kApplyMomentum, 0},
  25. {kSparseAdam, 1},
  26. {kSparseLazyAdam, 2},
  27. {kSparseFtrl, 3},
  28. };
  29. std::unordered_map<int, std::string> Util::id_to_optimizers{
  30. {0, kApplyMomentum},
  31. {1, kSparseAdam},
  32. {2, kSparseLazyAdam},
  33. {3, kSparseFtrl},
  34. };
  35. std::unordered_map<int, std::string> Util::id_to_optimizer_nodes{
  36. {0, kApplyMomentumOp},
  37. {1, kSparseAdamOp},
  38. {2, kSparseLazyAdamOp},
  39. {3, kSparseFtrlOp},
  40. };
  41. bool Util::IsParamServerMode() { return IsRoleOfWorker() || IsRoleOfPServer() || IsRoleOfScheduler(); }
  42. bool Util::IsRoleOfWorker() {
  43. auto role = common::GetEnv(kEnvRole);
  44. if (strcmp(role.c_str(), kEnvRoleOfWorker) == 0) {
  45. return true;
  46. } else {
  47. return false;
  48. }
  49. }
  50. bool Util::IsRoleOfPServer() {
  51. auto role = common::GetEnv(kEnvRole);
  52. if (strcmp(role.c_str(), kEnvRoleOfPServer) == 0) {
  53. return true;
  54. } else {
  55. return false;
  56. }
  57. }
  58. bool Util::IsRoleOfScheduler() {
  59. auto role = common::GetEnv(kEnvRole);
  60. if (strcmp(role.c_str(), kEnvRoleOfScheduler) == 0) {
  61. return true;
  62. } else {
  63. return false;
  64. }
  65. }
  66. void Util::SetInternalEnvVar() {
  67. if (IsParamServerMode()) {
  68. auto comm_type = common::GetEnv(kEnvCommType);
  69. if (comm_type.size() > 0) {
  70. (void)common::SetEnv(kDmlcCommType, comm_type.c_str());
  71. }
  72. auto interface = common::GetEnv(kEnvInterface);
  73. if (interface.size() > 0) {
  74. (void)common::SetEnv(kDmlcInterface, interface.c_str());
  75. }
  76. auto server_num = common::GetEnv(kEnvPServerNum);
  77. if (server_num.size() > 0) {
  78. (void)common::SetEnv(kDmlcPServerNum, server_num.c_str());
  79. }
  80. auto worker_num = common::GetEnv(kEnvWorkerNum);
  81. if (worker_num.size() > 0) {
  82. (void)common::SetEnv(kDmlcWorkerNum, worker_num.c_str());
  83. }
  84. if (IsRoleOfScheduler()) {
  85. (void)common::SetEnv(kDmlcRole, kRoleOfScheduler);
  86. } else if (IsRoleOfPServer()) {
  87. (void)common::SetEnv(kDmlcRole, kRoleOfPServer);
  88. } else if (IsRoleOfWorker()) {
  89. (void)common::SetEnv(kDmlcRole, kRoleOfWorker);
  90. }
  91. auto scheduler_host = common::GetEnv(kEnvSchedulerHost);
  92. if (scheduler_host.size() > 0) {
  93. (void)common::SetEnv(kDmlcSchedulerHost, scheduler_host.c_str());
  94. }
  95. auto scheduler_port = common::GetEnv(kEnvSchedulerPort);
  96. if (scheduler_port.size() > 0) {
  97. (void)common::SetEnv(kDmlcSchedulerPort, scheduler_port.c_str());
  98. }
  99. }
  100. }
  101. int Util::optimizer_id(std::string name) {
  102. if (optimizer_to_ids.count(name) > 0) {
  103. return optimizer_to_ids[name];
  104. }
  105. return -1;
  106. }
  107. std::string Util::optimizer_name(int id) {
  108. if (id_to_optimizers.count(id) > 0) {
  109. return id_to_optimizers[id];
  110. }
  111. return "";
  112. }
  113. std::string Util::optimizer_node_name(int id) {
  114. if (id_to_optimizer_nodes.count(id) > 0) {
  115. return id_to_optimizer_nodes[id];
  116. }
  117. return "";
  118. }
  119. bool Util::is_optimizer(std::string name) { return optimizer_to_ids.count(name) > 0; }
  120. int Util::LocalShard(int first_dim, int rank_id, int server_num) {
  121. int shard_size = std::round((static_cast<float>(first_dim)) / server_num);
  122. int remain_size = first_dim % server_num;
  123. if (remain_size == 0 || rank_id < server_num - 1) {
  124. return shard_size;
  125. } else {
  126. return first_dim - (shard_size * (server_num - 1));
  127. }
  128. }
  129. } // namespace ps
  130. } // namespace parallel
  131. } // namespace mindspore