Scheduling multithreaded computations by work stealing

DOI10.1145/324133.324234zbMath1065.68504OpenAlexW2016559894MaRDI QIDQ3158556

Charles E. Leiserson, Robert D. Blumofe

Publication date: 25 January 2005

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/324133.324234

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (37)

Scheduling computations with provably low synchronization overheads ⋮ \texttt{mplrs}: a scalable parallel vertex/facet enumeration code ⋮ Lazy tree splitting ⋮ Performance analysis of work stealing strategies in large scale multi-threaded computing ⋮ Stochastic Process Creation ⋮ Random allocation of jobs with weights and precedence ⋮ High order cell-centered Lagrangian-type finite volume schemes with time-accurate local time stepping on unstructured triangular meshes ⋮ ON SCHEDULING SERIES-PARALLEL DAGs TO MAXIMIZE AREA ⋮ Decentralized list scheduling ⋮ Comparison of OpenMP 3.0 and other task parallel frameworks on unbalanced task graphs ⋮ High order finite volume methods on wavelet-adapted grids with local time-stepping on multicore architectures for the simulation of shock-bubble interactions ⋮ Parallel construction of succinct trees ⋮ Amortization results for chromatic search trees, with an application to priority queues ⋮ Energy-efficient multiprocessor scheduling for flow time and makespan ⋮ On the efficiency of localized work stealing ⋮ Space-efficient scheduling of stochastically generated tasks ⋮ A dynamic-sized nonblocking work stealing deque ⋮ Oracle-guided scheduling for controlling granularity in implicitly parallel languages ⋮ Efficient data race detection for async-finish parallelism ⋮ Energy-efficient job stealing for CPU-intensive processing in mobile devices ⋮ Space profiling for parallel functional programs ⋮ Implicitly threaded parallelism in Manticore ⋮ A note on the parallel runtime of self-stabilizing graph linearization ⋮ Performance driven distributed scheduling of parallel hybrid computations ⋮ Unnamed Item ⋮ \textit{MRAG-I2D}: multi-resolution adapted grids for remeshed vortex methods on multicore architectures ⋮ NB{\texttt{malloc}}: Allocating memory in a lock-free manner ⋮ The cache complexity of multithreaded cache oblivious algorithms ⋮ About optimal management of work-stealing deques in two-level memory ⋮ Fast and compact planar embeddings ⋮ Task-based adaptive multiresolution for time-space multi-scale reaction-diffusion systems on multi-core architectures ⋮ Open problems in queueing theory inspired by datacenter computing ⋮ The models and methods of optimal control of three work-stealing deques located in a shared memory ⋮ An analysis of budgeted parallel search on conditional Galton-Watson trees ⋮ An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling ⋮ Specification and verification of concurrent programs through refinements ⋮ Upper bounds on number of steals in rooted trees

This page was built for publication: Scheduling multithreaded computations by work stealing