-
Notifications
You must be signed in to change notification settings - Fork 4.8k
/
load_balancer_benchmark.cc
454 lines (400 loc) · 16.5 KB
/
load_balancer_benchmark.cc
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
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
// Usage: bazel run //test/common/upstream:load_balancer_benchmark
#include <memory>
#include "common/memory/stats.h"
#include "common/runtime/runtime_impl.h"
#include "common/upstream/maglev_lb.h"
#include "common/upstream/ring_hash_lb.h"
#include "common/upstream/upstream_impl.h"
#include "test/common/upstream/utility.h"
#include "test/mocks/upstream/mocks.h"
#include "benchmark/benchmark.h"
namespace Envoy {
namespace Upstream {
namespace {
class BaseTester {
public:
// We weight the first weighted_subset_percent of hosts with weight.
BaseTester(uint64_t num_hosts, uint32_t weighted_subset_percent = 0, uint32_t weight = 0) {
HostVector hosts;
ASSERT(num_hosts < 65536);
for (uint64_t i = 0; i < num_hosts; i++) {
const bool should_weight = i < num_hosts * (weighted_subset_percent / 100.0);
hosts.push_back(makeTestHost(info_, fmt::format("tcp://10.0.{}.{}:6379", i / 256, i % 256),
should_weight ? weight : 1));
}
HostVectorConstSharedPtr updated_hosts = std::make_shared<HostVector>(hosts);
HostsPerLocalityConstSharedPtr hosts_per_locality = makeHostsPerLocality({hosts});
priority_set_.updateHosts(0, HostSetImpl::partitionHosts(updated_hosts, hosts_per_locality), {},
hosts, {}, absl::nullopt);
local_priority_set_.updateHosts(0,
HostSetImpl::partitionHosts(updated_hosts, hosts_per_locality),
{}, hosts, {}, absl::nullopt);
}
PrioritySetImpl priority_set_;
PrioritySetImpl local_priority_set_;
Stats::IsolatedStoreImpl stats_store_;
ClusterStats stats_{ClusterInfoImpl::generateStats(stats_store_)};
NiceMock<Runtime::MockLoader> runtime_;
Runtime::RandomGeneratorImpl random_;
envoy::api::v2::Cluster::CommonLbConfig common_config_;
std::shared_ptr<MockClusterInfo> info_{new NiceMock<MockClusterInfo>()};
};
class RoundRobinTester : public BaseTester {
public:
RoundRobinTester(uint64_t num_hosts, uint32_t weighted_subset_percent = 0, uint32_t weight = 0)
: BaseTester(num_hosts, weighted_subset_percent, weight) {}
void initialize() {
lb_ = std::make_unique<RoundRobinLoadBalancer>(priority_set_, &local_priority_set_, stats_,
runtime_, random_, common_config_);
}
std::unique_ptr<RoundRobinLoadBalancer> lb_;
};
void BM_RoundRobinLoadBalancerBuild(benchmark::State& state) {
for (auto _ : state) {
state.PauseTiming();
const uint64_t num_hosts = state.range(0);
const uint64_t weighted_subset_percent = state.range(1);
const uint64_t weight = state.range(2);
const size_t start_tester_mem = Memory::Stats::totalCurrentlyAllocated();
RoundRobinTester tester(num_hosts, weighted_subset_percent, weight);
const size_t end_tester_mem = Memory::Stats::totalCurrentlyAllocated();
const size_t start_mem = Memory::Stats::totalCurrentlyAllocated();
// We are only interested in timing the initial build.
state.ResumeTiming();
tester.initialize();
state.PauseTiming();
const size_t end_mem = Memory::Stats::totalCurrentlyAllocated();
state.counters["tester_memory"] = end_tester_mem - start_tester_mem;
state.counters["memory"] = end_mem - start_mem;
state.counters["memory_per_host"] = (end_mem - start_mem) / num_hosts;
state.ResumeTiming();
}
}
BENCHMARK(BM_RoundRobinLoadBalancerBuild)
->Args({1, 0, 1})
->Args({500, 0, 1})
->Args({500, 50, 50})
->Args({500, 100, 50})
->Args({2500, 0, 1})
->Args({2500, 50, 50})
->Args({2500, 100, 50})
->Args({10000, 0, 1})
->Args({10000, 50, 50})
->Args({10000, 100, 50})
->Args({25000, 0, 1})
->Args({25000, 50, 50})
->Args({25000, 100, 50})
->Args({50000, 0, 1})
->Args({50000, 50, 50})
->Args({50000, 100, 50})
->Unit(benchmark::kMillisecond);
class RingHashTester : public BaseTester {
public:
RingHashTester(uint64_t num_hosts, uint64_t min_ring_size) : BaseTester(num_hosts) {
config_ = envoy::api::v2::Cluster::RingHashLbConfig();
config_.value().mutable_minimum_ring_size()->set_value(min_ring_size);
ring_hash_lb_ = std::make_unique<RingHashLoadBalancer>(
priority_set_, stats_, stats_store_, runtime_, random_, config_, common_config_);
}
absl::optional<envoy::api::v2::Cluster::RingHashLbConfig> config_;
std::unique_ptr<RingHashLoadBalancer> ring_hash_lb_;
};
class MaglevTester : public BaseTester {
public:
MaglevTester(uint64_t num_hosts, uint32_t weighted_subset_percent = 0, uint32_t weight = 0)
: BaseTester(num_hosts, weighted_subset_percent, weight) {
maglev_lb_ = std::make_unique<MaglevLoadBalancer>(priority_set_, stats_, stats_store_, runtime_,
random_, common_config_);
}
std::unique_ptr<MaglevLoadBalancer> maglev_lb_;
};
uint64_t hashInt(uint64_t i) {
// Hack to hash an integer.
return HashUtil::xxHash64(absl::string_view(reinterpret_cast<const char*>(&i), sizeof(i)));
}
void BM_RingHashLoadBalancerBuildRing(benchmark::State& state) {
for (auto _ : state) {
state.PauseTiming();
const uint64_t num_hosts = state.range(0);
const uint64_t min_ring_size = state.range(1);
RingHashTester tester(num_hosts, min_ring_size);
const size_t start_mem = Memory::Stats::totalCurrentlyAllocated();
// We are only interested in timing the initial ring build.
state.ResumeTiming();
tester.ring_hash_lb_->initialize();
state.PauseTiming();
const size_t end_mem = Memory::Stats::totalCurrentlyAllocated();
state.counters["memory"] = end_mem - start_mem;
state.counters["memory_per_host"] = (end_mem - start_mem) / num_hosts;
state.ResumeTiming();
}
}
BENCHMARK(BM_RingHashLoadBalancerBuildRing)
->Args({100, 65536})
->Args({200, 65536})
->Args({500, 65536})
->Args({100, 256000})
->Args({200, 256000})
->Args({500, 256000})
->Unit(benchmark::kMillisecond);
void BM_MaglevLoadBalancerBuildTable(benchmark::State& state) {
for (auto _ : state) {
state.PauseTiming();
const uint64_t num_hosts = state.range(0);
MaglevTester tester(num_hosts);
const size_t start_mem = Memory::Stats::totalCurrentlyAllocated();
// We are only interested in timing the initial table build.
state.ResumeTiming();
tester.maglev_lb_->initialize();
state.PauseTiming();
const size_t end_mem = Memory::Stats::totalCurrentlyAllocated();
state.counters["memory"] = end_mem - start_mem;
state.counters["memory_per_host"] = (end_mem - start_mem) / num_hosts;
state.ResumeTiming();
}
}
BENCHMARK(BM_MaglevLoadBalancerBuildTable)
->Arg(100)
->Arg(200)
->Arg(500)
->Unit(benchmark::kMillisecond);
class TestLoadBalancerContext : public LoadBalancerContextBase {
public:
// Upstream::LoadBalancerContext
absl::optional<uint64_t> computeHashKey() override { return hash_key_; }
absl::optional<uint64_t> hash_key_;
};
void computeHitStats(benchmark::State& state,
const std::unordered_map<std::string, uint64_t>& hit_counter) {
double mean = 0;
for (const auto& pair : hit_counter) {
mean += pair.second;
}
mean /= hit_counter.size();
double variance = 0;
for (const auto& pair : hit_counter) {
variance += std::pow(pair.second - mean, 2);
}
variance /= hit_counter.size();
const double stddev = std::sqrt(variance);
state.counters["mean_hits"] = mean;
state.counters["stddev_hits"] = stddev;
state.counters["relative_stddev_hits"] = (stddev / mean);
}
void BM_RingHashLoadBalancerChooseHost(benchmark::State& state) {
for (auto _ : state) {
// Do not time the creation of the ring.
state.PauseTiming();
const uint64_t num_hosts = state.range(0);
const uint64_t min_ring_size = state.range(1);
const uint64_t keys_to_simulate = state.range(2);
RingHashTester tester(num_hosts, min_ring_size);
tester.ring_hash_lb_->initialize();
LoadBalancerPtr lb = tester.ring_hash_lb_->factory()->create();
std::unordered_map<std::string, uint64_t> hit_counter;
TestLoadBalancerContext context;
state.ResumeTiming();
// Note: To a certain extent this is benchmarking the performance of xxhash as well as
// std::unordered_map. However, it should be roughly equivalent to the work done when
// comparing different hashing algorithms.
// TODO(mattklein123): When Maglev is a real load balancer, further share code with the
// other test.
for (uint64_t i = 0; i < keys_to_simulate; i++) {
context.hash_key_ = hashInt(i);
hit_counter[lb->chooseHost(&context)->address()->asString()] += 1;
}
// Do not time computation of mean, standard deviation, and relative standard deviation.
state.PauseTiming();
computeHitStats(state, hit_counter);
state.ResumeTiming();
}
}
BENCHMARK(BM_RingHashLoadBalancerChooseHost)
->Args({100, 65536, 100000})
->Args({200, 65536, 100000})
->Args({500, 65536, 100000})
->Args({100, 256000, 100000})
->Args({200, 256000, 100000})
->Args({500, 256000, 100000})
->Unit(benchmark::kMillisecond);
void BM_MaglevLoadBalancerChooseHost(benchmark::State& state) {
for (auto _ : state) {
// Do not time the creation of the table.
state.PauseTiming();
const uint64_t num_hosts = state.range(0);
const uint64_t keys_to_simulate = state.range(1);
MaglevTester tester(num_hosts);
tester.maglev_lb_->initialize();
LoadBalancerPtr lb = tester.maglev_lb_->factory()->create();
std::unordered_map<std::string, uint64_t> hit_counter;
TestLoadBalancerContext context;
state.ResumeTiming();
// Note: To a certain extent this is benchmarking the performance of xxhash as well as
// std::unordered_map. However, it should be roughly equivalent to the work done when
// comparing different hashing algorithms.
for (uint64_t i = 0; i < keys_to_simulate; i++) {
context.hash_key_ = hashInt(i);
hit_counter[lb->chooseHost(&context)->address()->asString()] += 1;
}
// Do not time computation of mean, standard deviation, and relative standard deviation.
state.PauseTiming();
computeHitStats(state, hit_counter);
state.ResumeTiming();
}
}
BENCHMARK(BM_MaglevLoadBalancerChooseHost)
->Args({100, 100000})
->Args({200, 100000})
->Args({500, 100000})
->Unit(benchmark::kMillisecond);
void BM_RingHashLoadBalancerHostLoss(benchmark::State& state) {
for (auto _ : state) {
const uint64_t num_hosts = state.range(0);
const uint64_t min_ring_size = state.range(1);
const uint64_t hosts_to_lose = state.range(2);
const uint64_t keys_to_simulate = state.range(3);
RingHashTester tester(num_hosts, min_ring_size);
tester.ring_hash_lb_->initialize();
LoadBalancerPtr lb = tester.ring_hash_lb_->factory()->create();
std::vector<HostConstSharedPtr> hosts;
TestLoadBalancerContext context;
for (uint64_t i = 0; i < keys_to_simulate; i++) {
context.hash_key_ = hashInt(i);
hosts.push_back(lb->chooseHost(&context));
}
RingHashTester tester2(num_hosts - hosts_to_lose, min_ring_size);
tester2.ring_hash_lb_->initialize();
lb = tester2.ring_hash_lb_->factory()->create();
std::vector<HostConstSharedPtr> hosts2;
for (uint64_t i = 0; i < keys_to_simulate; i++) {
context.hash_key_ = hashInt(i);
hosts2.push_back(lb->chooseHost(&context));
}
ASSERT(hosts.size() == hosts2.size());
uint64_t num_different_hosts = 0;
for (uint64_t i = 0; i < hosts.size(); i++) {
if (hosts[i]->address()->asString() != hosts2[i]->address()->asString()) {
num_different_hosts++;
}
}
state.counters["percent_different"] =
(static_cast<double>(num_different_hosts) / hosts.size()) * 100;
state.counters["host_loss_over_N_optimal"] =
(static_cast<double>(hosts_to_lose) / num_hosts) * 100;
}
}
BENCHMARK(BM_RingHashLoadBalancerHostLoss)
->Args({500, 256000, 1, 10000})
->Args({500, 256000, 2, 10000})
->Args({500, 256000, 3, 10000})
->Unit(benchmark::kMillisecond);
void BM_MaglevLoadBalancerHostLoss(benchmark::State& state) {
for (auto _ : state) {
const uint64_t num_hosts = state.range(0);
const uint64_t hosts_to_lose = state.range(1);
const uint64_t keys_to_simulate = state.range(2);
MaglevTester tester(num_hosts);
tester.maglev_lb_->initialize();
LoadBalancerPtr lb = tester.maglev_lb_->factory()->create();
std::vector<HostConstSharedPtr> hosts;
TestLoadBalancerContext context;
for (uint64_t i = 0; i < keys_to_simulate; i++) {
context.hash_key_ = hashInt(i);
hosts.push_back(lb->chooseHost(&context));
}
MaglevTester tester2(num_hosts - hosts_to_lose);
tester2.maglev_lb_->initialize();
lb = tester2.maglev_lb_->factory()->create();
std::vector<HostConstSharedPtr> hosts2;
for (uint64_t i = 0; i < keys_to_simulate; i++) {
context.hash_key_ = hashInt(i);
hosts2.push_back(lb->chooseHost(&context));
}
ASSERT(hosts.size() == hosts2.size());
uint64_t num_different_hosts = 0;
for (uint64_t i = 0; i < hosts.size(); i++) {
if (hosts[i]->address()->asString() != hosts2[i]->address()->asString()) {
num_different_hosts++;
}
}
state.counters["percent_different"] =
(static_cast<double>(num_different_hosts) / hosts.size()) * 100;
state.counters["host_loss_over_N_optimal"] =
(static_cast<double>(hosts_to_lose) / num_hosts) * 100;
}
}
BENCHMARK(BM_MaglevLoadBalancerHostLoss)
->Args({500, 1, 10000})
->Args({500, 2, 10000})
->Args({500, 3, 10000})
->Unit(benchmark::kMillisecond);
void BM_MaglevLoadBalancerWeighted(benchmark::State& state) {
for (auto _ : state) {
const uint64_t num_hosts = state.range(0);
const uint64_t weighted_subset_percent = state.range(1);
const uint64_t before_weight = state.range(2);
const uint64_t after_weight = state.range(3);
const uint64_t keys_to_simulate = state.range(4);
MaglevTester tester(num_hosts, weighted_subset_percent, before_weight);
tester.maglev_lb_->initialize();
LoadBalancerPtr lb = tester.maglev_lb_->factory()->create();
std::vector<HostConstSharedPtr> hosts;
TestLoadBalancerContext context;
for (uint64_t i = 0; i < keys_to_simulate; i++) {
context.hash_key_ = hashInt(i);
hosts.push_back(lb->chooseHost(&context));
}
MaglevTester tester2(num_hosts, weighted_subset_percent, after_weight);
tester2.maglev_lb_->initialize();
lb = tester2.maglev_lb_->factory()->create();
std::vector<HostConstSharedPtr> hosts2;
for (uint64_t i = 0; i < keys_to_simulate; i++) {
context.hash_key_ = hashInt(i);
hosts2.push_back(lb->chooseHost(&context));
}
ASSERT(hosts.size() == hosts2.size());
uint64_t num_different_hosts = 0;
for (uint64_t i = 0; i < hosts.size(); i++) {
if (hosts[i]->address()->asString() != hosts2[i]->address()->asString()) {
num_different_hosts++;
}
}
state.counters["percent_different"] =
(static_cast<double>(num_different_hosts) / hosts.size()) * 100;
const auto weighted_hosts_percent = [weighted_subset_percent](uint32_t weight) -> double {
const double weighted_hosts = weighted_subset_percent;
const double unweighted_hosts = 100.0 - weighted_hosts;
const double total_weight = weighted_hosts * weight + unweighted_hosts;
return 100.0 * (weighted_hosts * weight) / total_weight;
};
state.counters["optimal_percent_different"] =
std::abs(weighted_hosts_percent(before_weight) - weighted_hosts_percent(after_weight));
}
}
BENCHMARK(BM_MaglevLoadBalancerWeighted)
->Args({500, 5, 1, 1, 10000})
->Args({500, 5, 1, 127, 1000})
->Args({500, 5, 127, 1, 10000})
->Args({500, 50, 1, 127, 1000})
->Args({500, 50, 127, 1, 10000})
->Args({500, 95, 1, 127, 1000})
->Args({500, 95, 127, 1, 10000})
->Args({500, 95, 25, 75, 1000})
->Args({500, 95, 75, 25, 10000})
->Unit(benchmark::kMillisecond);
} // namespace
} // namespace Upstream
} // namespace Envoy
// Boilerplate main(), which discovers benchmarks in the same file and runs them.
int main(int argc, char** argv) {
// TODO(mattklein123): Provide a common bazel benchmark wrapper much like we do for normal tests,
// fuzz, etc.
Envoy::Thread::MutexBasicLockable lock;
Envoy::Logger::Context logging_context(spdlog::level::warn,
Envoy::Logger::Logger::DEFAULT_LOG_FORMAT, lock);
benchmark::Initialize(&argc, argv);
if (benchmark::ReportUnrecognizedArguments(argc, argv)) {
return 1;
}
benchmark::RunSpecifiedBenchmarks();
}