Pages that link to "Item:Q1850711"
From MaRDI portal
The following pages link to A standard task graph set for fair evaluation of multiprocessor scheduling algorithms (Q1850711):
Displaying 7 items.
- Static scheduling of directed acyclic data flow graphs onto multiprocessors using particle swarm optimization (Q336513) (← links)
- Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules (Q345532) (← links)
- On the efficiency of several VM provisioning strategies for workflows with multi-threaded tasks on clouds (Q488877) (← links)
- Bee colony optimization for scheduling independent tasks to identical processors (Q519106) (← links)
- Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems (Q2489280) (← links)
- A Comparison of Random Task Graph Generation Methods for Scheduling Problems (Q3297563) (← links)
- Classification of Benchmarks for the Evaluation of Grid Resource Planning Algorithms (Q3612879) (← links)
