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
Looking towards the future of C++ parallel algorithms, <ranges> are becoming the canonical model for expressing and composing algorithms with arbitrary transformations. As such, we want the next generation of Thrust/CUB-like parallel algorithms to be based on ranges.
Thus far, <ranges> has been designed primarily with sequential execution in mind. In order for us to build a next generation set of parallel algorithms and utilities, we will need to investigate to what extent the existing <ranges> design supports parallel execution.
The high-level goal is that we should be able to use a ranges-based interface to express anything we are able to express today with Thrust + fancy iterators with equal or better expressiveness and performance.
Looking towards the future of C++ parallel algorithms,
<ranges>
are becoming the canonical model for expressing and composing algorithms with arbitrary transformations. As such, we want the next generation of Thrust/CUB-like parallel algorithms to be based on ranges.Thus far,
<ranges>
has been designed primarily with sequential execution in mind. In order for us to build a next generation set of parallel algorithms and utilities, we will need to investigate to what extent the existing<ranges>
design supports parallel execution.The high-level goal is that we should be able to use a ranges-based interface to express anything we are able to express today with Thrust + fancy iterators with equal or better expressiveness and performance.
<ranges>
algorithms #1184The text was updated successfully, but these errors were encountered: