A Scalable Parallel Algorithm for Balanced Sampling (Student Abstract)

We present a novel parallel algorithm for drawing balanced samples from large populations. When auxiliary variables about the population units are known, balanced sampling improves the quality of the estimations obtained from the sample. Available algorithms, e. g. , the cube method, are inherently sequential, and do not scale to large populations. Our parallel algorithm is based on a variant of the cube method for stratified populations. It has the same sample quality as sequential algorithms, and almost ideal parallel speedup.

Authors

• Alexander Lee
• Stefan Walzer-Goldfeld
• Shukry Zablah
• Matteo Riondato

Keywords

No keywords are indexed for this paper.