Benchmarking and comparison of the task graph scheduling algorithms

DOI10.1006/JPDC.1999.1578MaRDI QIDQ1970209zbMATH OpenOpenAlexFDO

Authors Yu-Kwong Kwok, Ishfaq Shah Ahmad

Publication date 19 March 2000

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

scheduling scalability

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) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 2099400
• scientific article; zbMATH DE number 1859739
• A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
• scientific article; zbMATH DE number 2042272
• A comparison of the static task graph scheduling algorithms

Cited in

(23)

• A new heuristic for task scheduling in heterogeneous computing environment
• A standard task graph set for fair evaluation of multiprocessor scheduling algorithms
• ECP: a novel clustering-based technique to schedule precedence constrained tasks on multiprocessor computing systems
• Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems
• A comparison of the static task graph scheduling algorithms
• Scalable heuristic algorithms for the parallel execution of data flow acyclic digraphs
• A comparison of random task graph generation methods for scheduling problems
• Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules
• Task scheduling algorithm using minimized duplications in homogeneous systems
• Scheduling in a dynamic heterogeneous distributed system using estimation error
• scientific article; zbMATH DE number 1859739 (Why is no real title available?)
• scientific article; zbMATH DE number 1863252 (Why is no real title available?)
• scientific article; zbMATH DE number 1894382 (Why is no real title available?)
• scientific article; zbMATH DE number 2099400 (Why is no real title available?)
• scientific article; zbMATH DE number 2118224 (Why is no real title available?)
• scientific article; zbMATH DE number 2247684 (Why is no real title available?)
• Genetic algorithms for task scheduling problem
• Slack allocation algorithm for parallel machines
• Extending IC-scheduling via the sweep algorithm
• List scheduling with duplication for heterogeneous computing systems
• Multi-heuristic dynamic task allocation using genetic algorithms in a heterogeneous distributed system
• On task scheduling accuracy: Evaluation methodology and results
• On using priced timed automata to achieve optimal scheduling

This page was built for publication: Benchmarking and comparison of the task graph scheduling algorithms

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