Provably efficient scheduling for languages with fine-grained parallelism

DOI10.1145/301970.301974zbMath1065.68664OpenAlexW2060847221MaRDI QIDQ3158538

Yossi Matias, Phillip B. Gibbons, Guy E. Blelloch

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/301970.301974

Mathematics Subject Classification ID

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

Related Items (3)

Space profiling for parallel functional programs ⋮ The cache complexity of multithreaded cache oblivious algorithms ⋮ Open problems in queueing theory inspired by datacenter computing

This page was built for publication: Provably efficient scheduling for languages with fine-grained parallelism