Pages that link to "Item:Q2489280"
From MaRDI portal
The following pages link to Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems (Q2489280):
Displaying 12 items.
- Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules (Q345532) (← links)
- Bee colony optimization for scheduling independent tasks to identical processors (Q519106) (← links)
- Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays (Q1260649) (← links)
- A heuristic for scheduling task graphs with communication delays onto multiprocessors (Q1350013) (← links)
- Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays (Q1631647) (← links)
- Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay (Q1652451) (← links)
- A standard task graph set for fair evaluation of multiprocessor scheduling algorithms (Q1850711) (← links)
- ECP: a novel clustering-based technique to schedule precedence constrained tasks on multiprocessor computing systems (Q2218451) (← links)
- A novel intelligent method for task scheduling in multiprocessor systems using genetic algorithm (Q2455445) (← links)
- MPI parallelization of variable neighborhood search (Q2840781) (← links)
- Parallelization strategies for bee colony optimization based on message passing communication protocol (Q2868923) (← links)
- New MIP model for multiprocessor scheduling problem with communication delays (Q5915741) (← links)
