ultra
Reputation: 11
How to find optimal number of threads to calculate a really large vector's sum using modern c++?
How to find optimal number of threads to calculate a really large vector's sum using modern c++? I know similar questions/answers are available. But say I don't know what configuration of prod machine will be . Still the approach should take least time
Upvotes: 1
Views: 109
Answers (1)
MSalters
Reputation: 179907
You don't, that's the implementations job. You call std::reduce with std::execution::parallel_unsequenced_policy.
(C++11 std::accumulate is specified too tightly to be executed in parallel.)
Upvotes: 5
Related Questions
- Specific number of elements - vectors
- multiple threads for vector processing
- Optimization of a large array sum (multi-threaded)
- Scalability of multi-threaded vector sum
- C++ manipulation of HUGE vector using threads: can it be optimized further?
- Calculating the sum of a large vector in parallel
- No speedup for vector sums with threading
- Fastest Way to Parallelize Operation over a Vector in C++?
- how to use std::threads efficiently to reduce run time
- Parallel Sum for Vectors