diff --git a/main.cpp b/main.cpp index a1d2625..7d3c93b 100644 --- a/main.cpp +++ b/main.cpp @@ -5,15 +5,22 @@ #include #include #include "ticktock.h" +#include +#include +#include +#include +#include + // TODO: 并行化所有这些 for 循环 template std::vector fill(std::vector &arr, Func const &func) { TICK(fill); - for (size_t i = 0; i < arr.size(); i++) { + const size_t n = arr.size(); + tbb::parallel_for((size_t)0, (size_t)n,[&](size_t i){ arr[i] = func(i); - } + }); TOCK(fill); return arr; } @@ -21,9 +28,13 @@ std::vector fill(std::vector &arr, Func const &func) { template void saxpy(T a, std::vector &x, std::vector const &y) { TICK(saxpy); - for (size_t i = 0; i < x.size(); i++) { - x[i] = a * x[i] + y[i]; - } + const size_t n = x.size(); + tbb::parallel_for(tbb::blocked_range(0, n), + [&](tbb::blocked_range r){ + for(size_t i = r.begin(); i < r.end(); i++){ + x[i] = x[i]*a + y[i]; + } + }); TOCK(saxpy); } @@ -31,9 +42,16 @@ template T sqrtdot(std::vector const &x, std::vector 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]; - } + const size_t n = min(x.size(),y.size()); + ret = tbb::parallel_reduce(tbb::blocked_range(0, n),(T) 0, + [&](tbb::blocked_range 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; @@ -43,10 +61,24 @@ template T minvalue(std::vector const &x) { TICK(minvalue); T ret = x[0]; - for (size_t i = 1; i < x.size(); i++) { - if (x[i] < ret) - ret = x[i]; - } + const size_t n = x.size(); +// tbb::parallel_for(tbb::blocked_range(0,n), +// [&](tbb::blocked_range r){ +// for(size_t i = r.begin() ; i < r.end() ; ++i){ +// if(x[i] < ret){ +// ret = x[i]; +// } +// } +// }); + tbb::parallel_reduce(tbb::blocked_range(0, n),(T) x[0], + [&](tbb::blocked_range r, T local_min){ + for(size_t i = r.begin(); i < r.end() ; i++){ + local_min = min(local_min,x[i]); + } + return local_min;}, + [](T x, T y){ + return min(x,y); + }); TOCK(minvalue); return ret; } @@ -55,14 +87,27 @@ template std::vector magicfilter(std::vector const &x, std::vector const &y) { TICK(magicfilter); std::vector 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]); - } - } + std::mutex mtx; + const size_t n = min(x.size(),y.size()); + res.reserve(n); + tbb::task_arena ta(6); + ta.execute([&]{ + tbb::parallel_for(tbb::blocked_range(0,n), + [&](tbb::blocked_range r){ + std::vector local_res; + local_res.reserve(r.size()); + 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 lck(mtx); + std::copy(local_res.begin(), local_res.end(), std::back_inserter(res)); + },tbb::auto_partitioner{}); + }); TOCK(magicfilter); return res; } @@ -71,10 +116,20 @@ template T scanner(std::vector &x) { TICK(scanner); T ret = 0; - for (size_t i = 0; i < x.size(); i++) { - ret += x[i]; - x[i] = ret; - } + const size_t n = x.size(); + ret = tbb::parallel_scan(tbb::blocked_range(0,n),(T) 0 , + [&](tbb::blocked_range r, T local_ret, auto is_final){ + for(size_t i = r.begin(); i < r.end(); ++i){ + local_ret += x[i]; + if(is_final){ + x[i] = local_ret; + } + } + return local_ret; + }, + []( T x , T y){ + return x + y; + }); TOCK(scanner); return ret; } @@ -100,3 +155,5 @@ int main() { return 0; } + +