Abstract
This paper compares two strategies to evolve cellular automata (CA) rules avoiding an undesirable dynamical behavior. Here long-cycle rules are considered inappropriate, specially the chaotic rules. The first approach employs a forecast parameter to guide a genetic algorithm (GA) toward rules out of the region where long-cycle rules are most probably to happen. The second one is proposed here and directly evaluates the lattice convergence in the spatio-temporal evolution to classify the cycle as long (or not). The problem taking in account here is the task scheduling for multiprocessor architectures. CA-based schedulers use two stages: (a) learning, where a GA is used to find rules to schedule an specific program graph and (b) operation, where the evolved rules are used to schedule new instances. The experimental results show that both approaches are able to find more CA rules with adequate dynamical behavior in both stages. Moreover, a reasonable improvement of makespan in the operation phase is obtained by controlling the CA dynamics.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Adam, T.L., Chandy, K.M., Dickson, J.R.: A comparison of list schedules for parallel processing systems. Commun. ACM 17, 685–690 (1974)
Binder, P.M.: Parametric ordering of complex systems. Phys. Rev. E. 49(3), 2023 (1994)
Carneiro, M.G., Oliveira, G.M.B.: Cellular automata-based model with synchronous updating for task static scheduling. In: Proceedings of Automata, pp. 263–272 (2011)
Carneiro, M.G., Oliveira, G.M.B.: Synchronous cellular automata-based scheduler initialized by heuristic and modeled by a pseudo-linear neighborhood. Nat. Comput. 12(3), 339–351 (2013)
Li, Wentian, Packard, N.: The structure of elementary cellular automata rule space. Complex Syst. 4, 281–297 (1990)
Mitchell, M.: Computation in cellular automata: a selected review. In: Non-standard Computation, pp. 385–390 (1996)
Oliveira, G.M.B., Vidica, P.M.: A coevolutionary approach to cellular automata-based task scheduling. In: Sirakoulis, G.C.H., Bandini, S. (eds.) ACRI 2012. LNCS, vol. 7495, pp. 111–120. Springer, Heidelberg (2012)
Seredynski, F., Zomaya, A.: Sequential and parallel cellular automata-based scheduling algorithms. IEEE Trans. Parallel Distrib. Syst. 13(10), 1009–1023 (2002)
Swiecicka, A., Seredynski, F., Zomaya, A.: Multiprocessor scheduling and rescheduling with use of cellular automata and artificial immune system support. IEEE Trans. Parallel Distrib. Syst. 17(3), 253–262 (2006)
Carvalho, T.I., Oliveira, G.M.B.: Searching for non-regular neighborhood cellular automata rules applied to scheduling task and guided by a forecast dynamical behavior parameter. In: Proceedings of ECAL, pp. 538–545 (2015)
Boutekkouk, F.: A cellular automaton based approach for real time embedded systems scheduling problem resolution. In: Silhavy, R., Senkerik, R., Oplatkova, Z.K., Prokopova, Z., Silhavy, P. (eds.) Artificial Intelligence Perspectives and Applications. AISC, vol. 347, pp. 13–22. Springer, Heidelberg (2015)
Kucharska, E., et al.: Cellular Automata approach for parallel machine scheduling problem. Simulation 92(2), 165–178 (2016). doi:10.1177/0037549715625120
Oliveira, G.M.B., de Oliveira, P.P.B., Omar, N.: Evolving solutions of the density classification task in 1D cellular automata, guided by parameters that estimate their dynamic behavior. Artif. Life 7, 428–436 (2000)
Acknowledgments
Authors are grateful to Fapemig, CNPq and CAPES
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Carvalho, T.I., Carneiro, M.G., Oliveira, G.M.B. (2016). A Comparison of a Proposed Dynamical Direct Verification of Lattice’s Configuration and a Forecast Behavior Parameter on a Cellular Automata Model to Task Scheduling. In: El Yacoubi, S., Wąs, J., Bandini, S. (eds) Cellular Automata. ACRI 2016. Lecture Notes in Computer Science(), vol 9863. Springer, Cham. https://doi.org/10.1007/978-3-319-44365-2_26
Download citation
DOI: https://doi.org/10.1007/978-3-319-44365-2_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-44364-5
Online ISBN: 978-3-319-44365-2
eBook Packages: Computer ScienceComputer Science (R0)