Pages that link to "Item:Q2456658"
From MaRDI portal
The following pages link to A comparison of multiprocessor task scheduling algorithms with communication costs (Q2456658):
Displaying 8 items.
- Static scheduling of directed acyclic data flow graphs onto multiprocessors using particle swarm optimization (Q336513) (← links)
- Reducing the solution space of optimal task scheduling (Q336912) (← links)
- Hardware design of a new genetic based disk scheduling method (Q617747) (← links)
- A bipartite genetic algorithm for multi-processor task scheduling (Q735353) (← links)
- Comparison of multi-objective evolutionary approaches for task scheduling in distributed computing systems (Q746435) (← links)
- (Q4737347) (← links)
- A Memetic Model Based on Fixed Structure Learning Automata for Solving NP-Hard Problems (Q5861760) (← links)
- New MIP model for multiprocessor scheduling problem with communication delays (Q5915741) (← links)