16 citations · 57 across the 26 of their papers we have counts for
6 papers · 1 filter
A more Pragmatic Implementation of the Lock-free, Ordered, Linked List
Jesper Larsson Träff, Manuel Pöter
The lock-free, ordered, linked list is an important, standard example of a concurrent data structure. An obvious, practical drawback of textbook implementations is that failed comp…
High-Quality Hierarchical Process Mapping
Marcelo Fonseca Faraj, Alexander van der Grinten, Henning Meyerhenke +2
Partitioning graphs into blocks of roughly equal size such that few edges run between blocks is a frequently needed operation when processing graphs on a parallel computer. When a…
Benchmarking Concurrent Priority Queues: Performance of k-LSM and Related Data Structures
Jakob Gruber, Jesper Larsson Träff, Martin Wimmer
A number of concurrent, relaxed priority queues have recently been proposed and implemented. Results are commonly reported for a throughput benchmark that uses a uniform distributi…
Polynomial-time Construction of Optimal Tree-structured Communication Data Layout Descriptions
Robert Ganian, Martin Kalany, Stefan Szeider +1
We show that the problem of constructing tree-structured descriptions of data layouts that are optimal with respect to space or other criteria from given sequences of displacements…
The Lock-free -LSM Relaxed Priority Queue
Martin Wimmer, Jakob Gruber, Jesper Larsson Träff +1
Priority queues are data structures which store keys in an ordered fashion to allow efficient access to the minimal (maximal) key. Priority queues are essential for many applicatio…
An improved, easily computable combinatorial lower bound for weighted graph bipartitioning
Jesper Larsson Träff, Martin Wimmer
There has recently been much progress on exact algorithms for the (un)weighted graph (bi)partitioning problem using branch-and-bound and related methods. In this note we present an…