Modeling and Simulation of Global Synchronization Processes for Large-Scale-of Two-Dimensional Cellular Arrays

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
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
大规模二维蜂窝阵列全局同步过程建模与仿真
近年来,元胞自动机(CA)在生物学、化学、生态学、经济学、地质学、机械工程、医学、物理学、社会学、公共交通等领域对非线性现象的建模和模拟的研究日益引起人们的兴趣。元胞自动机被认为是一种很好的复杂系统模型,在这种模型中,无限的一维有限状态机(细胞)按照统一的局部规则以同步的方式自我更新。元胞自动机上的行刑队同步问题已经得到了四十多年的广泛研究,并提出了丰富多样的同步算法。本文提出了一种全新的大规模二维元胞自动机的最优时间同步算法。该算法可以同步任何大小为m * n的二维数组,最优速度为m + n + max(m, n) - 3步。并给出了仿真结果
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Practical Protocol Steganography: Hiding Data in IP Header Energy Efficient Expanding Ring Search On Verification of Communicating Finite State Machines Using Residual Languages High-Speed Real-Time Simulation Modified Line Search Method for Global Optimization
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1