Evaluating the Impact of Algorithmic Components on Task Graph Scheduling
- 2 January 2026
- book chapter
- Published by Springer Nature
- p. 243-262
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- PISA: An Adversarial Approach to Comparing Task Graph Scheduling Algorithms2025
- Automated generation of scientific workflow generators with WfChefFuture Generation Computer Systems, 2023
- Empowering Agroecosystem Modeling with HTC Scientific Workflows: The Cycles Model Use Case2019
- On benchmarking task scheduling algorithms for heterogeneous computing systemsThe Journal of Supercomputing, 2018
- Towards Tight Lower Bounds for Scheduling Problems2015
- Critical path and area based scheduling of parallel task graphs on heterogeneous platforms2006
- A comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems2003
- Task scheduling algorithms for heterogeneous processors2003
- A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing SystemsJournal of Parallel and Distributed Computing, 2001
- Benchmarking the task graph scheduling algorithms1998