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
|
/*
* This file is open source software, licensed to you under the terms
* of the Apache License, Version 2.0 (the "License"). See the NOTICE file
* distributed with this work for additional information regarding copyright
* ownership. You may not use this file except in compliance with the License.
*
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*/
/*
* Copyright (C) 2020 ScyllaDB Ltd.
*/
#include <seastar/testing/perf_tests.hh>
#include <seastar/core/sharded.hh>
#include <seastar/core/thread.hh>
#include <seastar/core/fair_queue.hh>
#include <seastar/core/semaphore.hh>
#include <seastar/core/loop.hh>
#include <seastar/core/when_all.hh>
#include <ranges>
static constexpr fair_queue::class_id cid = 0;
struct local_fq_and_class {
seastar::fair_group fg;
seastar::fair_queue fq;
seastar::fair_queue sfq;
unsigned executed = 0;
static fair_group::config fg_config() {
fair_group::config cfg;
return cfg;
}
seastar::fair_queue& queue(bool local) noexcept { return local ? fq : sfq; }
local_fq_and_class(seastar::fair_group& sfg)
: fg(fg_config(), 1)
, fq(fg, seastar::fair_queue::config())
, sfq(sfg, seastar::fair_queue::config())
{
fq.register_priority_class(cid, 1);
sfq.register_priority_class(cid, 1);
}
~local_fq_and_class() {
fq.unregister_priority_class(cid);
sfq.unregister_priority_class(cid);
}
};
struct local_fq_entry {
seastar::fair_queue_entry ent;
std::function<void()> submit;
template <typename Func>
local_fq_entry(fair_queue_entry::capacity_t cap, Func&& f)
: ent(cap)
, submit(std::move(f)) {}
};
struct perf_fair_queue {
static constexpr unsigned requests_to_dispatch = 1000;
seastar::sharded<local_fq_and_class> local_fq;
seastar::fair_group shared_fg;
static fair_group::config fg_config() {
fair_group::config cfg;
return cfg;
}
perf_fair_queue()
: shared_fg(fg_config(), smp::count)
{
local_fq.start(std::ref(shared_fg)).get();
}
~perf_fair_queue() {
local_fq.stop().get();
}
future<> test(bool local);
};
future<> perf_fair_queue::test(bool loc) {
auto invokers = local_fq.invoke_on_all([loc] (local_fq_and_class& local) {
return parallel_for_each(std::views::iota(0u, requests_to_dispatch), [&local, loc] (unsigned dummy) {
auto cap = local.queue(loc).tokens_capacity(double(1) / std::numeric_limits<int>::max() + double(1) / std::numeric_limits<int>::max());
auto req = std::make_unique<local_fq_entry>(cap, [&local, loc, cap] {
local.executed++;
local.queue(loc).notify_request_finished(cap);
});
local.queue(loc).queue(cid, req->ent);
req.release();
return make_ready_future<>();
});
});
auto collectors = local_fq.invoke_on_all([loc] (local_fq_and_class& local) {
// Zeroing this counter must be here, otherwise should the collectors win the
// execution order in when_all_succeed(), the do_until()'s stopping callback
// would return true immediately and the queue would not be dispatched.
//
// At the same time, although this counter is incremented by the lambda from
// invokers, it's not called until the fq.dispatch_requests() is, so there's no
// opposite problem if zeroing it here.
local.executed = 0;
return do_until([&local] { return local.executed == requests_to_dispatch; }, [&local, loc] {
local.queue(loc).dispatch_requests([] (fair_queue_entry& ent) {
local_fq_entry* le = boost::intrusive::get_parent_from_member(&ent, &local_fq_entry::ent);
le->submit();
delete le;
});
return make_ready_future<>();
});
});
return when_all_succeed(std::move(invokers), std::move(collectors)).discard_result();
}
PERF_TEST_F(perf_fair_queue, contended_local)
{
return test(true);
}
PERF_TEST_F(perf_fair_queue, contended_shared)
{
return test(false);
}
|
