Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
5 changes: 5 additions & 0 deletions .vscode/settings.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,5 @@
{
"files.associations": {
"cmath": "cpp"
}
}
105 changes: 78 additions & 27 deletions main.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -4,36 +4,56 @@
#include <cmath>
#include <numeric>
#include <algorithm>
#include <mutex>
#include <tbb/parallel_for.h>
#include <tbb/parallel_reduce.h>
#include <tbb/parallel_scan.h>
#include <tbb/spin_mutex.h>
#include "ticktock.h"


// TODO: 并行化所有这些 for 循环

template <class T, class Func>
std::vector<T> fill(std::vector<T> &arr, Func const &func) {
TICK(fill);
for (size_t i = 0; i < arr.size(); i++) {
arr[i] = func(i);
}
tbb::parallel_for((size_t)0, arr.size(),
[&](size_t i){
arr[i] = func(i);
}
);
TOCK(fill);
return arr;
}

template <class T>
void saxpy(T a, std::vector<T> &x, std::vector<T> const &y) {
TICK(saxpy);
for (size_t i = 0; i < x.size(); i++) {
x[i] = a * x[i] + y[i];
}
tbb::parallel_for(tbb::blocked_range<size_t>(0,x.size()),
[&](tbb::blocked_range<size_t>r){
for (size_t i = r.begin(); i < r.end(); ++i) {
x[i] = a * x[i] + y[i];
}
}
);
TOCK(saxpy);
}

template <class T>
T sqrtdot(std::vector<T> const &x, std::vector<T> const &y) {
TICK(sqrtdot);
T ret = 0;
for (size_t i = 0; i < std::min(x.size(), y.size()); i++) {
ret += x[i] * y[i];
}
size_t n = std::min(x.size(), y.size());
T ret = tbb::parallel_reduce(tbb::blocked_range<size_t>(0,n), T{},
[&](tbb::blocked_range<size_t> r, T local_ret) {
for(size_t i = r.begin(); i < r.end(); ++i) {
local_ret += x[i] * y[i];
}
return local_ret;
},
[](T x, T y){
return x + y;
}
);
ret = std::sqrt(ret);
TOCK(sqrtdot);
return ret;
Expand All @@ -42,11 +62,19 @@ T sqrtdot(std::vector<T> const &x, std::vector<T> const &y) {
template <class T>
T minvalue(std::vector<T> const &x) {
TICK(minvalue);
T ret = x[0];
for (size_t i = 1; i < x.size(); i++) {
if (x[i] < ret)
ret = x[i];
}
T ret = tbb::parallel_reduce(tbb::blocked_range<size_t>(1,x.size()), x[0],
[&](tbb::blocked_range<size_t> r, T local_ret ) {
for(size_t i = r.begin(); i < r.end(); ++i) {
if(x[i] < local_ret) {
local_ret = x[i];
}
}
return local_ret;
},
[](T x , T y){
return std::min(x,y);
}
);
TOCK(minvalue);
return ret;
}
Expand All @@ -55,26 +83,49 @@ template <class T>
std::vector<T> magicfilter(std::vector<T> const &x, std::vector<T> const &y) {
TICK(magicfilter);
std::vector<T> res;
for (size_t i = 0; i < std::min(x.size(), y.size()); i++) {
if (x[i] > y[i]) {
res.push_back(x[i]);
} else if (y[i] > x[i] && y[i] > 0.5f) {
res.push_back(y[i]);
res.push_back(x[i] * y[i]);
size_t n = std::min(x.size(), y.size());
res.reserve(n*3);
tbb::spin_mutex mtx;
tbb::task_arena ta(20);
ta.execute([&]{
tbb::parallel_for(tbb::blocked_range<size_t>(0,n),
[&](tbb::blocked_range<size_t> r){
std::vector<T> local_res;
local_res.reserve(r.size()*2);
for(size_t i = r.begin(); i <r.end(); i++){
if(x[i] > y[i]) {
local_res.push_back(x[i]);
} else if (y[i] > x[i] && y[i] > 0.5f) {
local_res.push_back(y[i]);
local_res.push_back(x[i] * y[i]);
}
}
std::lock_guard<tbb::spin_mutex> lock_guard(mtx);
std::copy(local_res.begin(), local_res.end(), std::back_inserter(res));
}, tbb::auto_partitioner{});
}
}
);
TOCK(magicfilter);
return res;
}

template <class T>
T scanner(std::vector<T> &x) {
TICK(scanner);
T ret = 0;
for (size_t i = 0; i < x.size(); i++) {
ret += x[i];
x[i] = ret;
}
T ret = tbb::parallel_scan(tbb::blocked_range<size_t>(0,x.size()), T{},
[&](tbb::blocked_range<size_t>r, T locale_ret, auto is_final) {
for(size_t i = r.begin(); i < r.end(); ++i) {
locale_ret += x[i];
if(is_final) {
x[i] = locale_ret;
}
}
return locale_ret;
},
[](T x, T y) {
return x + y;
}
);
TOCK(scanner);
return ret;
}
Expand Down