Skip to content
Navigation Menu
{{ message }}
forked from taskflow/taskflow
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy paththreadpool.cpp
More file actions
526 lines (430 loc) · 11.4 KB
/
Copy paththreadpool.cpp
File metadata and controls
526 lines (430 loc) · 11.4 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
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
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
// 2018/10/04 - modified by Tsung-Wei Huang
// - removed binary tree tests
// - removed spawn/shutdown tests
// - removed siltne_async and async tests
// - added emplace test
// - adopted the new thread pool implementation
//
// 2018/09/29 - modified by Tsung-Wei Huang
// - added binary tree tests
// - added worker queue tests
// - added external thread tests
// - refactored threadpool tests
//
// 2018/09/13 - modified by Tsung-Wei Huang & Chun-Xun
// - added tests for ownership
// - modified spawn-shutdown tests
//
// 2018/09/10 - modified by Tsung-Wei Huang
// - added tests for SpeculativeThreadpool
// - added dynamic tasking tests
// - added spawn and shutdown tests
//
// 2018/09/02 - created by Guannan
// - test_silent_async
// - test_async
// - test_wait_for_all
#define DOCTEST_CONFIG_IMPLEMENT_WITH_MAIN
#include <doctest.h>
#include <taskflow/threadpool/threadpool.hpp>
// Procedure: test_ownership
template <typename ThreadpoolType>
void test_ownership(ThreadpoolType& tp) {
REQUIRE(tp.is_owner());
tp.emplace([&](){
if(tp.num_workers() == 0) {
REQUIRE(tp.is_owner());
}
else {
REQUIRE(!tp.is_owner());
}
});
std::vector<std::thread> threads;
for(int i=0; i<10; ++i) {
threads.emplace_back([&] () {
REQUIRE(!tp.is_owner());
});
}
for(auto& t : threads) {
t.join();
}
}
// Procedure: test_emplace
template <typename ThreadpoolType>
void test_emplace(ThreadpoolType& tp) {
constexpr size_t num_tasks = 1024;
std::atomic<size_t> counter{0};
for(size_t i=0; i<num_tasks; i++){
tp.emplace([&counter](){
counter.fetch_add(1, std::memory_order_relaxed); }
);
}
while(counter != num_tasks);
}
// Procedure: test_dynamic_tasking
template <typename T>
void test_dynamic_tasking(T& threadpool) {
std::atomic<size_t> sum {0};
std::atomic<size_t> cnt {0};
std::function<void(int)> insert;
std::promise<int> promise;
auto future = promise.get_future();
insert = [&threadpool, &insert, &sum, &promise, &cnt] (int i) {
if(i > 0) {
++cnt;
threadpool.emplace([i=i-1, &insert] () {
insert(i);
});
}
else {
if(auto s = ++sum; s == threadpool.num_workers()) {
promise.set_value(1);
}
}
};
if(auto W = threadpool.num_workers(); W > 0) {
for(size_t i=0; i<threadpool.num_workers(); i++){
insert(100);
}
}
else {
promise.set_value(1);
}
// synchronize until all tasks finish
REQUIRE(future.get() == 1);
REQUIRE(cnt == 100 * threadpool.num_workers());
REQUIRE(sum == threadpool.num_workers());
}
// Procedure: test_external_threads
template <typename T>
void test_external_threads(T& threadpool) {
constexpr int num_tasks = 65536;
std::vector<std::thread> threads;
std::atomic<size_t> sum {0};
for(int i=0; i<10; ++i) {
threads.emplace_back([&] () {
std::this_thread::sleep_for(std::chrono::microseconds(100));
for(int j=0; j<num_tasks; ++j) {
threadpool.emplace([&] () {
sum.fetch_add(1, std::memory_order_relaxed);
});
}
});
}
// master thread to insert
for(int j=0; j<num_tasks; ++j) {
threadpool.emplace([&] () {
sum.fetch_add(1, std::memory_order_relaxed);
});
}
// worker thread to insert
for(int i=0; i<10; ++i) {
threadpool.emplace([&] () {
for(int j=0; j<num_tasks; ++j) {
threadpool.emplace([&] () {
sum.fetch_add(1, std::memory_order_relaxed);
});
}
});
}
for(auto& t : threads) {
t.join();
}
while(sum != num_tasks * 10 * 2 + num_tasks) ;
}
// Procedure: test_threadpool
template <typename T>
void test_threadpool() {
SUBCASE("Ownership") {
for(unsigned i=0; i<=4; ++i) {
T tp(i);
test_ownership(tp);
}
}
SUBCASE("Emplace") {
for(unsigned i=0; i<=4; ++i) {
T tp(i);
test_emplace(tp);
}
}
SUBCASE("DynamicTasking") {
for(unsigned i=0; i<=4; ++i) {
T tp(i);
test_dynamic_tasking(tp);
}
}
SUBCASE("ExternalThreads") {
for(unsigned i=0; i<=4; ++i) {
T tp(i);
test_external_threads(tp);
}
}
}
// ============================================================================
// Threadpool tests
// ============================================================================
// ----------------------------------------------------------------------------
// Testcase: SimpleThreadpool
// ----------------------------------------------------------------------------
TEST_CASE("SimpleThreadpool" * doctest::timeout(300)) {
test_threadpool<tf::SimpleThreadpool<std::function<void()>>>();
}
// ----------------------------------------------------------------------------
// Testcase: ProactiveThreadpool
// ----------------------------------------------------------------------------
TEST_CASE("ProactiveThreadpool" * doctest::timeout(300)) {
test_threadpool<tf::ProactiveThreadpool<std::function<void()>>>();
}
// ----------------------------------------------------------------------------
// Testcase: SpeculativeThreadpool
// ----------------------------------------------------------------------------
TEST_CASE("SpeculativeThreadpool" * doctest::timeout(300)) {
test_threadpool<tf::SpeculativeThreadpool<std::function<void()>>>();
}
// ----------------------------------------------------------------------------
// Testcase: PrivatizedThreadpool
// ----------------------------------------------------------------------------
TEST_CASE("PrivatizedThreadpool" * doctest::timeout(300)) {
test_threadpool<tf::PrivatizedThreadpool<std::function<void()>>>();
}
/*
// ============================================================================
// WorkerQueue Tests
// ============================================================================
// ----------------------------------------------------------------------------
// Testcase: OneThread
// ----------------------------------------------------------------------------
TEST_CASE("WorkerQueue.OneThread" * doctest::timeout(300)) {
constexpr int N = 1024;
int data;
tf::RunQueue<int, 1024> queue;
REQUIRE(queue.empty());
// push_front + pop_back
SUBCASE("PFPB") {
for(int i=0; i<N; ++i) {
REQUIRE(queue.push_front(i));
REQUIRE(!queue.empty());
}
REQUIRE(!queue.push_front(data));
REQUIRE(!queue.push_back(data));
for(int i=0; i<N; ++i) {
REQUIRE(queue.pop_back(data));
REQUIRE(data == i);
}
REQUIRE(queue.empty());
}
// push_front + pop_front
SUBCASE("PFPF") {
for(int i=0; i<N; ++i) {
REQUIRE(queue.push_front(i));
REQUIRE(!queue.empty());
}
REQUIRE(!queue.push_front(data));
REQUIRE(!queue.push_back(data));
for(int i=0; i<N; ++i) {
REQUIRE(queue.pop_front(data));
REQUIRE(data == N-i-1);
}
REQUIRE(queue.empty());
}
// push_back + pop_back
SUBCASE("PBPB") {
for(int i=0; i<N; ++i) {
REQUIRE(queue.push_back(i));
REQUIRE(!queue.empty());
}
REQUIRE(!queue.push_front(data));
REQUIRE(!queue.push_back(data));
for(int i=0; i<N; ++i) {
REQUIRE(queue.pop_back(data));
REQUIRE(data == N-i-1);
}
REQUIRE(queue.empty());
}
// push_back + pop_front
SUBCASE("PBPF") {
for(int i=0; i<N; ++i) {
REQUIRE(queue.push_back(i));
REQUIRE(!queue.empty());
}
REQUIRE(!queue.push_back(data));
REQUIRE(!queue.push_front(data));
for(int i=0; i<N; ++i) {
REQUIRE(queue.pop_front(data));
REQUIRE(data == i);
}
REQUIRE(queue.empty());
}
// half-half
SUBCASE("HalfHalf") {
for(int i=0; i<N; ++i) {
if(i < N/2) {
REQUIRE(queue.push_front(i));
}
else {
REQUIRE(queue.push_back(i));
}
REQUIRE(!queue.empty());
}
REQUIRE(!queue.push_front(data));
REQUIRE(!queue.push_back(data));
for(int i=0; i<N; ++i) {
if(i < N/2) {
REQUIRE(queue.pop_front(data));
REQUIRE(data == N/2 - i - 1);
}
else {
REQUIRE(queue.pop_front(data));
REQUIRE(data == i);
}
}
REQUIRE(queue.empty());
}
// back-and-forth
SUBCASE("BackAndForth") {
for(int i=0; i<N; ++i) {
if(i % 2 == 0) {
REQUIRE(queue.push_front(i));
}
else {
REQUIRE(queue.push_back(i));
}
}
for(int i=0; i<N; ++i) {
if(i < N/2) {
REQUIRE(queue.pop_back(data));
REQUIRE(data == N - (2*i+1));
}
else {
REQUIRE(queue.pop_back(data));
REQUIRE(data == 2*i - N);
}
}
}
}
// ----------------------------------------------------------------------------
// Testcase: TwoThread
// ----------------------------------------------------------------------------
TEST_CASE("WorkerQueue.TwoThread" * doctest::timeout(300)) {
constexpr int N = (1 << 20);
tf::RunQueue<int, 64> queue;
// push front + pop back
// notice that there is no test of push front + pop front
SUBCASE("PFPB") {
REQUIRE(queue.empty());
std::thread t1([&, i=0] () mutable {
while(i < N) {
if(queue.push_front(i)) {
++i;
}
}
});
std::thread t2([&, i=0] () mutable {
int data;
while(i < N) {
if(queue.pop_back(data)) {
REQUIRE(data == i);
++i;
}
}
});
t1.join();
t2.join();
REQUIRE(queue.empty());
}
// push back + pop front
SUBCASE("PBPF") {
REQUIRE(queue.empty());
std::thread t1([&, i=0] () mutable {
while(i < N) {
if(queue.push_back(i)) {
++i;
}
}
});
std::thread t2([&, i=0] () mutable {
int data;
while(i < N) {
if(queue.pop_front(data)) {
REQUIRE(data == i);
++i;
}
}
});
t1.join();
t2.join();
REQUIRE(queue.empty());
}
// push back + pop back
SUBCASE("PBPB") {
std::vector<int> res;
REQUIRE(queue.empty());
std::thread t1([&, i=0] () mutable {
while(i < N) {
if(queue.push_back(i)) {
++i;
}
}
});
std::thread t2([&, i=0] () mutable {
int data;
while(i < N) {
if(queue.pop_back(data)) {
res.push_back(data);
++i;
}
}
});
t1.join();
t2.join();
REQUIRE(queue.empty());
std::sort(res.begin(), res.end());
REQUIRE(res.size() == N);
for(int i=0; i<N; ++i) {
REQUIRE(res[i] == i);
}
}
}
// ----------------------------------------------------------------------------
// Testcase: TriThread
// ----------------------------------------------------------------------------
TEST_CASE("WorkerQueue.TriThread" * doctest::timeout(300)) {
constexpr int N = (1 << 21);
tf::RunQueue<int, 64> queue;
std::vector<int> res;
// push front + push back + pop back
REQUIRE(queue.empty());
std::thread t1([&, i=0] () mutable {
while(i < N/2) {
if(queue.push_front(i)) {
++i;
}
}
});
std::thread t2([&, i=N/2] () mutable {
while(i < N) {
if(queue.push_back(i)) {
++i;
}
}
});
std::thread t3([&, i=0] () mutable {
int data;
while(i < N) {
if(queue.pop_back(data)) {
res.push_back(data);
++i;
}
}
});
t1.join();
t2.join();
t3.join();
REQUIRE(queue.empty());
std::sort(res.begin(), res.end());
REQUIRE(res.size() == N);
for(int i=0; i<N; ++i) {
REQUIRE(res[i] == i);
}
}
*/
You can’t perform that action at this time.