Peter Sanders

Concurrent Hash Tables: Fast and General?(!)

2016 · arXiv (Cornell University)

Concurrent hash tables are one of the most important concurrent data structures with numerous applications. Since hash table accesses can dominate the execution time of the overall application, we need implementations that achieve good speedup. …

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 …