Scheduling computations with provably low synchronization overheads

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 (essen...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of scheduling 2022-02, Vol.25 (1), p.107-124
Hauptverfasser:	Rito, Guilherme, Paulino, Hervé
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Artificial Intelligence Business and Management Calculus of Variations and Optimal Control Optimization Computer science Operations Research/Decision Theory Optimization Processors Scheduling Supply Chain Management Synchronism Theft
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!