A standard task graph set for fair evaluation of multiprocessor scheduling algorithms
From MaRDI portal
Publication:1850711
DOI10.1002/jos.116zbMath1014.90044OpenAlexW2034919502MaRDI QIDQ1850711
Takao Tobita, Hironori Kasahara
Publication date: 17 December 2002
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jos.116
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (8)
Static scheduling of directed acyclic data flow graphs onto multiprocessors using particle swarm optimization ⋮ Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules ⋮ Monte Carlo tree search for priced timed automata ⋮ A Comparison of Random Task Graph Generation Methods for Scheduling Problems ⋮ On the efficiency of several VM provisioning strategies for workflows with multi-threaded tasks on clouds ⋮ Bee colony optimization for scheduling independent tasks to identical processors ⋮ Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems ⋮ Classification of Benchmarks for the Evaluation of Grid Resource Planning Algorithms
Cites Work
- A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints
- A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
- List scheduling with and without communication delays
- Optimal scheduling for two-processor systems
- Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
- A comparison of list schedules for parallel processing systems
- Optimal Scheduling Strategies in a Multiprocessor System
This page was built for publication: A standard task graph set for fair evaluation of multiprocessor scheduling algorithms
