Applying Cilk in Provably Efficient Task Scheduling

DOI10.1093/COMJNL/42.8.699MaRDI QIDQ4950864zbMATH OpenOpenAlexFDO

Authors

Publication date 1 February 2001

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/a6d891099acfc73ac4cd5f66863d37213881d39c

zbMATH Keywords

Cilkmultithreaded parallel programmingtask scheduling

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• Online scheduling of parallel programs on heterogeneous systems with applications to Cilk
• A two-pass scheduling algorithm for parallel programs
• Optimal parallel processing of random task graphs
• scientific article; zbMATH DE number 2080263
• General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time

This page was built for publication: Applying Cilk in Provably Efficient Task Scheduling

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