We present three lock-free data structures for priority task scheduling: a priority work-stealing
one, a centralized one with ρ-relaxed semantics, and a hybrid one combining both concepts …

In this paper, the focus is put on multi‐core branch‐and‐bound algorithms for solving large‐
scale permutation‐based optimization problems. We investigate five work stealing (WS) …

This thesis provides an in-depth discussion of task scheduling for shared memory systems.
The topic is approached in a vertical manner, starting with high-level programming model …

The performance growth of individual processor cores has been slowed by physical
limitations that are difficult to overcome; as such, the trend has been for processor …

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 …