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
For some applications such as Monte-Carlo, random number generation can be the bottleneck in performance. It would be useful to support a concurrent RNG that can generate numbers in multiple threads (probably using a fork join pool and/or coroutines) using all available cores and zip them back into a single stream for the requesting thread. This would probably only make sense for large arrays, so a hybrid single/multi-threaded approach may be appropriate.
The text was updated successfully, but these errors were encountered:
For some applications such as Monte-Carlo, random number generation can be the bottleneck in performance. It would be useful to support a concurrent RNG that can generate numbers in multiple threads (probably using a fork join pool and/or coroutines) using all available cores and zip them back into a single stream for the requesting thread. This would probably only make sense for large arrays, so a hybrid single/multi-threaded approach may be appropriate.
The text was updated successfully, but these errors were encountered: