Pages that link to "Item:Q5946213"
From MaRDI portal
The following pages link to Thread scheduling for multiprogrammed multiprocessors (Q5946213):
Displayed 13 items.
- Upper bounds on number of steals in rooted trees (Q255260) (← links)
- Decentralized list scheduling (Q367649) (← links)
- Space-efficient scheduling of stochastically generated tasks (Q418125) (← links)
- Performance driven distributed scheduling of parallel hybrid computations (Q553361) (← links)
- A dynamic-sized nonblocking work stealing deque (Q1953649) (← links)
- Open problems in queueing theory inspired by datacenter computing (Q2052428) (← links)
- Scheduling computations with provably low synchronization overheads (Q2124914) (← links)
- A mechanized refinement proof of the Chase-Lev deque using a proof system (Q2218426) (← links)
- Specification and verification of concurrent programs through refinements (Q2351261) (← links)
- Built-in coloring for highly-concurrent doubly-linked lists (Q2392250) (← links)
- Verification of Concurrent Programs on Weak Memory Models (Q3179387) (← links)
- Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems (Q5270774) (← links)
- Oracle-guided scheduling for controlling granularity in implicitly parallel languages (Q5371969) (← links)