A new reconstruction and the first implementation of Goto’s FSSP algorithm
The firing squad synchronization problem (FSSP) on cellular automata has been studied extensively for more than fifty years, and a rich variety of synchronization algorithms has been proposed. Goto’s FSSP algorithm (Goto 1962) has been known as the first minimum-time FSSP algorithm, however the pape...
Saved in:
Published in | Applied mathematics and computation Vol. 318; pp. 92 - 108 |
---|---|
Main Authors | , , , , |
Format | Journal Article |
Language | English |
Published |
Elsevier Inc
01.02.2018
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | The firing squad synchronization problem (FSSP) on cellular automata has been studied extensively for more than fifty years, and a rich variety of synchronization algorithms has been proposed. Goto’s FSSP algorithm (Goto 1962) has been known as the first minimum-time FSSP algorithm, however the paper itself had been a completely unknown one in the research community of cellular automata for a long time due to its hard accessibility. In the present paper, we reconstruct the Goto’s FSSP algorithm and present the first small-state implementation. The implementation is realized on a cellular automaton having 165-state and 4378 state-transition rules and the realization is far smaller than Goto (1962) imagined, where he thought that it would require many thousands of thousands states. It is shown that the reconstructed algorithm uses a quite different synchronization mechanism in comparison with the designs employed in Waksman (1966), Balzer (1967), Gerken (1987) and Mazoyer (1987). We show that the algorithm has Θ(nlog n) minimum-state-change complexity for synchronizing n cells. The algorithm is optimum not only in time but also in state-change complexities. We show that the reconstructed algorithm can be generalized as to the initial general’s position and its implementation on a cellular automaton with 434 internal states and 13,328 state-transition rules is also given. The general purpose of this investigation is to achieve more insights into the structure of the classical minimum-time FSSP solutions and such insights would be helpful in the design of new FSSP algorithms. |
---|---|
AbstractList | The firing squad synchronization problem (FSSP) on cellular automata has been studied extensively for more than fifty years, and a rich variety of synchronization algorithms has been proposed. Goto’s FSSP algorithm (Goto 1962) has been known as the first minimum-time FSSP algorithm, however the paper itself had been a completely unknown one in the research community of cellular automata for a long time due to its hard accessibility. In the present paper, we reconstruct the Goto’s FSSP algorithm and present the first small-state implementation. The implementation is realized on a cellular automaton having 165-state and 4378 state-transition rules and the realization is far smaller than Goto (1962) imagined, where he thought that it would require many thousands of thousands states. It is shown that the reconstructed algorithm uses a quite different synchronization mechanism in comparison with the designs employed in Waksman (1966), Balzer (1967), Gerken (1987) and Mazoyer (1987). We show that the algorithm has Θ(nlog n) minimum-state-change complexity for synchronizing n cells. The algorithm is optimum not only in time but also in state-change complexities. We show that the reconstructed algorithm can be generalized as to the initial general’s position and its implementation on a cellular automaton with 434 internal states and 13,328 state-transition rules is also given. The general purpose of this investigation is to achieve more insights into the structure of the classical minimum-time FSSP solutions and such insights would be helpful in the design of new FSSP algorithms. |
Author | Umeo, Hiroshi Imai, Keisuke Hirota, Mitsuki Nozaki, Youhei Sogabe, Takashi |
Author_xml | – sequence: 1 givenname: Hiroshi surname: Umeo fullname: Umeo, Hiroshi email: umeo@cyt.osakac.ac.jp – sequence: 2 givenname: Mitsuki surname: Hirota fullname: Hirota, Mitsuki – sequence: 3 givenname: Youhei surname: Nozaki fullname: Nozaki, Youhei – sequence: 4 givenname: Keisuke surname: Imai fullname: Imai, Keisuke – sequence: 5 givenname: Takashi surname: Sogabe fullname: Sogabe, Takashi |
BookMark | eNp9kMtKAzEYhYNUsK0-gLu8wIzJ5NbBVSm2CgWF6jpkcrEpnaQkUXHna_h6PolTde3qLA7fz3--CRiFGCwAlxjVGGF-tatVr-sGYVEjViPMTsAYzwSpGKftCIwRanlFECJnYJLzDiEkOKZjsJ7DYN9gsjqGXNKLLj4GqIKBZWuh8ykX6PvD3vY2FPVTRgdXscSvj88Ml5vNA1T755h82fbn4NSpfbYXfzkFT8ubx8Vttb5f3S3m60o3rSgVdYQ7RxSnghqlGt5qpxuHDXMtYY2gjBLT8a479hR3AhPqhMGNYR0jaEamAP_e1SnmnKyTh-R7ld4lRvKoQ-7koEMedUjE5KBjYK5_GTs89uptkll7G7Q1fhhfpIn-H_obr2Fqxw |
CitedBy_id | crossref_primary_10_1007_s11047_017_9625_2 |
Cites_doi | 10.1016/S0019-9958(66)90110-0 10.1016/S0019-9958(67)90032-0 10.1016/S0019-9958(68)90309-4 10.1016/0304-3975(87)90124-1 10.1142/S0129626409000237 10.1007/BF02084165 |
ContentType | Journal Article |
Copyright | 2017 Elsevier Inc. |
Copyright_xml | – notice: 2017 Elsevier Inc. |
DBID | AAYXX CITATION |
DOI | 10.1016/j.amc.2017.05.015 |
DatabaseName | CrossRef |
DatabaseTitle | CrossRef |
DatabaseTitleList | |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Mathematics |
EISSN | 1873-5649 |
EndPage | 108 |
ExternalDocumentID | 10_1016_j_amc_2017_05_015 S009630031730303X |
GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 23M 4.4 457 4G. 5GY 6J9 7-5 71M 8P~ 9JN AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAXUO ABAOU ABFNM ABFRF ABJNI ABMAC ABYKQ ACAZW ACDAQ ACGFO ACGFS ACRLP ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ ARUGR AXJTR BKOJK BLXMC CS3 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA IHE J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 RIG RNS ROL RPZ RXW SBC SDF SDG SES SME SPC SPCBC SSW SSZ T5K TN5 WH7 X6Y XPP ZMT ~02 ~G- 5VS AAQFI AAQXK AAXKI AAYXX ABEFU ABXDB ADIYS ADMUD AFFNX AI. AKRWK ASPBG AVWKF AZFZN CITATION FEDTE FGOYB G-2 HLZ HMJ HVGLF HZ~ R2- SEW TAE VH1 VOH WUQ |
ID | FETCH-LOGICAL-c297t-4f36ff3a6474daa269cfc2f1d5f935274543db6bb474d41b7134f7d12d5b53083 |
IEDL.DBID | .~1 |
ISSN | 0096-3003 |
IngestDate | Thu Sep 12 19:35:35 EDT 2024 Fri Feb 23 02:31:58 EST 2024 |
IsPeerReviewed | true |
IsScholarly | true |
Keywords | Cellular automaton Firing squad synchronization problem FSSP |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c297t-4f36ff3a6474daa269cfc2f1d5f935274543db6bb474d41b7134f7d12d5b53083 |
PageCount | 17 |
ParticipantIDs | crossref_primary_10_1016_j_amc_2017_05_015 elsevier_sciencedirect_doi_10_1016_j_amc_2017_05_015 |
PublicationCentury | 2000 |
PublicationDate | 2018-02-01 2018-02-00 |
PublicationDateYYYYMMDD | 2018-02-01 |
PublicationDate_xml | – month: 02 year: 2018 text: 2018-02-01 day: 01 |
PublicationDecade | 2010 |
PublicationTitle | Applied mathematics and computation |
PublicationYear | 2018 |
Publisher | Elsevier Inc |
Publisher_xml | – name: Elsevier Inc |
References | Gerken (bib0002) 1987 Umeo (bib0011) 2009; vol. 4 Umeo, Kamikawa, Yunès (bib0013) 2009; 19 Goto (bib0003) 1962; vol. 298 Umeo (bib0010) 1996; vol. 65 Umeo, Kamikawa, Nishioka, Akiguchi (bib0012) 2010; 3 Yunès (bib0017) 2008 Mazoyer (bib0005) 1987; 50 Umeo, Imai (bib0015) 2016; vol. 9863 Goto (bib0004) 1966 J. Mazoyer, A minimal-time solution to the FSSP without recursive call to itself and with bounded slope of signals, Unpublished Draft, 1997, pp. 1–25. Waksman (bib0018) 1966; 9 Minsky (bib0007) 1967 Umeo, Imai, Sousa (bib0014) 2015; vol. 9477 Moore, Langdon (bib0009) 1968; 12 Balzer (bib0001) 1967; 10 Vollmar (bib0016) 1982; 21 Moore (bib0008) 1964 Umeo (10.1016/j.amc.2017.05.015_bib0012) 2010; 3 Goto (10.1016/j.amc.2017.05.015_sbref0004) 1966 Umeo (10.1016/j.amc.2017.05.015_bib0013) 2009; 19 Vollmar (10.1016/j.amc.2017.05.015_bib0016) 1982; 21 Umeo (10.1016/j.amc.2017.05.015_bib0015) 2016; vol. 9863 Moore (10.1016/j.amc.2017.05.015_bib0009) 1968; 12 Umeo (10.1016/j.amc.2017.05.015_bib0014) 2015; vol. 9477 Goto (10.1016/j.amc.2017.05.015_sbref0003) 1962; vol. 298 Gerken (10.1016/j.amc.2017.05.015_bib0002) 1987 Minsky (10.1016/j.amc.2017.05.015_bib0007) 1967 Mazoyer (10.1016/j.amc.2017.05.015_bib0005) 1987; 50 10.1016/j.amc.2017.05.015_bib0006 Balzer (10.1016/j.amc.2017.05.015_bib0001) 1967; 10 Moore (10.1016/j.amc.2017.05.015_bib0008) 1964 Waksman (10.1016/j.amc.2017.05.015_bib0018) 1966; 9 Umeo (10.1016/j.amc.2017.05.015_bib0011) 2009; vol. 4 Umeo (10.1016/j.amc.2017.05.015_bib0010) 1996; vol. 65 Yunès (10.1016/j.amc.2017.05.015_sbref0016) 2008 |
References_xml | – volume: 12 start-page: 212 year: 1968 end-page: 220 ident: bib0009 article-title: A generalized firing squad problem publication-title: Inf. Control contributor: fullname: Langdon – volume: 3 start-page: 267 year: 2010 end-page: 289 ident: bib0012 article-title: Generalized firing squad synchronization protocols for one-dimensional cellular automata – a survey publication-title: Acta Phys. Pol. B: Proc. Suppl. contributor: fullname: Akiguchi – volume: 9 start-page: 66 year: 1966 end-page: 78 ident: bib0018 article-title: An optimum solution to the firing squad synchronization problem publication-title: Inf. Control contributor: fullname: Waksman – volume: vol. 9863 start-page: 1 year: 2016 end-page: 11 ident: bib0015 article-title: A class of minimum-time minimum-state-change generalized FSSP algorithms publication-title: Proceedings of International Conference on Cellular Automata for Research and Industry, ACRI 2016 contributor: fullname: Imai – start-page: 213 year: 1964 end-page: 214 ident: bib0008 article-title: The firing squad synchronization problem publication-title: Sequential Machines, Selected Papers contributor: fullname: Moore – volume: vol. 4 start-page: 3537 year: 2009 end-page: 3574 ident: bib0011 article-title: Firing squad synchronization problem in cellular automata publication-title: Encyclopedia of Complexity and System Science contributor: fullname: Umeo – volume: 50 start-page: 183 year: 1987 end-page: 238 ident: bib0005 article-title: A six-state minimal time solution to the firing squad synchronization problem publication-title: Theor. Comput. Sci. contributor: fullname: Mazoyer – start-page: 1 year: 1987 end-page: 50 ident: bib0002 article-title: Über synchronisationsprobleme bei Zellularautomaten publication-title: Diplomarbeit contributor: fullname: Gerken – volume: vol. 65 year: 1996 ident: bib0010 article-title: A note on firing squad synchronization algorithms – a reconstruction of Goto’s first-in-the-world optimum-time firing squad synchronization algorithm publication-title: Proceedings of IFIP Cellular Automata Workshop 1996 contributor: fullname: Umeo – volume: 19 start-page: 299 year: 2009 end-page: 313 ident: bib0013 article-title: A family of smallest symmetrical four-state firing squad synchronization protocols for ring arrays publication-title: Parallel Process. Lett. contributor: fullname: Yunès – volume: 21 start-page: 1007 year: 1982 end-page: 1015 ident: bib0016 article-title: Some remarks about the efficiency of polyautomata publication-title: Int. J. Theor. Phys. contributor: fullname: Vollmar – volume: vol. 9477 start-page: 161 year: 2015 end-page: 173 ident: bib0014 article-title: A generalized minimum-time minimum-state-change FSSP algorithm publication-title: Proceedings of the 4th International Conference on the Theory and Practise of Natural Computing, TPNC 2015 contributor: fullname: Sousa – start-page: 67 year: 1966 end-page: 91 ident: bib0004 article-title: Some puzzles on automata publication-title: Toward Computer Sciences contributor: fullname: Goto – start-page: 195 year: 2008 end-page: 203 ident: bib0017 article-title: Goto’s construction and Pascal’s triangle: new insights into cellular automata synchronization publication-title: Proceedings of JAC 2008 contributor: fullname: Yunès – volume: 10 start-page: 22 year: 1967 end-page: 42 ident: bib0001 article-title: An 8-state minimal time solution to the firing squad synchronization problem publication-title: Inf. Control contributor: fullname: Balzer – volume: vol. 298 start-page: 52 year: 1962 end-page: 59 ident: bib0003 article-title: A minimal time solution of the firing squad problem publication-title: Dittoed Course Notes for Applied Mathematics contributor: fullname: Goto – year: 1967 ident: bib0007 article-title: Computation: Finite and Infinite Machines contributor: fullname: Minsky – volume: 9 start-page: 66 year: 1966 ident: 10.1016/j.amc.2017.05.015_bib0018 article-title: An optimum solution to the firing squad synchronization problem publication-title: Inf. Control doi: 10.1016/S0019-9958(66)90110-0 contributor: fullname: Waksman – ident: 10.1016/j.amc.2017.05.015_bib0006 – start-page: 213 year: 1964 ident: 10.1016/j.amc.2017.05.015_bib0008 article-title: The firing squad synchronization problem contributor: fullname: Moore – volume: 3 start-page: 267 year: 2010 ident: 10.1016/j.amc.2017.05.015_bib0012 article-title: Generalized firing squad synchronization protocols for one-dimensional cellular automata – a survey publication-title: Acta Phys. Pol. B: Proc. Suppl. contributor: fullname: Umeo – volume: 10 start-page: 22 year: 1967 ident: 10.1016/j.amc.2017.05.015_bib0001 article-title: An 8-state minimal time solution to the firing squad synchronization problem publication-title: Inf. Control doi: 10.1016/S0019-9958(67)90032-0 contributor: fullname: Balzer – volume: 12 start-page: 212 year: 1968 ident: 10.1016/j.amc.2017.05.015_bib0009 article-title: A generalized firing squad problem publication-title: Inf. Control doi: 10.1016/S0019-9958(68)90309-4 contributor: fullname: Moore – volume: 50 start-page: 183 year: 1987 ident: 10.1016/j.amc.2017.05.015_bib0005 article-title: A six-state minimal time solution to the firing squad synchronization problem publication-title: Theor. Comput. Sci. doi: 10.1016/0304-3975(87)90124-1 contributor: fullname: Mazoyer – start-page: 195 year: 2008 ident: 10.1016/j.amc.2017.05.015_sbref0016 article-title: Goto’s construction and Pascal’s triangle: new insights into cellular automata synchronization contributor: fullname: Yunès – volume: vol. 298 start-page: 52 year: 1962 ident: 10.1016/j.amc.2017.05.015_sbref0003 article-title: A minimal time solution of the firing squad problem contributor: fullname: Goto – start-page: 1 year: 1987 ident: 10.1016/j.amc.2017.05.015_bib0002 article-title: Über synchronisationsprobleme bei Zellularautomaten contributor: fullname: Gerken – volume: vol. 4 start-page: 3537 year: 2009 ident: 10.1016/j.amc.2017.05.015_bib0011 article-title: Firing squad synchronization problem in cellular automata contributor: fullname: Umeo – volume: vol. 9863 start-page: 1 year: 2016 ident: 10.1016/j.amc.2017.05.015_bib0015 article-title: A class of minimum-time minimum-state-change generalized FSSP algorithms contributor: fullname: Umeo – year: 1967 ident: 10.1016/j.amc.2017.05.015_bib0007 contributor: fullname: Minsky – volume: vol. 9477 start-page: 161 year: 2015 ident: 10.1016/j.amc.2017.05.015_bib0014 article-title: A generalized minimum-time minimum-state-change FSSP algorithm contributor: fullname: Umeo – start-page: 67 year: 1966 ident: 10.1016/j.amc.2017.05.015_sbref0004 article-title: Some puzzles on automata contributor: fullname: Goto – volume: vol. 65 year: 1996 ident: 10.1016/j.amc.2017.05.015_bib0010 article-title: A note on firing squad synchronization algorithms – a reconstruction of Goto’s first-in-the-world optimum-time firing squad synchronization algorithm contributor: fullname: Umeo – volume: 19 start-page: 299 year: 2009 ident: 10.1016/j.amc.2017.05.015_bib0013 article-title: A family of smallest symmetrical four-state firing squad synchronization protocols for ring arrays publication-title: Parallel Process. Lett. doi: 10.1142/S0129626409000237 contributor: fullname: Umeo – volume: 21 start-page: 1007 issue: 12 year: 1982 ident: 10.1016/j.amc.2017.05.015_bib0016 article-title: Some remarks about the efficiency of polyautomata publication-title: Int. J. Theor. Phys. doi: 10.1007/BF02084165 contributor: fullname: Vollmar |
SSID | ssj0007614 |
Score | 2.2785676 |
Snippet | The firing squad synchronization problem (FSSP) on cellular automata has been studied extensively for more than fifty years, and a rich variety of... |
SourceID | crossref elsevier |
SourceType | Aggregation Database Publisher |
StartPage | 92 |
SubjectTerms | Cellular automaton Firing squad synchronization problem FSSP |
Title | A new reconstruction and the first implementation of Goto’s FSSP algorithm |
URI | https://dx.doi.org/10.1016/j.amc.2017.05.015 |
Volume | 318 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1bS8MwFA5jvuiDeMV5GXnwSZhrm6RdHsdwzsuGMAd7C0nTaMW2w_VZ_Bv-PX-JJ71MBX3xpdAmgfI1nPMd-p0vCJ06QeAwY7txjGJw0aSjtA-Fq89dy-CV6tl-5_HEH83o9ZzNG2hQ98JYWWUV-8uYXkTr6km3QrO7iGPb48utXxQkQAjDDpnbDnZIRrCnz1-_ZB5QppdOzNxqvBxS_9ksNF4ysS6GbmXeyX7PTd_yzXALbVZEEffLd9lGjSjdQRvjlcvqchfd9jGQYlzUtCsfWCxTjWESNjEQOxwntUC8GMwMvszy7OPtfYmH0-kdls8P2UucPyZ7aDa8uB-MOtXpCJ3Q40EOuBLfGCJ9GlAtpefz0ISecTUzHFhVQBklWvlK2XHqKts0agLtepopRoB57aNmmqXRAcLSMBm6oYT5hMqeozweRsbxOJBF63jfQmc1LmJRmmCIWh32JABEYUEUDhMAYgvRGjnx40sKCNJ_Lzv837IjtA53vVJHfYyaAHZ0AjQhV-1iH7TRWv_qZjT5BLXqvAg |
link.rule.ids | 315,786,790,4521,24144,27957,27958,45620,45714 |
linkProvider | Elsevier |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3LTsMwELRKOQAHxFOUpw-ckEqT2E7qY1VRCrQVUlupN8uOawiiSUVzRvwGv8eXsM6jgAQXLjlkbSmaRLuzyuwYoXMnCBxm7DSOUQwumtSV9qFx9blrGbxSTTvv3B_43TG9nbBJBbXLWRgrqyxyf57Ts2xd3GkUaDbmUWRnfLn1i4ICCGnYIZMVtGrpvD2_4fL1S-cBfXpuxcytyMsh5a_NTOQlZ9bG0C3cO9nvxelbwelsoc2CKeJW_jDbqDKNd9BGf2mzuthFvRYGVoyzpnZpBItlrDEswiYCZoejWakQz4KJwddJmny8vS9wZzi8x_L5IXmJ0sfZHhp3rkbtbr04HqEeejxIAVjiG0OkTwOqpfR8HprQM65mhgOtCiijRCtfKRunrrJToybQrqeZYgSo1z6qxkk8PUBYGiZDN5SwnlDZdJTHw6lxPA5s0Vre19BFiYuY5y4YopSHPQkAUVgQhcMEgFhDtERO_HiVArL039sO_7ftDK11R_2e6N0M7o7QOkSauaj6GFUB-OkJcIZUnWbfxCdRHb2a |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+new+reconstruction+and+the+first+implementation+of+Goto%E2%80%99s+FSSP+algorithm&rft.jtitle=Applied+mathematics+and+computation&rft.au=Umeo%2C+Hiroshi&rft.au=Hirota%2C+Mitsuki&rft.au=Nozaki%2C+Youhei&rft.au=Imai%2C+Keisuke&rft.date=2018-02-01&rft.pub=Elsevier+Inc&rft.issn=0096-3003&rft.eissn=1873-5649&rft.volume=318&rft.spage=92&rft.epage=108&rft_id=info:doi/10.1016%2Fj.amc.2017.05.015&rft.externalDocID=S009630031730303X |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0096-3003&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0096-3003&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0096-3003&client=summon |