Skip to content

hw06 GeLee #13

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
GeLee-Q wants to merge 3 commits into
base: main
Choose a base branch
from
Open

hw06 GeLee #13

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
acdcc57
1
GeLee-Q Jan 28, 2022
d6c4f65
Update main.cpp
GeLee-Q Jan 28, 2022
8253833
Update main.cpp
GeLee-Q Jan 28, 2022
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
105 changes: 81 additions & 24 deletions main.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -5,35 +5,53 @@
#include <numeric>
#include <algorithm>
#include "ticktock.h"
#include <tbb/parallel_for.h>
#include <tbb/parallel_for_each.h>
#include <tbb/parallel_reduce.h>
#include <tbb/parallel_scan.h>
#include <tbb/concurrent_vector.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++) {
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;
}

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];
}
const size_t n = x.size();
tbb::parallel_for(tbb::blocked_range<size_t>(0, n),
[&](tbb::blocked_range<size_t> r){
for(size_t i = r.begin(); i < r.end(); i++){
x[i] = x[i]*a + 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];
}
const size_t n = min(x.size(),y.size());
ret = tbb::parallel_reduce(tbb::blocked_range<size_t>(0, n),(T) 0,
[&](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 @@ -43,10 +61,24 @@ 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];
}
const size_t n = x.size();
// tbb::parallel_for(tbb::blocked_range<size_t>(0,n),
// [&](tbb::blocked_range<size_t> r){
// for(size_t i = r.begin() ; i < r.end() ; ++i){
// if(x[i] < ret){
// ret = x[i];
// }
// }
// });
tbb::parallel_reduce(tbb::blocked_range<size_t>(0, n),(T) x[0],
[&](tbb::blocked_range<size_t> 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;
}
Expand All @@ -55,14 +87,27 @@ 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]);
}
}
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<size_t>(0,n),
[&](tbb::blocked_range<size_t> r){
std::vector<T> 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;
}
Expand All @@ -71,10 +116,20 @@ 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;
}
const size_t n = x.size();
ret = tbb::parallel_scan(tbb::blocked_range<size_t>(0,n),(T) 0 ,
[&](tbb::blocked_range<size_t> 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;
}
Expand All @@ -100,3 +155,5 @@ int main() {

return 0;
}