An incremental fitness function for partitioning parallel tasks

摘要

We describe a novel GA approach to partition programs to be executed on a parallel system. Two unique features distinguish this GA from traditional GA programs. First, this GA uses a dynamically incremental fitness function which starts out rewarding for simpler goals, gradually increasing the difficulty of the desired fitness values or goals until a full solution is found. Second, this GA uses a flexible representation style which allows the GA itself more control over both the structure and the value of the evolved solutions.