In this paper we report new results concerning developing parallel multiprocessor scheduling algorithms working in cellular automata (CAs) -based scheduler. We consider the simplest case when a multiprocessor system is limited to two processors, but we not imply any limitations on a size and parameters of parallel programs. We use an approach called a selected neighborhood to design a nonlinear structure of CAs for a given program graph. We propose to use coevolutionary genetic algorithm (GA) to discover rules of parallel CAs, suitable for solving the scheduling problem. We compare sequential and parallel scheduling algorithms discovered in the context of CAs -based scheduling system.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.