You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I guess other OMP implementations could use this setting as well, since most of those also require some search for neighbors, which can vary a lot and hence vary the computation between each iteration?
Candidates are for-loops where the loop iterations do not take the same time, e.g. when a neighbourhood search is done for each point in a cloud (especially radius search).
Files that contain parallelized for-loops and should be checked:
The text was updated successfully, but these errors were encountered:
mvieth
changed the title
Check which OpenMP for-loops benefit from dynamic schedule
Check which OpenMP for-loops could benefit from dynamic schedule
Aug 7, 2023
Originally posted by @larshg in #5775 (comment)
Candidates are for-loops where the loop iterations do not take the same time, e.g. when a neighbourhood search is done for each point in a cloud (especially radius search).
Files that contain parallelized for-loops and should be checked:
The text was updated successfully, but these errors were encountered: