Efficient scheduling of strict multithreaded computations

DOI10.1007/S002240010002MaRDI QIDQ1579050zbMATH OpenOpenAlexFDO

Authors Panagiota Fatourou, P. G. Spirakis

Publication date 4 September 2000

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002240010002

zbMATH Keywords

scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• Scheduling multithreaded computations by work stealing
• Space-Efficient Scheduling of Multithreaded Computations
• Scheduling algorithms for strict multithreaded computations
• Thread scheduling for multiprogrammed multiprocessors

Cited in

(11)

• Scheduling algorithms for strict multithreaded computations
• Scheduling threads for low space requirement and good locality
• Non-strict execution in parallel and distributed computing
• Scheduling computations with provably low synchronization overheads
• Relaxed schedulers can efficiently parallelize iterative algorithms
• Thread scheduling for multiprogrammed multiprocessors
• On the efficiency of localized work stealing
• Scheduling multithreaded computations by work stealing
• scientific article; zbMATH DE number 1543369 (Why is no real title available?)
• A glimpse at Paul G. Spirakis
• Provably efficient scheduling for languages with fine-grained parallelism

This page was built for publication: Efficient scheduling of strict multithreaded computations

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