Cellular Automata-Based Scheduling: A New Approach to Improve Generalization Ability of Evolved Rules

摘要

This paper presents a cellular automata-based algorithm designed to schedule tasks for parallel processors. In the learning phase, a genetic algorithm is used to discover cellular automata (CA) rules able to solve an instance of a multiprocessor schedulin