Immune-Like System Approach to Cellular Automata-Based Scheduling

  • Authors:
  • Franciszek Seredynski;Anna Swiecicka

  • Affiliations:
  • -;-

  • Venue:
  • PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we report new results concerning using cellular automata (CAs) to perform distributed scheduling tasks of a parallel program in the two processor system. We consider a program graph as a CA with elementary cells interacting locally according to a certain rule. The purpose of the cell's interaction is to find an optimal tasks' allocation starting from any initial tasks' allocation. Searching effective rules is conducted with use of a genetic algorithm (GA). The main aim of this work is to study the possibility of reusing discovered scheduling rules. We propose to use the immune-like system approach to answer this question.