Publications (125)
ReStore: In-Memory REplicated STORagE for Rapid Recovery in Fault-Tolerant Algorithms
Lukas Hübner, Demian Hespe, Peter Sanders +1
Fault-tolerant distributed applications require mechanisms to recover data lost via a process failure. On modern cluster systems it is typically impractical to request replacement…
Sliding Block Hashing (Slick) -- Basic Algorithmic Ideas
Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
We present {\bf Sli}ding Blo{\bf ck} Hashing (Slick), a simple hash table data structure that combines high performance with very good space efficiency. This preliminary report out…
Communication Efficient Checking of Big Data Operations
Lorenz Hübschle-Schneider, Peter Sanders
We propose fast probabilistic algorithms with low (i.e., sublinear in the input size) communication volume to check the correctness of operations in Big Data processing frameworks…
Scalable Distributed-Memory External Sorting
Mirko Rahn, Peter Sanders, Johannes Singler
We engineer algorithms for sorting huge data sets on massively parallel machines. The algorithms are based on the multiway merging paradigm. We first outline an algorithm whose I/O…
Communication Efficient Algorithms for Top-k Selection Problems
Lorenz Hübschle-Schneider, Peter Sanders, Ingo Müller
We present scalable parallel algorithms with sublinear per-processor communication volume and low latency for several fundamental problems related to finding the most relevant elem…
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…