Lorenz Hübschle-Schneider

Efficient Parallel Random Sampling : Vectorized, Cache-Efficient, and Online

2018 · Repository KITopen (Karlsruhe Institute of Technology)

We consider the problem of sampling n numbers from the range { 1,… , N } without replacement on modern architectures. The main result is a simple divide-and-conquer scheme that makes sequential algorithms more cache …