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

DOI10.1145/3157734zbMath1484.65008arXiv1610.05141OpenAlexW3122247640WikidataQ113310096 ScholiaQ113310096MaRDI QIDQ4581396

C. Dachsbacher, Peter Sanders, Emanuel Schrade, Sebastian Lamm, Lorenz Hübschle-Schneider

Publication date: 17 August 2018

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.05141

zbMATH Keywords

parallel algorithmscommunication efficient algorithmshypergeometric random deviates

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Parallel algorithms in computer science (68W10) Parallel numerical computation (65Y05) Random number generation in numerical analysis (65C10)

Related Items (3)

Parallel Weighted Random Sampling ⋮ Load-Balancing for Parallel Delaunay Triangulations ⋮ Parallel Streaming Random Sampling

This page was built for publication: Efficient Parallel Random Sampling—Vectorized, Cache-Efficient, and Online