OpenMP: what is the difference between "taskloop" and "omp for" performance wise?

Question

"taskloop" is introduced in OpenMP 4.5. It can take clauses from both loop and task constructs (except depend clause AFAIK).

However, I'm wondering if "taskloop" and "omp for" constructs differ performance wise too.

Answer 1

I think it may depends on the actual problem. To parallelize a for loop omp for can be faster than tasks, because it offers several different scheduling scheme for your needs. In my experience (solving a particular problem using clang12 compiler) omp for produces a bit faster code than tasks (on Ryzen 5 7800X).