16 citations · 57 across the 26 of their papers we have counts for
4 papers · 2 filters
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…
On the State and Importance of Reproducible Experimental Research in Parallel Computing
Sascha Hunold, Jesper Larsson Träff
Computer science is also an experimental science. This is particularly the case for parallel computing, which is in a total state of flux, and where experiments are necessary to su…
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…
Perfectly load-balanced, optimal, stable, parallel merge
Christian Siebert, Jesper Larsson Träff
We present a simple, work-optimal and synchronization-free solution to the problem of stably merging in parallel two given, ordered arrays of m and n elements into an ordered array…