Skip to content

Add the expression "it is assumed" #3611

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Jan 3, 2022
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion docs/parallel/openmp/d-using-the-schedule-clause.md
Original file line number Diff line number Diff line change
Expand Up @@ -22,7 +22,7 @@ When there are repeated references to the same objects, the choice of schedule f
}
```

In the remaining examples, it's assumed that memory access isn't the dominant consideration. Unless otherwise stated, that all threads receive comparable computational resources. In these cases, the choice of schedule for a `for` construct depends on all the shared work that's to be performed between the nearest preceding barrier and either the implied closing barrier or the nearest upcoming barrier, if there's a `nowait` clause. For each kind of schedule, a short example shows how that schedule kind is likely to be the best choice. A brief discussion follows each example.
In the remaining examples, it's assumed that memory access isn't the dominant consideration. Unless otherwise stated, it is assumed that all threads receive comparable computational resources. In these cases, the choice of schedule for a `for` construct depends on all the shared work that's to be performed between the nearest preceding barrier and either the implied closing barrier or the nearest upcoming barrier, if there's a `nowait` clause. For each kind of schedule, a short example shows how that schedule kind is likely to be the best choice. A brief discussion follows each example.

The `static` schedule is also appropriate for the simplest case, a parallel region containing a single `for` construct, with each iteration requiring the same amount of work.

Expand Down