3 citations · 5 across the 6 of their papers we have counts for
6 papers
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…
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…
Data Structures for Task-based Priority Scheduling
Martin Wimmer, Daniel Cederman, Francesco Versaci +2
Many task-parallel applications can benefit from attempting to execute tasks in a specific order, as for instance indicated by priorities associated with the tasks. We present thre…
Configurable Strategies for Work-stealing
Martin Wimmer, Daniel Cederman, Jesper Larsson Träff +1
Work-stealing systems are typically oblivious to the nature of the tasks they are scheduling. For instance, they do not know or take into account how long a task will take to execu…
Work-stealing for mixed-mode parallelism by deterministic team-building
Martin Wimmer, Jesper Larsson Träff
We show how to extend classical work-stealing to deal also with data parallel tasks that can require any number of threads r >= 1 for their execution. We explain in detail the so i…