Abstract
Cellular Automata (CA) have been proposed for task scheduling in multiprocessor architectures. CA-based models aim to be fast and decentralized schedulers. Previous models employ an off-line learning stage in which an evolutionary method is used to discover cellular automata rules able to solve an instance of a task scheduling. A central point of CA-based scheduling is the reuse of transition rules learned for one specific program graph in the schedule of new instances. However, our investigation about previous models showed that evolved rules do not actually have such generalization ability. A new approach is presented here named multigraph coevolutionary learning, in which a population of program graphs is evolved simultaneously with rules population leading to more generalized transition rules. Results obtained have shown the evolution of rules with better generalization abilitywhen they are compared with those obtained using previous approaches.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley (1989)
Hillis, D.: Co-evolving parasites improves simulated evolution as an optimization procedure. Physica D 42(1-3), 228–234 (1991)
Wolfram, S.: Universality and complexity in cellular automata. Physica D 10, 1–35 (1984)
Seredynski, F.: Evolving cellular automata-based algorithms for multiprocessor scheduling. In: Zomaya, A., Ercal, F. (eds.) Solutions to Parallel and Distributed Computing Problems: Lessons from Biological Sciences, pp. 179–207 (2001)
Seredynski, F., Zomaya, A.Y.: Sequential and parallel cellular automata-based scheduling algorithms. IEEE Trans. Parallel Distrib. Syst. 13(10), 1009–1023 (2002)
Swiecicka, A., Seredynski, F., Zomaya, A.Y.: Multiprocessor scheduling and rescheduling with use of cellular automata and artificial immune system support. IEEE Trans. Parallel Distrib. Syst. 17(3), 253–262 (2006)
Swiecicka, A., Seredynski, F.: Cellular automata approach to scheduling problem. In: Proc. of the International Conference on Parallel Computing in Electrical Engineering, PARELEC 2000, Washington, DC, USA, p. 29 (2000)
Seredynski, F., Swiecicka, A., Zomaya, A.Y.: Discovery of parallel scheduling algorithms in cellular automata-based systems. In: IPDPS, p. 132 (2001)
Paredis, J.: Coevolutionary computation. Artificial Life Journal 2(3) (1996)
Vidica, P.M., Oliveira, G.M.B.: Cellular Automata-Based Scheduling: A New Approach to Improve Generalization Ability of Evolved Rules. In: Proc. of Brazilian Symposium on Neural Networks, pp. 18–23 (2006)
Kwok, Y.K., Ahmad, I.: Benchmarking and comparison of the task graph scheduling algorithms. Journal of Parallel and Distributed Computing 59(3), 381–422 (1999)
Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems, 3rd edn. Springer Science (2008)
Carneiro, M.G., Oliveira, G.M.B.: Cellular automata based model with synchronous updating for task static scheduling. In: Proc. of 17th International Workshop on Cellular Automata and Discrete Complex System, AUTOMATA 2011, pp. 263–272 (2011)
Carneiro, M.G., Oliveira, G.M.B.: SCAS-IS: Knowledge Extraction and Reuse in Multiprocessor Task Scheduling based on Cellular Automata. Accepted for Brazilian Symposium on Neural Networks (2012, preprint)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oliveira, G.M.B., Vidica, P.M. (2012). A Coevolutionary Approach to Cellular Automata-Based Task Scheduling. In: Sirakoulis, G.C., Bandini, S. (eds) Cellular Automata. ACRI 2012. Lecture Notes in Computer Science, vol 7495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33350-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-33350-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33349-1
Online ISBN: 978-3-642-33350-7
eBook Packages: Computer ScienceComputer Science (R0)