Provably efficient scheduling for languages with fine-grained parallelism

DOI10.1145/301970.301974MaRDI QIDQ3158538zbMATH OpenOpenAlexFDO

Authors Guy E. Blelloch, Phillip B. Gibbons, Y. Matias

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

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

Recommendations

• scientific article; zbMATH DE number 2089191
• Efficient scheduling of strict multithreaded computations
• scientific article; zbMATH DE number 1110837
• Oracle-guided scheduling for controlling granularity in implicitly parallel languages
• A robust compile time method for scheduling task parallelism on distributed memory machines
• Efficient execution of nondeterministic parallel programs on asynchronous systems

Cited in

(8)

• Oracle-guided scheduling for controlling granularity in implicitly parallel languages
• A provable time and space efficient implementation of NESL
• The cache complexity of multithreaded cache oblivious algorithms
• Open problems in queueing theory inspired by datacenter computing
• Algorithm Theory - SWAT 2004
• Space profiling for parallel functional programs
• Memory requirements for parallel programs
• Hierarchical memory management for parallel programs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3158538)