TY - JOUR
T1 - Designing Cellular Automata-Based Scheduling Algorithms
AU - Janikow, Cezary
AU - Seredyński, Franciszek
N1 - We're upgrading the ACM DL, and would like your input. Please sign up to review new features, functionality and page designs.
PY - 1999/7/13
Y1 - 1999/7/13
N2 - In this paper, we present a systematic approach to designing cellular automata-based algorithms for multiprocessor scheduling. We consider a simple case of two processors. However, we do not restrict parallel programs. We show how to design local neighborhoods and corresponding cellular automata (CA) for a given program graph. We also show how to discover, by genetic algorithm (GA), rules of CA-suitable for solving a given scheduling problem. We evaluate the discovered rules in terms of applicability to cope with different instances of the scheduling problem.
AB - In this paper, we present a systematic approach to designing cellular automata-based algorithms for multiprocessor scheduling. We consider a simple case of two processors. However, we do not restrict parallel programs. We show how to design local neighborhoods and corresponding cellular automata (CA) for a given program graph. We also show how to discover, by genetic algorithm (GA), rules of CA-suitable for solving a given scheduling problem. We evaluate the discovered rules in terms of applicability to cope with different instances of the scheduling problem.
UR - https://dl.acm.org/citation.cfm?id=2933980
M3 - Article
VL - 1
JO - Proceedings of the 1st Annual Conference on Genetic and Evolutionary Computation
JF - Proceedings of the 1st Annual Conference on Genetic and Evolutionary Computation
ER -