Scheduling computations with provably low synchronization overheads

Guilherme Rito () and Hervé Paulino ()
Additional contact information
Guilherme Rito: ETH-Zurich
Hervé Paulino: NOVA University Lisbon

Journal of Scheduling, 2022, vol. 25, issue 1, No 6, 107-124

Abstract: Abstract 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 $$T_{1}$$ T 1 and critical-path length $$T_{\infty }$$ T ∞ executed by P processors using our scheduler. Our analysis shows that the expected execution time is $$O\left( \frac{T_{1}}{P} + T_{\infty }\right) $$ O T 1 P + T ∞ , and the expected synchronization overheads incurred during the execution are at most $$O\left( \left( C_{\mathrm{CAS}} + C_{\mathrm{MFence}}\right) PT_{\infty }\right) $$ O C CAS + C MFence P T ∞ , where $$C_{\mathrm{CAS}}$$ C CAS and $$C_{\mathrm{MFence}}$$ C MFence , respectively, denote the maximum cost of executing a Compare-And-Swap instruction and a Memory Fence instruction.

Keywords: Work stealing; Synchronization overheads; Upper bounds; Scheduling (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10951-021-00706-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:25:y:2022:i:1:d:10.1007_s10951-021-00706-6

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-021-00706-6

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().