An accurate parallel genetic algorithm to schedule tasks on a cluster
Parallel Computing - Special issue: Parallel and nature-inspired computational paradigms and applications
Hi-index | 0.00 |
Recent breakthroughs in the mathematical estimation of parallel genetic algorithm parameters by Cantú-Paz [12] are applied to the NP-complete problem of scheduling multiple tasks on a cluster of computers connected by a shared bus. Experiments reveal that the parallel scheduling algorithm develops very accurate schedules when the parameter guidelines are used.