并行版的std::accumulate

2023-12-21 01:52

文章标签 std 并行 accumulate

本文主要是介绍并行版的std::accumulate，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

代码来自C++并发编程实战

#include <iostream>
#include <thread>
#include<functional>
#include <algorithm>
#include <vector>
#include <numeric>//标准库里的accumulate在这个头文件里
using namespace std;
using namespace placeholders;
template<typename Iterator,typename T>
struct accumulage_block {//这个是给线程是可执行对象void operator()(Iterator first, Iterator last, T& result) {result = accumulate(first, last, result);//里面直接用标准库的累加函数}
};
template<typename Iterator, typename T>
T parallel_accumulate(Iterator first, Iterator last, T init) {unsigned long const length = distance(first, last);//获得两个迭代器之间的距离if (!length)//长度为0，直接返回return init;unsigned long const min_per_thread = 25;unsigned long const max_threads = (length + min_per_thread - 1) / min_per_thread;unsigned long const hardware_threads = thread::hardware_concurrency();unsigned long const num_threads=min(hardware_threads!=0?hardware_threads:2, max_threads);//上面的是在决定线程数量unsigned long const block_size = length / num_threads;//根据线程数量把范围内的元素分块，每个线程处理对应块范围块的累加vector<T> results(num_threads);//每个线程对应的块范围的累加结果，存在这里vector<thread> threads(num_threads - 1);//线程数量-1，因为这里是主线程还算一个Iterator block_start = first;for (unsigned long i = 0; i < num_threads - 1; i++) {Iterator block_end = block_start;advance(block_end, block_size);//每次尾迭代器移动一个块的大小threads[i] = thread(accumulage_block<Iterator, T>(), block_start, block_end, ref(results[i]));//创建一个线程，计算一个块范围内的累加和block_start = block_end;//首迭代器移动，使得bolck_start和block_end始终相差一个块的距离}accumulage_block<Iterator, T>()(block_start, last, results[num_threads - 1]);//主线程处理 最后一块for_each(threads.begin(), threads.end(), mem_fn(&thread::join));//等待所有线程结束return accumulate(results.begin(), results.end(), init);//把每个线程的结果累加
}
int main()
{vector<int> vec{ 1,4,5,6,3,2 };int ans = parallel_accumulate<vector<int>::iterator,int>(vec.begin(),vec.end(), 0);cout << ans;}