tdlight-team/tdlight
tdlight-team/tdlight
1
1
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Avoid big memory consumption in ConcurrentHashMap benchmark with n = 1 << 27 when the benchmark ends very fast.

Browse Source
This commit is contained in:
levlam 2023-07-26 20:45:52 +03:00
parent cfe47b6cc2
commit aa59e4cbd7
1 changed files with 16 additions and 18 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

34
tdutils/test/ConcurrentHashMap.cpp
View File

@ -40,10 +40,6 @@ class ArrayHashMap {
public:
explicit ArrayHashMap(std::size_t n) : array_(n) {
}
struct Node {
std::atomic<KeyT> key{KeyT{}};
std::atomic<ValueT> value{ValueT{}};
};
static td::string get_name() {
return "ArrayHashMap";
}
@ -201,21 +197,23 @@ class HashMapBenchmark final : public td::Benchmark {
void run(int n) final {
n = n_;
td::vector<td::thread> threads;
for (int count = 0; count < 1000; count++) {
td::vector<td::thread> threads;
for (std::size_t i = 0; i < threads_n; i++) {
std::size_t l = n * i / threads_n;
std::size_t r = n * (i + 1) / threads_n;
threads.emplace_back([l, r, this] {
for (size_t i = l; i < r; i++) {
auto x = td::narrow_cast<int>((i + 1) * MUL % n_) + 3;
auto y = td::narrow_cast<int>(i + 2);
hash_map->insert(x, y);
}
});
}
for (auto &thread : threads) {
thread.join();
for (std::size_t i = 0; i < threads_n; i++) {
std::size_t l = n * i / threads_n;
std::size_t r = n * (i + 1) / threads_n;
threads.emplace_back([l, r, this] {
for (size_t i = l; i < r; i++) {
auto x = td::narrow_cast<int>((i + 1) * MUL % n_) + 3;
auto y = td::narrow_cast<int>(i + 2);
hash_map->insert(x, y);
}
});
}
for (auto &thread : threads) {
thread.join();
}
}
}