Natural Computing

, Volume 12, Issue 3, pp 339–351 | Cite as

Synchronous cellular automata-based scheduler initialized by heuristic and modeled by a pseudo-linear neighborhood

Article

Abstract

Cellular automata (CA) are able to produce a global behavior from local interactions between their units. They have been applied to the task scheduling problem in multiprocessor systems in a very distinguished way. As this problem is NP-Complete, heuristics and meta-heuristics are usually employed. However, these techniques must always start the scheduling process from scratch for each new parallel application given as input. On the other hand, the main advantage to use CA for scheduling is the discovery of rules while solving one application and their subsequent reuse in other instances. Recently studies related to CA-based scheduling have shown relevant approaches as the use of synchronous updating in CA evolution and good results in multiprocessor systems with two processors. However, some aspects, such as the low performance of CA-based schedulers in architectures with more than two processors and during the reuse of the discovered rules, need to be investigated. This paper presents two new models to improve CA-based scheduling to deal with such aspects. The first proposal refers to the employment of a construction heuristic to initialize CA evolution and the second one is a new neighborhood model able to capture the dependence and relations strength among the tasks in a very simple way. It was named pseudo-linear neighborhood. An extensive experimental evaluation was performed using graphs of parallel programs found in the literature and new ones randomly generated. Experimental analysis showed the combined application of both techniques makes the search for CA transition rules during learning stage more robust and leads to a significant gain when considering the reuse of them on real-world conditions.

Keywords

Cellular automata Multiprocessor task scheduling Evolutionary search Synchronous updating Knowledge extraction Pseudo-linear neighborhood 

References

  1. Carneiro MG, Oliveira GMB (2011) Cellular automata-based model with synchronous updating for task static scheduling. In: Proceedings of 17th International workshop on cellular automata and discrete complex system, p 263–272Google Scholar
  2. Carneiro MG, Oliveira GM (2012a) SCAS-IS: Knowledge extraction and reuse in multiprocessor task scheduling based on cellular automata. In: Proceedings of Brazilian symposium on neural networks (SBRN) p 142–147Google Scholar
  3. Carneiro MG, Oliveira GMB (2012b) SCAS-H: Synchronous cellular automata-based scheduler with initialization heuristic to task scheduling. In: Proceedings of 18th International workshop on cellular automata and discrete complex system, p 1–10Google Scholar
  4. Dennunzio A. (2012) From one-dimensional to two-dimensional cellular automata. Fundam Inform 115(1):87–105MathSciNetMATHGoogle Scholar
  5. Dennunzio A, Formenti E, Manzoni L. (2012a) Computing issues of asynchronous CA. Fundam Inform 120(2):165–180MathSciNetMATHGoogle Scholar
  6. Dennunzio A, Formenti E, Manzoni L, Mauri G (2012b) m-asynchronous cellular automata. In: Sirakoulis G, Bandini S (eds.) Cellular automata, Lecture Notes in Computer Science, vol. 7495. Springer, Berlin, p 653–662Google Scholar
  7. Dennunzio A, Formenti E, Manzoni L, Mauri G (2013) m-asynchronous cellular automata: from fairness to quasi-fairness. Nat Comput (to appear)Google Scholar
  8. Farina F, Dennunzio A (2008) A predator-prey cellular automaton with parasitic interactions and environmental effects. Fundam Inform 83(4):337–353MathSciNetMATHGoogle Scholar
  9. Garey MR, Johnson DS (1979) Computers and intractability. A guide to the theory of NP Completeness. Freeman and Company, New YorkGoogle Scholar
  10. Kwok YK, Ahmad I (1999) Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Comput Surv 31(4):406–471CrossRefGoogle Scholar
  11. Oliveira GM, Vidica PM (2012) A coevolutionary approach to cellular automata-based task scheduling. In: Sirakoulis GC, Bandini S (eds.) Cellular Automata, Lecture Notes in Computer Science, vol. 7495. Springer, Berlin, p 111–120Google Scholar
  12. Pinedo ML (2008) Scheduling: theory, algorithms, and systems, 3rd edn. Springer, BerlinGoogle Scholar
  13. Russell S, Norvig P (2010) Artificial intelligence: a modern approach, 3rd edn. Prentice Hall series in artificial intelligence. Prentice Hall, EnglewoodGoogle Scholar
  14. Sarkar P (2000) A brief history of cellular automata. ACM Comput Surv 32(1):80–107CrossRefGoogle Scholar
  15. Seredynski F, Zomaya AY (2002) Sequential and parallel cellular automata-based scheduling algorithms.IEEE Trans Parallel Distrib Syst 13(10):1009–1022CrossRefGoogle Scholar
  16. Suter F (2011) DAG generation program: http://www.loria.fr/~suter/dags.html. Accessed 17 May 2013
  17. Swiecicka A, Seredynski F, Zomaya AY (2006) Multiprocessor scheduling and rescheduling with use of cellular automata and artificial immune system support. IEEE Trans Parallel Distrib Syst 17(3):253–262CrossRefGoogle Scholar
  18. Vidica PM, Oliveira GMB (2006) Cellular automata-based scheduling: a new approach to improve generalization ability of evolved rules. In: Proceedings of Brazilian Symposium on Neural Networks (SBRN). p 18–23Google Scholar
  19. Weinert WR, Benitez C, Lopes HS, Lima CRE (2007) Simulation of the dynamic behavior of one-dimensional cellular automata using reconfigurable computing. In: Proceedings of the 3rd international conference on reconfigurable computing: architectures, tools and applications, ARC’07. Springer, Berlin, p 385–390Google Scholar
  20. Wolfram S (1983) Cellular automata. Los Alamos Science, Los AlamosGoogle Scholar
  21. Wolfram S (1984) Universality and complexity in cellular automata. Phys D 10:1–35MathSciNetCrossRefGoogle Scholar
  22. Wolfram S (1988) Complex systems theory. In: Emerging syntheses in science: Proceedings of the Founding Workshops of the Santa Fe Institute. Addison-Wesley, Reading p 183–189Google Scholar
  23. Wolfram S (1994) Cellular automata and complexity. Addison-Wesley, ReadingMATHGoogle Scholar
  24. Wolfram S (2002) A new kind of science. Wolfram Media, Inc., Champaign, ILMATHGoogle Scholar
  25. Wolfran S (1986) Cryptography with cellular automata. Advances in Cryptology: Crypto ’85 Proceedings 218:429–432CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2013

Authors and Affiliations

  1. 1.Instituto de Ciências Matemáticas e de ComputaçãoUniversidade de São PauloSão CarlosBrazil
  2. 2.Faculdade de ComputaçãoUniversidade Federal de UberlândiaUberlândiaBrazil

Personalised recommendations