2880. Relax complexity specifications for non-sequenced policies

Section: 26.3.3 [algorithms.parallel.exec] Status: Resolved Submitter: Switzerland Opened: 2017-02-03 Last modified: 2017-06-26

Priority: Not Prioritized

View all other issues in [algorithms.parallel.exec].

View all issues with Resolved status.

Discussion:

Parallel implementations of algorithms may be faster if not restricted to the complexity specifications of serial implementations.

Proposed change: Add a relaxation of complexity specifications for non-sequenced policies.

Proposed resolution:

Resolved by the adoption of P0523r1 in Kona