Scheduling Algorithms for Strict Multithreaded Computations

Panagiota Fatourou, Paul G. Spirakis

Abstract: In this paper, two scheduling algorithms that solve the problem of efficient scheduling k-strict multithreaded computations are presented. Both of them use the work-stealing technique, in which a processor that doesn't have work to do, steals threads from other processors. Our results achieve linear speedup and linear expansion of memory, for constant k (that is k ∈ O(1)). However, they are general and hold for all values of k.