Using a genetic algorithm to tackle the processors configuration problem
Terry Warwick, Edward P. K. Tsang · 1994
Distributed programs on irregular networks can out-perform those on regular networks.This paper reports on preliminary results in using a Genetic Algorithm (GA) strategy to tackle the processor configuration problem (PCP), the optimisation of irregular multiprocessor network configurations.The PCP is an NP-hard problem and requires the use of heuristic techniques to solve it.Results suggest that the proposed GA provides a useful heuristic strategy to tackling the PCP.