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
Right now since we don't translate A += B to parfor, the above example should be relatively easier to handle.
But more generally, if it was written as A = A + B, then the reduction code becomes a parfor before lowering, and then at lowering stage, it would be rather difficult to extract the set of reduction instructions.
This is a lot more difficult to handle correctly. In general, there are a lot of restrictions on what can be safely parallelized for an arbitrary loop. We are not doing a good job at checking them.
We need to support reduction of arrays in the gufunc backend. Example below.
The text was updated successfully, but these errors were encountered: