Benchmarking and comparison of the task graph scheduling algorithms

DOI10.1006/JPDC.1999.1578zbMath0958.68020OpenAlexW1973531467MaRDI QIDQ1970209

Yu-Kwong Kwok, Ishfaq 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

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

Related Items (12)

On using priced timed automata to achieve optimal scheduling ⋮ 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 ⋮ ECP: a novel clustering-based technique to schedule precedence constrained tasks on multiprocessor computing systems ⋮ 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 ⋮ Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems ⋮ A new heuristic for task scheduling in heterogeneous computing environment

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