Sequential and Parallel Algorithms and Data Structures: The Basic Toolbox

  title={Sequential and Parallel Algorithms and Data Structures: The Basic Toolbox},
  author={Peter Sanders and Kurt Mehlhorn and Martin Dietzfelbinger and Roman Dementiev},
  journal={Sequential and Parallel Algorithms and Data Structures},

TaskFlow: An Energy- and Makespan-Aware Task Placement Policy for Workflow Scheduling through Delay Management

This work embeds the idea in TaskFlow: a makespan conservative, energy-aware task placement policy for workflow scheduling, and presents some pitfalls that should be investigated further, notably starvation of large tasks when using TaskFlow.

PaCHash: Packed and Compressed Hash Tables

PaCHash is introduced, a hash table that stores its objects contiguously in an array without intervening space, even if the objects have variable size, and each object can be compressed using standard compression techniques.

Insertion Time of Random Walk Cuckoo Hashing below the Peeling Threshold

This paper shows that random walk insertions into cuckoo hash tables take O (1) expected amortised time when any number k ≥ 3 of hash functions is used and the load factor is below the corresponding peeling threshold.

Engineering In-place (Shared-memory) Sorting Algorithms

In many of the remaining cases, the new In-place Parallel Super Scalar Radix Sort (IPS2Ra) turns out to be the best algorithm, confirming the claims made about the robust performance of the algorithms while revealing major performance problems in many competitors outside the concrete set of measurements reported in the associated publications.

Analysis of Smooth Heaps and Slim Heaps

A new, self-contained analysis of smooth heaps and slim heaps in unrestricted operation is given, obtaining amortized bounds that match the best bounds known for self-adjusting heaps.

Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues

This paper introduces MultiQueues as a natural approach to relaxed priority queues based on multiple sequential priority queues and employs a seemingly paradoxical technique of “wait-free locking” that might be of more general interest to convert sequential data structures to relaxed concurrent data structures.

Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths

This work proposes the stepping algorithm framework, a new abstract data type, lazy-batched priority queue (LaB-PQ) that abstracts the semantics of the priority queue needed by the stepping algorithms, and implements three algorithms, including ρ-stepping, which is fast in practice and improved bounds for existing algorithms such as Radius-Stepping.

HTML5 Security Issues

This work contains a theoretical study on the methods and possibilities of attacks using HTML5, and a number of protective methods which have been developed against the basic types of attacks.

Fast, Exact and Scalable Dynamic Ridesharing

A novel algorithm for finding best insertions, based on (customizable) contraction hierarchies with local buckets, is presented, which is 30 times faster than a state-of-the-art algorithm currently used in industry and academia, and scales much better.

Communication-Efficient Probabilistic Algorithms: Selection, Sampling, and Checking

Diese Dissertation behandelt drei grundlegende Klassen von Problemen in Big-Data-Systemen, fur die wir kommunikationseffiziente probabilistische Algorithmen entwickeln. Im ersten Teil betrachten wir