Scheduling computations with provably low synchronization overheads

Guilherme Rito, Hervé Paulino

Research output: Contribution to journalArticlepeer-review


We present a Work Stealing scheduling algorithm that provably avoids most synchronization overheads by keeping processors’ deques entirely private by default and only exposing work when requested by thieves. This is the first paper that obtains bounds on the synchronization overheads that are (essentially) independent of the total amount of work, thus corresponding to a great improvement, in both algorithm design and theory, over state-of-the-art Work Stealing algorithms. Consider any computation with work T1 and critical-path length T executed by P processors using our scheduler. Our analysis shows that the expected execution time is O(T1P+T∞), and the expected synchronization overheads incurred during the execution are at most O((CCAS+ CMFence) PT) , where CCAS and CMFence, respectively, denote the maximum cost of executing a Compare-And-Swap instruction and a Memory Fence instruction.

Original languageEnglish
Pages (from-to)107-124
JournalJournal Of Scheduling
Issue number1
Publication statusPublished - Feb 2022


  • Scheduling
  • Synchronization overheads
  • Upper bounds
  • Work stealing


Dive into the research topics of 'Scheduling computations with provably low synchronization overheads'. Together they form a unique fingerprint.

Cite this