mirror of
https://github.com/RPCS3/llvm.git
synced 2025-02-22 11:42:42 +00:00
[Support/Parallel] - Do not use a task group for a very small task.
parallel_for_each_n splits a given task into small pieces of tasks and then passes them to background threads managed by a thread pool to process them in parallel. TaskGroup then waits for all tasks to be done, which is done by TaskGroup's destructor. In the previous code, all tasks were passed to background threads, and the main thread just waited for them to finish their jobs. This patch changes the logic so that the main thread processes a task just like other worker threads instead of just waiting for workers. This patch improves the performance of parallel_for_each_n for a task which is too small that we do not split it into multiple tasks. Previously, such task was submitted to another thread and the main thread waited for its completion. That involves multiple inter-thread synchronization which is not cheap for small tasks. Now, such task is processed by the main thread, so no inter-thread communication is necessary. Differential revision: https://reviews.llvm.org/D36607 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@311312 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
745029aaf7
commit
1d7887e334
@ -158,11 +158,11 @@ void parallel_for_each(IterTy Begin, IterTy End, FuncTy Fn) {
|
||||
TaskSize = 1;
|
||||
|
||||
TaskGroup TG;
|
||||
while (TaskSize <= std::distance(Begin, End)) {
|
||||
while (TaskSize < std::distance(Begin, End)) {
|
||||
TG.spawn([=, &Fn] { std::for_each(Begin, Begin + TaskSize, Fn); });
|
||||
Begin += TaskSize;
|
||||
}
|
||||
TG.spawn([=, &Fn] { std::for_each(Begin, End, Fn); });
|
||||
std::for_each(Begin, End, Fn);
|
||||
}
|
||||
|
||||
template <class IndexTy, class FuncTy>
|
||||
@ -179,10 +179,8 @@ void parallel_for_each_n(IndexTy Begin, IndexTy End, FuncTy Fn) {
|
||||
Fn(J);
|
||||
});
|
||||
}
|
||||
TG.spawn([=, &Fn] {
|
||||
for (IndexTy J = I; J < End; ++J)
|
||||
Fn(J);
|
||||
});
|
||||
for (IndexTy J = I; J < End; ++J)
|
||||
Fn(J);
|
||||
}
|
||||
|
||||
#endif
|
||||
|
Loading…
x
Reference in New Issue
Block a user