Scheduling multithreaded computations by work stealing
From MaRDI portal
Recommendations
Cited in
(46)- Amortization results for chromatic search trees, with an application to priority queues
- Upper bounds on number of steals in rooted trees
- Oracle-guided scheduling for controlling granularity in implicitly parallel languages
- Non-blocking steal-half work queues
- Energy-efficient multiprocessor scheduling for flow time and makespan
- Scheduling algorithms for strict multithreaded computations
- On scheduling series-parallel DAGs to maximize area
- Performance analysis of work stealing strategies in large scale multi-threaded computing
- scientific article; zbMATH DE number 7561439 (Why is no real title available?)
- Efficient data race detection for async-finish parallelism
- Scheduling computations with provably low synchronization overheads
- A tighter analysis of work stealing
- Guidelines for data-parallel cycle-stealing in networks of workstations. II: On maximizing guaranteed output
- Space-efficient scheduling of stochastically generated tasks
- scientific article; zbMATH DE number 1859732 (Why is no real title available?)
- Specification and verification of concurrent programs through refinements
- High order cell-centered Lagrangian-type finite volume schemes with time-accurate local time stepping on unstructured triangular meshes
- The cache complexity of multithreaded cache oblivious algorithms
- A note on the parallel runtime of self-stabilizing graph linearization
- Performance driven distributed scheduling of parallel hybrid computations
- Open problems in queueing theory inspired by datacenter computing
- Performance analysis of work stealing strategies in large-scale multithreaded computing
- Comparison of OpenMP 3.0 and other task parallel frameworks on unbalanced task graphs
- Parallel construction of succinct trees
- Process-commutative distributed objects: from cryptocurrencies to Byzantine-fault-tolerant CRDTs
- Algorithm Theory - SWAT 2004
- On the efficiency of localized work stealing
- Task-based adaptive multiresolution for time-space multi-scale reaction-diffusion systems on multi-core architectures
- About optimal management of work-stealing deques in two-level memory
- Random allocation of jobs with weights and precedence
- NB{\texttt{malloc}}: Allocating memory in a lock-free manner
- The models and methods of optimal control of three work-stealing deques located in a shared memory
- Energy-efficient job stealing for CPU-intensive processing in mobile devices
- Lazy tree splitting
- \textit{MRAG-I2D}: multi-resolution adapted grids for remeshed vortex methods on multicore architectures
- SLF: a passive parallelization of subgraph isomorphism
- High order finite volume methods on wavelet-adapted grids with local time-stepping on multicore architectures for the simulation of shock-bubble interactions
- A dynamic-sized nonblocking work stealing deque
- Stochastic Process Creation
- An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling
- scientific article; zbMATH DE number 1863298 (Why is no real title available?)
- Decentralized list scheduling
- Implicitly threaded parallelism in Manticore
- Space profiling for parallel functional programs
- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code
- An analysis of budgeted parallel search on conditional Galton-Watson trees
This page was built for publication: Scheduling multithreaded computations by work stealing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3158556)
