Skip to main content
SpringerLink
Log in
Book cover

International Conference on Artificial Evolution (Evolution Artificielle)

EA 2001: Artificial Evolution pp 362–373Cite as

Coevolution and Evolving Parallel Cellular Automata-Based Scheduling Algorithms

  • Conference paper
  • First Online:

  • 608 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2310))

Abstract

The paper reports new results on developing parallel algorithms for multiprocessor scheduling with use of cellular automata (CAs). The simpliest case when a multiprocessor system is limited to two processors, but without of any limitations on a size and parameters of parallel programs is considered. An approach called a selected neighborhood is used to design a structure of CAs for a given program graph. Coevolutionary genetic algorithm (GA) to discover rules of parallel CAs, suitable for solving the scheduling problem is proposed. Sequential and parallel scheduling algorithms discovered in the context of CAs— based scheduling system are compared.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. I. Ahmad, Y. Kwok, A parallel approach for multiprocessor scheduling, in Proceedings of the 9th Int. Parallel Processing Symposium, Santa Barbara, CA, 1995

    Google Scholar 

  2. R. Das, M. Mitchell, and J. P. Crutchfield, A genetic algorithm discovers particlebased computation in cellular automata, in Y. Davidor, H.-P. Schwefel, R. Männer (eds.), Parallel Problem Solving from Nature—III, LNCS 866, Springer, 1994

    Google Scholar 

  3. T. Gramb, S. Bornholdt, M. Grob, M. Mitchell, T. Pellizari, Non— Standard Computation, Wiley-VCH, 1998

    Google Scholar 

  4. J. Paredis, Coevolutionary Life-Time Learning, in H.-M. Voigt, W. Ebeling, I. Rechenberg and H.-P. Schwefel (eds.), Parallel Problem Solving from Nature—PPSN IV, LNCS 1141, Springer, 1996, pp. 72–80

    Chapter  Google Scholar 

  5. F. Seredynski and C. Z. Janikow, Designing Cellular Automata-based Scheduling Algorithms, in W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, & R. E. Smith (eds.), GECCO-99: Proc. of the Genetic and Evolutionary Comp. Conf., 1999, Orlando, Florida, USA, Morgan Kaufmann, pp. 587–594

    Google Scholar 

  6. F. Seredynski, Evolving Cellular Automata-Based Algorithms for Multiprocessor Scheduling, in A. Z. Zomaya, F. Ercal, S. Olariu (eds.), Solutions to Parallel and Distrib. Comput. Problems: Lessons from Biol. Sciences, Wiley, 2001, pp. 179–207

    Google Scholar 

  7. F. Seredynski, A. Swiçecicka, Immune-like System Approach to Cellular Automatabased Scheduling, in Proc. of the 4th. Int. Conf. on Parallel Processing and Applied Math., Nałçeczów, Poland, Sept. 9–12, 2001, to appear in LNCS, Springer, 2001

    Google Scholar 

  8. M. Tomassini, M. Sipper, M. Zolla, and M. Perrenoud, Generating high-quality random numbers in parallel by cellular automata, Future Generation Computer Systems 16, 1999, pp. 291–305

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, The University of Podlasie, Sienkiewicza 51, 08-110, Siedlce, Poland

    Franciszek Seredyński

  2. Parallel Computing Research Laboratory Department of Electrical and Electronic Engineering, The University of Western Australia, 6907, Nedlands, Perth, Western Australia, Australia

    Albert Y. Zomaya

Authors
  1. Franciszek Seredyński
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Albert Y. Zomaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Centre de Mathématiques Appliquées, Ecole Polytechnique, 91128, Palaiseau Cedex, France

    Pierre Collet

  2. LIL, Université du Littoral — Côte d’Opale, BP 719, 62228, Calais Cedex, France

    Cyril Fonlupt

  3. LERIA, Université d’Angers, 2 Boulevard Lavoisier, 49045, Angers Cedex 01, France

    Jin-Kao Hao

  4. Projet FRACTALES, INRIA Rocquencourt, Domaine de Voluceau, BP 105, 78153, Le Chesnay Cedex, France

    Evelyne Lutton  & Marc Schoenauer  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-VerlagBerlin Heidelberg

About this paper

Cite this paper

Seredyński, F., Zomaya, A.Y. (2002). Coevolution and Evolving Parallel Cellular Automata-Based Scheduling Algorithms. In: Collet, P., Fonlupt, C., Hao, JK., Lutton, E., Schoenauer, M. (eds) Artificial Evolution. EA 2001. Lecture Notes in Computer Science, vol 2310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46033-0_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-46033-0_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43544-0

  • Online ISBN: 978-3-540-46033-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation