原文地址:
https://www.threadingbuildingblocks.org/tutorial-intel-tbb-generic-parallel-algorithms
https://software.intel.com/en-us/node/506057
测试代码:
#include"tbb/tbb.h"
using namespace tbb;
void Foo(float x){
//此处换为在for中执行的方法
qDebug() << "x:" << x;
}
//串行
void SerialApplyFoo( float a[], size_t n ) {
for( size_t i=0; i!=n; ++i )
Foo(a[i]);
}
class ApplyFoo {
float *const my_a;
public:
void operator()( const blocked_range<size_t>& r ) const {
float *a = my_a;
for( size_t i=r.begin(); i!=r.end(); ++i )
Foo(a[i]);
}
ApplyFoo( float a[] ) :
my_a(a)
{}
};
//并行
void ParallelApplyFoo( float a[], size_t n ) {
/*1--https://software.intel.com/en-us/node/506057
parallel_for(blocked_range<size_t>(0,n), ApplyFoo(a));*/
/*Lambda Expressions
parallel_for( blocked_range<size_t>(0,n),
[=](const blocked_range<size_t>& r) {
for(size_t i=r.begin(); i!=r.end(); ++i)
Foo(a[i]);
}
);*/
/*compact form
紧凑的表单只支持整数的单维迭代空间*/
tbb::parallel_for( size_t(0), n, [&]( size_t i ) {
Foo(a[i]);
} );
/*Controlling Chunking
parallel_for(blocked_range<size_t>(0,n,5), ApplyFoo(a),
simple_partitioner());*/
}
int main(int argc, char *argv[])
{
QApplication app1(argc, argv);
//注意,数组大小为10的时候我没有测试出来
float *arr = new float[100];
for(int i=0; i<100; i++){
arr[i] = i;
}
// float arr[100] = {0,1,2,3,4,5,6,7,8,9};
size_t count = 100;
SerialApplyFoo(arr,count);
qDebug() << "-----------------";
ParallelApplyFoo(arr,count);
return app1.exec();
}