关于行刑队同步问题的同步步骤的说明

2010 Third International Joint Conference on Computational Science and Optimization Pub Date : 2010-05-28 DOI:10.1109/CSO.2010.124

Akira Nomura, Jean-Baptiste Yunès, H. Umeo

{"title":"关于行刑队同步问题的同步步骤的说明","authors":"Akira Nomura, Jean-Baptiste Yunès, H. Umeo","doi":"10.1109/CSO.2010.124","DOIUrl":null,"url":null,"abstract":"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 this paper, we propose two synchronization algorithms and their implementations, each having O(n^2) and O(2^n) synchronization steps for n cells, respectively.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Note on Synchronization Steps in Firing Squad Synchronization Problem\",\"authors\":\"Akira Nomura, Jean-Baptiste Yunès, H. Umeo\",\"doi\":\"10.1109/CSO.2010.124\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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 this paper, we propose two synchronization algorithms and their implementations, each having O(n^2) and O(2^n) synchronization steps for n cells, respectively.\",\"PeriodicalId\":427481,\"journal\":{\"name\":\"2010 Third International Joint Conference on Computational Science and Optimization\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Third International Joint Conference on Computational Science and Optimization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSO.2010.124\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Third International Joint Conference on Computational Science and Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSO.2010.124","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

元胞自动机上的行刑队同步问题已经得到了四十多年的广泛研究，并提出了丰富多样的同步算法。在本文中，我们提出了两种同步算法及其实现，每种算法对n个单元分别具有O(n^2)和O(2^n)个同步步骤。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Note on Synchronization Steps in Firing Squad Synchronization Problem

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 this paper, we propose two synchronization algorithms and their implementations, each having O(n^2) and O(2^n) synchronization steps for n cells, respectively.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2010 Third International Joint Conference on Computational Science and Optimization

自引率

0.00%

发文量