-
Notifications
You must be signed in to change notification settings - Fork 7
Expand file tree
/
Copy pathbench_atomic_shared_ptrs.cpp
More file actions
191 lines (148 loc) · 6.41 KB
/
Copy pathbench_atomic_shared_ptrs.cpp
File metadata and controls
191 lines (148 loc) · 6.41 KB
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
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
#include <cassert>
#include <cstdlib>
#include <atomic>
#include <chrono>
#include <memory>
#include <thread>
#include <utility>
#include <benchmark/benchmark.h>
#include "all_ptrs.hpp"
constexpr auto compute_low = [](std::vector<double>& v) -> double {
std::nth_element(v.begin(), v.begin() + v.size()/100, v.end());
return v[v.size()/100];
};
constexpr auto compute_med = [](std::vector<double>& v) -> double {
std::nth_element(v.begin(), v.begin() + v.size()/2, v.end());
return v[v.size()/100];
};
constexpr auto compute_high = [](std::vector<double>& v) -> double {
std::nth_element(v.begin(), v.begin() + v.size()*99/100, v.end());
return v[v.size()*99/100];
};
constexpr auto compute_tail = [](std::vector<double>& v) -> double {
std::nth_element(v.begin(), v.begin() + v.size()*9995/10000, v.end());
return v[v.size()*9995/10000];
};
template<template<typename> typename AtomicSharedPtr, template<typename> typename SharedPtr>
static void bench_load(benchmark::State& state) {
parlay::enable_deamortized_reclamation();
int n_threads = state.range(0); // Spawn n-1 contending threads
AtomicSharedPtr<int> src;
src.store(SharedPtr<int>(new int(42)));
std::vector<std::jthread> enemies;
enemies.reserve(n_threads-1);
for (int i = 0; i < n_threads - 1; i++) {
enemies.emplace_back([mine = SharedPtr<int>(new int(i+1)), &src](std::stop_token stoken) {
while (!stoken.stop_requested()) {
src.store(mine); // Stores a copy so we're not spamming retires
}
});
}
std::vector<double> all_times;
for (auto _ : state) {
auto start = std::chrono::high_resolution_clock::now();
auto result = src.load();
auto finish = std::chrono::high_resolution_clock::now();
auto elapsed_time = std::chrono::duration_cast<std::chrono::duration<double>>(finish - start);
state.SetIterationTime(elapsed_time.count());
all_times.push_back(elapsed_time.count());
}
for (auto& t : enemies) {
t.request_stop();
t.join();
}
state.counters["1%"] = compute_low(all_times);
state.counters["50%"] = compute_med(all_times);
state.counters["99%"] = compute_high(all_times);
state.counters["99.95%"] = compute_tail(all_times);
}
template<template<typename> typename AtomicSharedPtr, template<typename> typename SharedPtr>
static void bench_store_delete(benchmark::State& state) {
int n_threads = state.range(0); // Spawn n-1 contending threads
AtomicSharedPtr<int> src;
src.store(SharedPtr<int>(new int(42)));
std::vector<std::jthread> enemies;
enemies.reserve(n_threads-1);
for (int i = 0; i < n_threads - 1; i++) {
enemies.emplace_back([mine = SharedPtr<int>(new int(i+1)), &src](std::stop_token stoken) {
while (!stoken.stop_requested()) {
src.store(mine); // Stores a copy so we're not spamming retires
}
});
}
std::vector<double> all_times;
// These stores all overwrite the only copy of the pointer, so it will trigger destruction
// of the managed object. This benchmark therefore also measures the cost of destruction.
for (auto _ : state) {
auto new_sp = SharedPtr<int>(new int(rand()));
auto start = std::chrono::high_resolution_clock::now();
src.store(std::move(new_sp));
auto finish = std::chrono::high_resolution_clock::now();
auto elapsed_time = std::chrono::duration_cast<std::chrono::duration<double>>(finish - start);
state.SetIterationTime(elapsed_time.count());
all_times.push_back(elapsed_time.count());
}
for (auto& t : enemies) {
t.request_stop();
t.join();
}
state.counters["1%"] = compute_low(all_times);
state.counters["50%"] = compute_med(all_times);
state.counters["99%"] = compute_high(all_times);
state.counters["99.95%"] = compute_tail(all_times);
}
template<template<typename> typename AtomicSharedPtr, template<typename> typename SharedPtr>
static void bench_store_copy(benchmark::State& state) {
int n_threads = state.range(0); // Spawn n-1 contending threads
AtomicSharedPtr<int> src;
src.store(SharedPtr<int>(new int(42)));
auto my_sp = SharedPtr<int>(new int(42));
std::vector<std::jthread> enemies;
enemies.reserve(n_threads-1);
for (int i = 0; i < n_threads - 1; i++) {
enemies.emplace_back([mine = SharedPtr<int>(new int(i+1)), &src](std::stop_token stoken) {
while (!stoken.stop_requested()) {
src.store(mine); // Stores a copy so we're not spamming retires
}
});
}
std::vector<double> all_times;
// In this version, we keep a copy of our own pointer and store a copy of it, so it will
// never be destroyed. This version is therefore only testing the efficiency of store
// without also testing the efficiency destruction.
for (auto _ : state) {
auto new_sp = my_sp;
auto start = std::chrono::high_resolution_clock::now();
src.store(std::move(new_sp));
auto finish = std::chrono::high_resolution_clock::now();
auto elapsed_time = std::chrono::duration_cast<std::chrono::duration<double>>(finish - start);
state.SetIterationTime(elapsed_time.count());
all_times.push_back(elapsed_time.count());
}
for (auto& t : enemies) {
t.request_stop();
t.join();
}
state.counters["1%"] = compute_low(all_times);
state.counters["50%"] = compute_med(all_times);
state.counters["99%"] = compute_high(all_times);
state.counters["99.95%"] = compute_tail(all_times);
}
#define SETUP_BENCHMARK(ptr_name, bench_name, bench) \
BENCHMARK(bench) \
->Name(ptr_name "::" bench_name) \
->UseManualTime() \
->RangeMultiplier(2)->Range(1, 64);
#define BENCH_PTR(name, atomic_sp, sp) \
SETUP_BENCHMARK(name, "load", (bench_load<atomic_sp, sp>)); \
SETUP_BENCHMARK(name, "store", (bench_store_copy<atomic_sp, sp>)); \
SETUP_BENCHMARK(name, "store-del", (bench_store_delete<atomic_sp, sp>));
BENCH_PTR("STL", StlAtomicSharedPtr, std::shared_ptr);
BENCH_PTR("Folly", folly::atomic_shared_ptr, std::shared_ptr);
BENCH_PTR("Mine", parlay::atomic_shared_ptr, parlay::shared_ptr);
BENCH_PTR("JSS-Free", jss::atomic_shared_ptr, jss::shared_ptr);
BENCH_PTR("Vtyulb", LFStructs::AtomicSharedPtr, LFStructs::SharedPtr);
BENCH_PTR("Mine-basic", parlay::basic::atomic_shared_ptr, parlay::basic::shared_ptr);
#ifdef JUST_THREADS_AVAILABLE
BENCH_PTR("JSS", std::experimental::atomic_shared_ptr, std::experimental::shared_ptr);
#endif