Pages that link to "Item:Q3158556"
From MaRDI portal
The following pages link to Scheduling multithreaded computations by work stealing (Q3158556):
Displaying 41 items.
- Upper bounds on number of steals in rooted trees (Q255260) (← links)
- High order cell-centered Lagrangian-type finite volume schemes with time-accurate local time stepping on unstructured triangular meshes (Q349817) (← links)
- Decentralized list scheduling (Q367649) (← links)
- Energy-efficient multiprocessor scheduling for flow time and makespan (Q401300) (← links)
- Space-efficient scheduling of stochastically generated tasks (Q418125) (← links)
- Energy-efficient job stealing for CPU-intensive processing in mobile devices (Q488618) (← links)
- Performance driven distributed scheduling of parallel hybrid computations (Q553361) (← links)
- Comparison of OpenMP 3.0 and other task parallel frameworks on unbalanced task graphs (Q601014) (← links)
- High order finite volume methods on wavelet-adapted grids with local time-stepping on multicore architectures for the simulation of shock-bubble interactions (Q602935) (← links)
- \textit{MRAG-I2D}: multi-resolution adapted grids for remeshed vortex methods on multicore architectures (Q729167) (← links)
- The cache complexity of multithreaded cache oblivious algorithms (Q733717) (← links)
- Performance analysis of work stealing strategies in large scale multi-threaded computing (Q832084) (← links)
- On the efficiency of localized work stealing (Q894447) (← links)
- Random allocation of jobs with weights and precedence (Q1365938) (← links)
- Amortization results for chromatic search trees, with an application to priority queues (Q1384535) (← links)
- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code (Q1621690) (← links)
- A dynamic-sized nonblocking work stealing deque (Q1953649) (← links)
- About optimal management of work-stealing deques in two-level memory (Q2046387) (← links)
- Open problems in queueing theory inspired by datacenter computing (Q2052428) (← links)
- Scheduling computations with provably low synchronization overheads (Q2124914) (← links)
- A note on the parallel runtime of self-stabilizing graph linearization (Q2254491) (← links)
- The models and methods of optimal control of three work-stealing deques located in a shared memory (Q2304583) (← links)
- An analysis of budgeted parallel search on conditional Galton-Watson trees (Q2309473) (← links)
- Specification and verification of concurrent programs through refinements (Q2351261) (← links)
- Parallel construction of succinct trees (Q2410360) (← links)
- Efficient data race detection for async-finish parallelism (Q2441733) (← links)
- An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling (Q2830621) (← links)
- On scheduling series-parallel DAGs to maximize area (Q2929638) (← links)
- Space profiling for parallel functional programs (Q3021408) (← links)
- Implicitly threaded parallelism in Manticore (Q3021411) (← links)
- Lazy tree splitting (Q3165522) (← links)
- Stochastic Process Creation (Q3182911) (← links)
- (Q4790101) (← links)
- Task-based adaptive multiresolution for time-space multi-scale reaction-diffusion systems on multi-core architectures (Q4967350) (← links)
- (Q5091082) (← links)
- Oracle-guided scheduling for controlling granularity in implicitly parallel languages (Q5371969) (← links)
- Fast and compact planar embeddings (Q5918983) (← links)
- NB{\texttt{malloc}}: Allocating memory in a lock-free manner (Q5961972) (← links)
- SLF: a passive parallelization of subgraph isomorphism (Q6492611) (← links)
- Performance analysis of work stealing strategies in large-scale multithreaded computing (Q6599362) (← links)
- Process-commutative distributed objects: from cryptocurrencies to Byzantine-fault-tolerant CRDTs (Q6614029) (← links)