An algorithm for a Work-stealing with multiplicity Work-stealing with multiplicity is a relaxation in which, roughly speaking, every task is extracted at least once, and if several operations extract the task, they must be concurrent. In the formal set-sequential specification below (and its vari...
To our knowledge, these are the first algorithms for relaxations of work-stealing possessing all these properties. The algorithms are also solutions to relaxed versions of single-enqueuer multi-dequeuer queues. The theoretical results are complemented with an experimental evaluation showing that the ...