Using a genetic algorithm to tackle the processors configuration problem
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Preliminary results suggest that the proposed GA provides a useful heuristic strategy to tackling the PCP, the optimisation of irregular multiprocessor network configurations.
Abstract
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.