forked from TatianaJin/csci5570
-
Notifications
You must be signed in to change notification settings - Fork 5
/
simple_id_mapper.cpp
96 lines (75 loc) · 3.27 KB
/
simple_id_mapper.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
#include "driver/simple_id_mapper.hpp"
#include <cinttypes>
#include <vector>
#include <base/context.hpp>
#include "base/node.hpp"
#include "glog/logging.h"
#include "gtest/gtest.h"
namespace minips {
uint32_t SimpleIdMapper::GetNodeIdForThread(uint32_t tid) {
return tid / kMaxThreadsPerNode;
}
void SimpleIdMapper::Init(int num_server_threads_per_node) {
CHECK_GT(num_server_threads_per_node, 0);
CHECK_LE(num_server_threads_per_node, kWorkerHelperThreadId);
// Suppose there are 1 server and 1 worker_thread for each node
for (const auto &node : nodes_) {
CHECK_LT(node.id, kMaxNodeId);
if (Context::get_instance().get_bool("scale")
&& Context::get_instance().get_int32("scale_node_id") == node.id) {
LOG(INFO) << "Skipping create data for scale node=" << node.id;
continue;
}
for (int i = 0; i < num_server_threads_per_node; i++) {
node2server_[node.id].push_back(node.id * kMaxThreadsPerNode + i);
}
node2worker_helper_[node.id].push_back(node.id * kMaxThreadsPerNode + kWorkerHelperThreadId);
}
}
void SimpleIdMapper::Update(std::vector<Node> &nodes, int num_server_threads_per_node) {
LOG(INFO) << "SimpleIdMapper Update start";
nodes_ = nodes;
node2server_.clear();
node2worker_helper_.clear();
node2worker_.clear();
Init(num_server_threads_per_node);
}
uint32_t SimpleIdMapper::AllocateWorkerThread(uint32_t node_id) {
CHECK(node2worker_helper_.find(node_id) != node2worker_helper_.end());
CHECK_LE(node2worker_[node_id].size(), kMaxThreadsPerNode - kMaxBgThreadsPerNode);
for (int i = kMaxBgThreadsPerNode; i < kMaxThreadsPerNode; i++) {
int tid = i + node_id * kMaxThreadsPerNode;
if (node2worker_[node_id].find(tid) == node2worker_[node_id].end()) {
node2worker_[node_id].insert(tid);
return tid;
}
}
CHECK(false);
return -1;
}
void SimpleIdMapper::DeallocateWorkerThread(uint32_t node_id, uint32_t tid) {
CHECK(node2worker_helper_.find(node_id) != node2worker_helper_.end());
CHECK(node2worker_[node_id].find(tid) != node2worker_[node_id].end());
node2worker_[node_id].erase(tid);
}
std::vector<uint32_t> SimpleIdMapper::GetServerThreadsForId(uint32_t node_id) {
return node2server_[node_id];
}
std::vector<uint32_t> SimpleIdMapper::GetWorkerHelperThreadsForId(uint32_t node_id) {
return node2worker_helper_[node_id];
}
std::vector<uint32_t> SimpleIdMapper::GetWorkerThreadsForId(uint32_t node_id) {
return {node2worker_[node_id].begin(), node2worker_[node_id].end()};
}
std::vector<uint32_t> SimpleIdMapper::GetAllServerThreads() {
std::vector<uint32_t> ret;
for (auto& kv : node2server_) {
ret.insert(ret.end(), kv.second.begin(), kv.second.end());
}
return ret;
}
const uint32_t SimpleIdMapper::kMaxNodeId;
const uint32_t SimpleIdMapper::kMaxThreadsPerNode;
const uint32_t SimpleIdMapper::kMaxBgThreadsPerNode;
const uint32_t SimpleIdMapper::kWorkerHelperThreadId;
} // namespace minips