97 citations · 392 across the 64 of their papers we have counts for
6 papers · 1 filter
Fast, Exact and Scalable Dynamic Ridesharing
Valentin Buchhold, Peter Sanders, Dorothea Wagner
We study the problem of servicing a set of ride requests by dispatching a set of shared vehicles, which is faced by ridesharing companies such as Uber and Lyft. Solving this proble…
Scalable Shared-Memory Hypergraph Partitioning
Lars Gottesbüren, Tobias Heuer, Peter Sanders +1
Hypergraph partitioning is an important preprocessing step for optimizing data placement and minimizing communication volumes in high-performance computing applications. To cope wi…
Engineering In-place (Shared-memory) Sorting Algorithms
Michael Axtmann, Sascha Witt, Daniel Ferizovic +1
We present sorting algorithms that represent the fastest known techniques for a wide range of input sizes, input distributions, data types, and machines. A part of the speed advant…
Recent Advances in Scalable Network Generation
Manuel Penschuck, Ulrik Brandes, Michael Hamann +5
Random graph models are frequently used as a controllable and versatile data source for experimental campaigns in various research fields. Generating such data-sets at scale is a n…
Connecting MapReduce Computations to Realistic Machine Models
Peter Sanders
We explain how the popular, highly abstract MapReduce model of parallel computation (MRC) can be rooted in reality by explaining how it can be simulated on realistic distributed-me…
Communication-Efficient String Sorting
Timo Bingmann, Peter Sanders, Matthias Schimek
There has been surprisingly little work on algorithms for sorting strings on distributed-memory parallel machines. We develop efficient algorithms for this problem based on the mul…