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 pathtaskflow.cpp
More file actions
362 lines (273 loc) · 9.49 KB
/
Copy pathtaskflow.cpp
File metadata and controls
362 lines (273 loc) · 9.49 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
// 2018/10/24 - modified by Tsung-Wei Huang
// - Taskflow is templated at threadpool
// - added graph-level comparison with different thread pools
//
// 2018/09/19 - created by Tsung-Wei Huang
//
// This program is used to benchmark the taskflow under different types
// of workloads.
#include <taskflow/taskflow.hpp>
#include <chrono>
#include <random>
#include <climits>
// Procedure: benchmark
#define BENCHMARK(TITLE, F) \
std::cout << "========== " << TITLE << " ==========\n"; \
\
std::cout << "Taskflow [simple executor ]: " \
<< F<tf::BasicTaskflow<tf::SimpleThreadpool>>() \
<< " ms\n"; \
\
std::cout << "Taskflow [practive executor ]: " \
<< F<tf::BasicTaskflow<tf::ProactiveThreadpool>>() \
<< " ms\n"; \
\
std::cout << "Taskflow [speculative executor]: " \
<< F<tf::BasicTaskflow<tf::SpeculativeThreadpool>>() \
<< " ms\n"; \
// ============================================================================
// Dynamic Stem
// ============================================================================
// Function: dynamic_stem
template <typename T>
auto dynamic_stem() {
auto beg = std::chrono::high_resolution_clock::now();
{
const int L = 1024;
std::atomic<size_t> sum {0};
T tf;
std::optional<tf::Task> prev;
for(int l=0; l<L; ++l) {
auto curr = tf.silent_emplace([&, l] (auto& subflow) {
sum.fetch_add(1, std::memory_order_relaxed);
std::optional<tf::Task> p;
for(int k=0; k<L; k++) {
auto c = subflow.silent_emplace([&] () {
sum.fetch_add(1, std::memory_order_relaxed);
});
if(p) {
p->precede(c);
}
p = c;
}
if(l & 1) {
subflow.detach();
}
});
if(prev) {
prev->precede(curr);
}
prev = curr;
}
tf.wait_for_all();
assert(sum == L*(L+1));
}
auto end = std::chrono::high_resolution_clock::now();
return std::chrono::duration_cast<std::chrono::milliseconds>(end - beg).count();
}
// ============================================================================
// Map-Reduce
// ============================================================================
// Function: map_reduce
template <typename T>
auto map_reduce() {
auto beg = std::chrono::high_resolution_clock::now();
{
const int num_batches = 65536;
std::vector<int> C(1024, 10);
std::atomic<size_t> sum {0};
T tf;
std::optional<tf::Task> prev;
for(int i=0; i<num_batches; ++i) {
auto [s, t] = tf.parallel_for(C.begin(), C.end(), [&] (int v) {
sum.fetch_add(v, std::memory_order_relaxed);
});
if(prev) {
prev->precede(s);
}
prev = t;
}
tf.wait_for_all();
assert(sum == num_batches * C.size() * 10);
}
auto end = std::chrono::high_resolution_clock::now();
return std::chrono::duration_cast<std::chrono::milliseconds>(end - beg).count();
}
// ============================================================================
// Level Graph
// ============================================================================
// Function: level_graph
template <typename T>
auto level_graph() {
const int num_levels = 2048;
const int num_nodes_per_level = 1024;
auto beg = std::chrono::high_resolution_clock::now();
{
std::atomic<size_t> sum {0};
T tf;
std::vector< std::vector<tf::Task> > tasks;
tasks.resize(num_levels);
for(int l=0; l<num_levels; ++l) {
for(int i=0; i<num_nodes_per_level; ++i) {
tasks[l].push_back(tf.silent_emplace([&] () {
sum.fetch_add(1, std::memory_order_relaxed);
}));
}
}
// connections for each level l to l+1
for(int l=0; l<num_levels-1; ++l) {
for(int i=0; i<num_nodes_per_level; ++i) {
for(int j=0; j<num_nodes_per_level; j=j+i+1) {
tasks[l][i].precede(tasks[l+1][j]);
}
}
}
tf.wait_for_all();
assert(sum == num_levels * num_nodes_per_level);
}
auto end = std::chrono::high_resolution_clock::now();
return std::chrono::duration_cast<std::chrono::milliseconds>(end - beg).count();
}
// ============================================================================
// Linear Graph
// ============================================================================
// Function: linear_graph
template <typename T>
auto linear_graph() {
const int num_nodes = 1000000;
auto beg = std::chrono::high_resolution_clock::now();
{
size_t sum {0};
T tf;
std::vector<tf::Task> tasks;
for(int i=0; i<num_nodes; ++i) {
tasks.push_back(tf.silent_emplace([&] () { ++sum; }));
}
tf.linearize(tasks);
tf.wait_for_all();
assert(sum == num_nodes);
}
auto end = std::chrono::high_resolution_clock::now();
return std::chrono::duration_cast<std::chrono::milliseconds>(end - beg).count();
}
// ============================================================================
// Binary Tree
// ============================================================================
// Function: binary_tree
template <typename T>
auto binary_tree() {
const int num_levels = 21;
auto beg = std::chrono::high_resolution_clock::now();
{
T tf;
std::atomic<size_t> sum {0};
std::function<void(int, tf::Task)> insert;
insert = [&] (int l, tf::Task parent) {
if(l < num_levels) {
auto lc = tf.silent_emplace([&] () {
sum.fetch_add(1, std::memory_order_relaxed);
});
auto rc = tf.silent_emplace([&] () {
sum.fetch_add(1, std::memory_order_relaxed);
});
parent.precede(lc);
parent.precede(rc);
insert(l+1, lc);
insert(l+1, rc);
}
};
auto root = tf.silent_emplace([&] () {
sum.fetch_add(1, std::memory_order_relaxed);
});
insert(1, root);
// synchronize until all tasks finish
tf.wait_for_all();
assert(sum == (1 << (num_levels)) - 1);
}
auto end = std::chrono::high_resolution_clock::now();
return std::chrono::duration_cast<std::chrono::milliseconds>(end - beg).count();
}
// ============================================================================
// Empty Jobs
// ============================================================================
// Function: empty_jobs
template <typename T>
auto empty_jobs() {
const int num_tasks = 1000000;
auto beg = std::chrono::high_resolution_clock::now();
{
T tf;
for(size_t i=0; i<num_tasks; i++){
tf.silent_emplace([](){});
}
tf.wait_for_all();
}
auto end = std::chrono::high_resolution_clock::now();
return std::chrono::duration_cast<std::chrono::milliseconds>(end - beg).count();
}
// ============================================================================
// Atomic add
// ============================================================================
// Function: atomic_add
template <typename T>
auto atomic_add() {
const int num_tasks = 1000000;
auto beg = std::chrono::high_resolution_clock::now();
{
std::atomic<int> counter(0);
T tf;
for(size_t i=0; i<num_tasks; i++){
tf.silent_emplace([&counter](){
counter.fetch_add(1, std::memory_order_relaxed);
});
}
tf.wait_for_all();
assert(counter == num_tasks);
}
auto end = std::chrono::high_resolution_clock::now();
return std::chrono::duration_cast<std::chrono::milliseconds>(end - beg).count();
}
// ============================================================================
// Multiple Dispatches
// ============================================================================
// Function: multiple_dispatches
template <typename T>
auto multiple_dispatches() {
auto create_graph = [] (T& tf, size_t N, std::atomic<int>& c) {
for(size_t i=0; i<N; ++i) {
auto [A, B, C, D] = tf.silent_emplace(
[&] () { c.fetch_add(1, std::memory_order_relaxed); },
[&] () { c.fetch_add(1, std::memory_order_relaxed); },
[&] () { c.fetch_add(1, std::memory_order_relaxed); },
[&] () { c.fetch_add(1, std::memory_order_relaxed); }
);
A.precede(B);
C.precede(D);
}
};
auto beg = std::chrono::high_resolution_clock::now();
{
T tf;
for(int p=0; p<1024; ++p) {
std::atomic<int> counter(0);
create_graph(tf, p, counter);
tf.wait_for_all();
assert(counter == p * 4);
}
}
auto end = std::chrono::high_resolution_clock::now();
return std::chrono::duration_cast<std::chrono::milliseconds>(end - beg).count();
}
// ----------------------------------------------------------------------------
// Function: main
int main(int argc, char* argv[]) {
BENCHMARK("Multiple Dispatches", multiple_dispatches);
BENCHMARK("Empty Jobs", empty_jobs);
BENCHMARK("Atomic Add", atomic_add);
BENCHMARK("Binary Tree", binary_tree);
BENCHMARK("Linear Graph", linear_graph);
BENCHMARK("Level Graph", level_graph);
BENCHMARK("Map Reduce", map_reduce);
BENCHMARK("Dynamic Stem", dynamic_stem);
return 0;
}
You can’t perform that action at this time.