Skip to main content
SpringerLink
Log in
Book cover

International Conference on Unconventional Methods of Computation

UMC 2002: Unconventional Models of Computation pp 276–286Cite as

Some New Generalized Synchronization Algorithms and Their Implementations for Large Scale Cellular Automata

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2509))

Abstract

In this paper, we study a generalized synchronization prob- lem for large scale cellular automata (CA) on one- and two-dimen- sional arrays. Some new generalized synchronization algorithms will be designed both on O(1)-bit and 1-bit inter-cell communication models of cellular automata. We give a 9-state and 13-state CA that can solve the generalized synchronization problem in optimum- and linear-time on O(1)-bit 1-D and 2-D CA, respectively. The number of internal states of the CA implemented is the smallest one known at present. In addi- tion, it is shown that there exists a 1-bit inter-cell communication CA that can synchronize 1-D n cells with the general on the kth cell in n+max(k, n - k + 1) steps, which is two steps larger than the optimum time. We show that there still exist several new generalized synchro- nization algorithms, although more than 40 years have passed since the development of the problem.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Balzer: An 8-state minimal time solution to the firing squad synchronization problem. Information and Control, vol. 10(1967), pp. 22–42.

    Article  Google Scholar 

  2. W. T. Beyer: Recognition of topological invariants by iterative arrays. Ph.D. Thesis, MIT, (1969), pp. 144.

    Google Scholar 

  3. A. Grasselli: Synchronization of cellular arrays: The firing squad problem in two dimensions. Information and Control, vol. 28(1975), pp. 113–124.

    Article  MATH  MathSciNet  Google Scholar 

  4. Hans-D., Gerken: Über Synchronisations-Probleme bei Zellularautomaten. Diplomarbeit, Institut für Theoretische Informatik Technische Universität Braunschweig, pp. 50, (1987).

    Google Scholar 

  5. E. Goto: A minimal time solution of the firing squad problem. Dittoed course notes for Applied Mathematics 298, Harvard University, (1962), pp. 52–59.

    Google Scholar 

  6. M. Maeda and H. Umeo: A design of two-dimensional firing squad synchronization algorithms and their implementations. Proc. of The 15th Annual Conference of Japanese Society for Artificial Intelligence, 2C305(2001), pp. 1–4.

    Google Scholar 

  7. J. Mazoyer: A six-state minimal time solution to the firing squad synchronization problem. Theoretical Computer Science, vol. 50(1987), pp. 183–238.

    Article  MATH  MathSciNet  Google Scholar 

  8. J. Mazoyer: On optimal solutions to the firing squad synchronization problem. Theoretical Computer Science, vol. 168(1996), pp. 367–404.

    Article  MATH  MathSciNet  Google Scholar 

  9. K. Michisaka, H. Yahara, N. Kamikawa and H. Umeo: A generalization of 1-bit-communication firing squad synchronization algorithm. Proc. of The 15th Annual Conference of Japanese Society for Artificial Intelligence, 2C306(2001), pp. 1–4.

    Google Scholar 

  10. M. Minsky: Computation: Finite and infinite machines. Prentice Hall, (1967), pp. 28–29.

    Google Scholar 

  11. E. F. Moore: The firing squad synchronization problem. in Sequential Machines, Selected Papers (E. F. Moore ed.), Addison-Wesley, Reading MA., (1964), pp. 213–214.

    Google Scholar 

  12. F. R. Moore and G. G. Langdon: A generalized firing squad problem. Information and Control, vol. 12(1968), pp. 212–220.

    Article  MATH  Google Scholar 

  13. J. Nishimura, T. Sogabe and H. Umeo: A Design of Optimum-Time Firing Squad Synchronization Algorithm on 1-Bit Cellular Automaton. Tech. Rep. of IPSJ, (2000).

    Google Scholar 

  14. I. Shinahr: Two-and three-dimensional firing squad synchronization problems. Information and Control, vol. 24(1974), pp. 163–180.

    Article  MATH  MathSciNet  Google Scholar 

  15. H. Szwerinski: Time-optimum solution of the firing-squad-synchronization-problem for n-dimensional rectangles with the general at an arbitrary position. Theoretical Computer Science, vol. 19(1982), pp. 305–320.

    Article  MATH  MathSciNet  Google Scholar 

  16. H. Umeo, J. Nishimura and T. Sogabe: 1-Bit Inter-cell Communication Cellular Algorithms (invited lecture). Proc. of the Tenth Intern. Colloquium on Differential Equations, held in Plovdiv in 1999, International Journal of Differential Equations and Applications, vol. 1A, no. 4(2000), pp. 433–446.

    Google Scholar 

  17. H. Umeo, T. Sogabe and Y. Nomura: Correction, optimization and verification of transition rule set for Waksman’s firing squad synchronization algorithms. Proc. of the 4th International Conference on Cellular Automata for Research and Industry, 2000, pp. 152–160.

    Google Scholar 

  18. H. Umeo, M. Maeda and N. Fujiwara: An efficient mapping scheme for embedding any one-dimensional firing squad synchronization algorithm onto two-dimensional arrays. Proc. of the 5th International Conference on Cellular Automata for Research and Industry, 2002 (to appear).

    Google Scholar 

  19. V. I. Varshavsky: Synchronization of a collection of automata with random pairwise interaction. Autom. and Remote Control, vol. 29(1969), pp. 224–228.

    Google Scholar 

  20. V. I. Varshavsky, V. B. Marakhovsky and V. A. Peschansky: Synchronization of interacting automata. Mathematical Systems Theory, vol. 4,3(1970), pp. 212–230.

    Article  MathSciNet  Google Scholar 

  21. A. Waksman: An optimum solution to the firing squad synchronization problem. Information and Control, vol. 9(1966), pp. 66–78.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Osaka Electro-Communication University, Neyagawa-shi, Hatsu-cho 18-8, Osaka, 572-8530, Japan

    Hiroshi Umeo, Masaya Hisaoka, Koshi Michisaka, Koji Nishioka & Masashi Maeda

Authors
  1. Hiroshi Umeo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Masaya Hisaoka
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Koshi Michisaka
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Koji Nishioka
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Masashi Maeda
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Umeo, H., Hisaoka, M., Michisaka, K., Nishioka, K., Maeda, M. (2002). Some New Generalized Synchronization Algorithms and Their Implementations for Large Scale Cellular Automata. In: Unconventional Models of Computation. UMC 2002. Lecture Notes in Computer Science, vol 2509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45833-6_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-45833-6_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44311-7

  • Online ISBN: 978-3-540-45833-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation