A comparison of the static task graph scheduling algorithms
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2042272
- A standard task graph set for fair evaluation of multiprocessor scheduling algorithms
- scientific article; zbMATH DE number 2099400
- Benchmarking and comparison of the task graph scheduling algorithms
- Task matching and scheduling for smart homogeneous multiprocessor systems
Cited in
(11)- A concurrent dynamic task graph
- A standard task graph set for fair evaluation of multiprocessor scheduling algorithms
- Benchmarking and comparison of the task graph scheduling algorithms
- Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules
- scientific article; zbMATH DE number 5630154 (Why is no real title available?)
- scientific article; zbMATH DE number 2042272 (Why is no real title available?)
- scientific article; zbMATH DE number 2099400 (Why is no real title available?)
- Task matching and scheduling for smart homogeneous multiprocessor systems
- Computational Science – ICCS 2005
- scientific article; zbMATH DE number 2247684 (Why is no real title available?)
- On task scheduling accuracy: Evaluation methodology and results
This page was built for publication: A comparison of the static task graph scheduling algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768143)
