5 citations · 6 across the 4 of their papers we have counts for
3 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…
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…
Lock-free Concurrent Data Structures
Daniel Cederman, Anders Gidenstam, Phuong Ha +3
Concurrent data structures are the data sharing side of parallel programming. Data structures give the means to the program to store data, but also provide operations to the progra…