Affiliation:
1. Karlsruhe Institute of Technology, Karlsruhe, Germany
Abstract
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 efficient and leads to a parallel algorithm running in expected time
O
(
n
/
p
+log
p
) on
p
processors, i.e., scales to massively parallel machines even for moderate values of
n
. The amount of communication between the processors is very small (at most
O
(log
p
)) and independent of the sample size. We also discuss modifications needed for load balancing, online sampling, sampling with replacement, Bernoulli sampling, and vectorization on SIMD units or GPUs.
Publisher
Association for Computing Machinery (ACM)
Subject
Applied Mathematics,Software
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献