H. Umeo, Takuya Yamawaki, Naoki Shimizu, Hiroki Uchino
{"title":"Modeling and Simulation of Global Synchronization Processes for Large-Scale-of Two-Dimensional Cellular Arrays","authors":"H. Umeo, Takuya Yamawaki, Naoki Shimizu, Hiroki Uchino","doi":"10.1109/AMS.2007.60","DOIUrl":null,"url":null,"abstract":"In recent years cellular automata (CA) have been establishing increasing interests in the study of modeling and simulating non-linear phenomena occurring in biology, chemistry, ecology, economy, geology, mechanical engineering, medicine, physics, sociology, public traffic, etc. Cellular automata are considered to be a nice model of complex systems in which an infinite one-dimensional array of finite state machines (cells) updates itself in synchronous manner according to a uniform local rule. The firing squad synchronization problem on cellular automata has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed. In the present paper, we propose a completely new optimum-time synchronization algorithm for large-scale-of two-dimensional cellular automata. The algorithm can synchronize any two-dimensional array of size m times n in optimum m + n + max(m, n) - 3 steps. A simulation result is also given","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"First Asia International Conference on Modelling & Simulation (AMS'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AMS.2007.60","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9
Abstract
In recent years cellular automata (CA) have been establishing increasing interests in the study of modeling and simulating non-linear phenomena occurring in biology, chemistry, ecology, economy, geology, mechanical engineering, medicine, physics, sociology, public traffic, etc. Cellular automata are considered to be a nice model of complex systems in which an infinite one-dimensional array of finite state machines (cells) updates itself in synchronous manner according to a uniform local rule. The firing squad synchronization problem on cellular automata has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed. In the present paper, we propose a completely new optimum-time synchronization algorithm for large-scale-of two-dimensional cellular automata. The algorithm can synchronize any two-dimensional array of size m times n in optimum m + n + max(m, n) - 3 steps. A simulation result is also given