Thread scheduling for multiprogrammed multiprocessors
From MaRDI portal
Publication:5946213
DOI10.1007/s00224-001-0004-zzbMath0978.68020OpenAlexW1965708711MaRDI QIDQ5946213
No author found.
Publication date: 14 October 2001
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-001-0004-z
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)
Related Items
Scheduling computations with provably low synchronization overheads ⋮ Verification of Concurrent Programs on Weak Memory Models ⋮ Built-in coloring for highly-concurrent doubly-linked lists ⋮ Decentralized list scheduling ⋮ Space-efficient scheduling of stochastically generated tasks ⋮ A dynamic-sized nonblocking work stealing deque ⋮ Oracle-guided scheduling for controlling granularity in implicitly parallel languages ⋮ A mechanized refinement proof of the Chase-Lev deque using a proof system ⋮ Performance driven distributed scheduling of parallel hybrid computations ⋮ Open problems in queueing theory inspired by datacenter computing ⋮ Specification and verification of concurrent programs through refinements ⋮ Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems ⋮ Upper bounds on number of steals in rooted trees
