The Firing Squad Synchronization Problem with many generals for one-dimensional CA

IFIP Advances in Information and Communication Technology

Volumn 155, Issue , 2004, Pages 111-124

  Schmid, Hubert ^a   Worsch, Thomas ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Cellular automata; Firing Squad Synchronization Problem

Indexed keywords

CELLULAR AUTOMATA; SYNCHRONIZATION;

ASYNCHRONOUS VERSION; CLASSICAL PROBLEMS; EXACT FORMULAS; FIRING SQUAD SYNCHRONIZATION PROBLEMS; RUNNING TIME; SYNCHRONIZATION TIME;

ONE DIMENSIONAL;

EID: 84901001990     PISSN: 18684238     EISSN: None     Source Type: Book Series    
DOI: 10.1007/1-4020-8141-3_11     Document Type: Conference Paper

References (16)

1. K. Čulik and S. Dube. An efficient solution of the firing mob problem. Theoretical Computer Science, 91:57-69, 1991.
2. E. Goto. A minimum time solution of the Firing Squad Problem. Dittoed course notes for Applied Mathematics 298, Harvard University, 1962.
3. M. Hisaoka, H. Yamada, M. Maeda, Th. Worsch, and H. Umeo. A design of firing squad synchronization algorithms for multi-general problems and their implementations. Unpublished manuscript, 2003.
4. K. Kobayashi. On the minimal firing time of the firing squad synchronization problem for polyautomata networks. Theoretical Computer Science, 7:149-167, 1978.
5. M. Kutrib and R. Vollmar. Minimal time synchronization in restricted defective cellular automata. Journal of Information Processing and Cybernetics, EIK 27:179-196, 1991.
6. S. La Torre, M. Napoli, and M. Parente. Synchronization of a line of identical processors at a given time. Fundamenta Informaticae, 34:103-128, 1998.
7. J. Mazoyer. A six-state minimal time solution to the firing squad synchronization problem. Theoretical Computer Science, 50:183-238, 1987.
8. F. R. Moore and G. G. Langdon. A generalized firing squad problem. Information and Control, 12:17-33, 1968.
9. P. Sanders. Suchalgorithmen auf SIMD-Rechnern-Weitere Ergebnisse zu Polyautomaten. Diploma thesis, Fakultät für Informatik, Universität Karlsruhe, 1993.
10. H. Schmid. Synchronisationsprobleme für zelluläre Automaten mit mehreren Generälen. Diploma thesis, Fakultät für Informatik, Universität Karlsruhe, 2003.
11. M. Stratmann and Th. Worsch. Leader election in d-dimensional CA in time diam · log(diam). Future Generation Computer Systems, 18(7):939-950, 2002.
12. H. Szwerinski. Time optimal solution of the firing squad synchronization problem for n-dimensional rectangles with the general at an arbitrary position. Theoretical Computer Science, 19:305-320, 1982.
13. H. Umeo. A simple design of time-optimum firing squad synchronization algorithms with fault-tolerance. IEICE Transactions on Information and Systems, E87-D:733-739, 2004.
14. R. Vollmar. Yet another generalization of the firing squad problem. Technical report, Technische Universität Braunschweig, Braunschweig, 1976.
15. R. Vollmar. On two modified problems of synchronization in cellular automata. Acta Cybernetica, 3:293-300, 1977.
16. Th. Worsch. Algorithmen in Zellularautomaten. Course notes, Fakultät für Informatik, Universität Karlsruhe, 2003.