-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathparallel2.cpp
More file actions
256 lines (230 loc) · 6.41 KB
/
parallel2.cpp
File metadata and controls
256 lines (230 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
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
#define _SILENCE_PARALLEL_ALGORITHMS_EXPERIMENTAL_WARNING
#include <execution>
#include <iostream>
#include <assert.h>
#include <string>
#include <algorithm>
template<class Iterator>
size_t seq_calc_sum(Iterator begin, Iterator end) {
size_t x = 0;
std::for_each(begin, end, [&](int item) {
x += item;
});
return x;
}
struct TestFuncForEachSeqSum {
template<class Iterator>
static size_t run(Iterator begin,Iterator end) {
size_t x = 0;
std::for_each(begin, end, [&](int item) {
x += item;
});
return x;
}
static std::string name() { return "for_each/seq sum"; };
};
struct TestFuncForEachRefSeqSum {
template<class Iterator>
static size_t run(Iterator begin, Iterator end) {
size_t x = 0;
std::for_each(begin, end, [&](int& item) {
x += item;
});
return x;
}
static std::string name() { return "for_each-ref/seq sum"; };
};
struct TestFuncForSeqSum {
template<class Iterator>
static size_t run(Iterator begin, Iterator end) {
size_t x = 0;
for (auto it = begin; it != end; ++it) {
x += *it;
}
return x;
}
static std::string name() { return "for/seq sum"; };
};
struct TestFuncAccumulateSeqSum {
template<class Iterator>
static size_t run(Iterator begin, Iterator end) {
return std::accumulate(begin, end, (size_t)0);
}
static std::string name() { return "accumulate/seq sum"; };
};
struct TestFuncReduceSeqSum {
template<class Iterator>
static size_t run(Iterator begin, Iterator end) {
return std::reduce(begin, end, (size_t)0);
}
static std::string name() { return "reduce/seq sum"; };
};
struct TestFuncMutexParSum {
template<class Iterator>
static size_t run(Iterator begin, Iterator end) {
size_t x = 0;
std::mutex m;
for (auto it = begin; it != end; ++it) {
std::lock_guard<std::mutex> lk(m);
x += *it;
}
return x;
}
static std::string name() { return "mutex/par sum"; };
};
struct TestFuncAtomicParSum {
template<class Iterator>
static size_t run(Iterator begin, Iterator end) {
std::atomic<size_t> x = 0;
for (auto it = begin; it != end; ++it) {
x += *it;
}
return x;
}
static std::string name() { return "atomic/par sum"; };
};
struct TestFuncReduceParSum {
template<class Iterator>
static size_t run(Iterator begin, Iterator end) {
return std::reduce(std::execution::par, begin, end, (size_t)0);
}
static std::string name() { return "reduce/par sum"; };
};
struct TestFuncManualParSum {
template<class RandomAccessIterator>
static size_t run(RandomAccessIterator begin, RandomAccessIterator end) {
std::atomic<size_t> x = 0;
constexpr int NCHUNKS = 128;
RandomAccessIterator starts[NCHUNKS];
size_t sz = (end - begin) / NCHUNKS;
for (int i = 0; i < NCHUNKS; ++i) {
starts[i] = begin + sz * i;
assert(starts[i]<end);
}
std::for_each(std::execution::par_unseq, starts, starts + NCHUNKS, [&](RandomAccessIterator start) {
size_t y = 0;
for (auto it = start; it < start + sz; ++it) {
y += *it;
}
x += y;
});
return x;
}
static std::string name() { return "manual/par sum"; };
};
struct TestFuncForEachSeqModify {
template<class Iterator>
static void run(Iterator begin, Iterator end) {
std::for_each(begin, end, [](int& item) {
item += 2;
});
}
static std::string name() { return "for_each/seq modify"; };
};
struct TestFuncForSeqModify {
template<class Iterator>
static void run(Iterator begin, Iterator end) {
for(auto it = begin; it != end; ++it) {
*it += 2;
}
}
static std::string name() { return "for/seq modify"; };
};
struct TestFuncForEachParModify {
template<class Iterator>
static void run(Iterator begin, Iterator end) {
std::for_each(std::execution::par,begin, end, [](int& item) {
item += 2;
});
}
static std::string name() { return "for_each/par modify"; };
};
struct TestFuncTransformSeqModify {
template<class Iterator>
static void run(Iterator begin, Iterator end) {
std::transform(begin, end, begin, [](int item) {
return item + 2;
});
}
static std::string name() { return "transform/seq modify"; };
};
struct TestFuncManualParModify {
template<class RandomAccessIterator>
static void run(RandomAccessIterator begin, RandomAccessIterator end) {
constexpr int NCHUNKS = 128;
RandomAccessIterator starts[NCHUNKS];
size_t sz = (end - begin) / NCHUNKS;
for (int i = 0; i < NCHUNKS; ++i) {
starts[i] = begin + sz * i;
assert(starts[i]<end);
}
std::for_each(std::execution::par_unseq, starts, starts + NCHUNKS, [&](RandomAccessIterator start) {
size_t y = 0;
for (auto it = start; it < start + sz; ++it) {
*it += 2;
}
});
}
static std::string name() { return "manual/par modify"; };
};
class Benchmark {
std::chrono::high_resolution_clock::time_point start;
public:
Benchmark() {
start = std::chrono::high_resolution_clock::now();
}
int64_t us() {
auto stop = std::chrono::high_resolution_clock::now();
auto length = std::chrono::duration_cast<std::chrono::microseconds>(stop - start);
return (int64_t)length.count();
}
};
constexpr int NN = 1000;
size_t seq0;
template<class TestFunc,class Container>
void runtest_modify(Container& a) {
Benchmark bp;
for (int i = 0; i < NN; ++i) {
TestFunc::run(a.begin(), a.end());;
}
int64_t us = bp.us() / NN;
std::cout << TestFunc::name() << ": took " << us << "us/run" << std::endl;
}
template<class TestFunc, class Container>
void runtest_sum(Container& a) {
Benchmark bp;
for (int i = 0; i < NN; ++i) {
size_t par = TestFunc::run(a.begin(), a.end());;
if (par != seq0) {
std::cout << "WRONG RESULT @" << i << " iteration" << std::endl;
abort();
}
}
int64_t us = bp.us() / NN;
std::cout << TestFunc::name() << ": took " << us << "us/run" << std::endl;
}
int main( int argc, char** argv ) {
constexpr size_t SZ = 1048576*8;
std::vector<int> a;
a.reserve(SZ);
for (size_t i = 0; i < SZ; ++i) {
a.push_back( int(i * i*argc) );
}
seq0 = seq_calc_sum(a.begin(), a.end());
runtest_sum<TestFuncForSeqSum>(a);
runtest_sum<TestFuncForEachSeqSum>(a);
runtest_sum<TestFuncForEachRefSeqSum>(a);
runtest_sum<TestFuncAccumulateSeqSum>(a);
runtest_sum<TestFuncReduceSeqSum>(a);
runtest_sum<TestFuncMutexParSum>(a);
runtest_sum<TestFuncAtomicParSum>(a);
runtest_sum<TestFuncReduceParSum>(a);
runtest_sum<TestFuncManualParSum>(a);
std::cout << "===MODIFY===" << std::endl;
runtest_modify<TestFuncForSeqModify>(a);
runtest_modify<TestFuncForEachSeqModify>(a);
runtest_modify<TestFuncForEachParModify>(a);
runtest_modify<TestFuncTransformSeqModify>(a);
runtest_modify<TestFuncManualParModify>(a);
return 0;
}