Skip to main content
SpringerLink
Log in

Cellular algorithms and their verification

  • Programming Languages Which Support Parallelism
  • Conference paper
  • First Online:
Conpar 81 (CONPAR 1981)

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

Included in the following conference series:

  • 118 Accesses

Abstract

This paper describes the core of a complex cellular processor research project — construction and verification of cellular algorithms, the basis for cellular programming.

Other important components of the project as theoretical /mathematical/ investigations, simulation language design and simulator implementation, cellular microprogramming will nearly be omitted, other components of central importance will only shortly be sketched and referred to the extent of making understandable the conditions e.g. requirements for and possibilities of the cellprogramming. /basic cellular processor architecture, integration of cellprocessors into digital architecture, real application areas/.

Attention will be focused on the class of cellular algorithms taylored to the introduced universal microprogrammable cellprocessor. Less discussions can be devoted here to the important methodology and practice of the cellware — cellular specialized hardware — design and implementation.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • E.F. CODD, 1968 Cellular automata. Academic Press, New York, London.

    MATH  Google Scholar 

  • K. HWANG, 1979 Computer arithmetic. John Wiley et Sons. New York.

    Google Scholar 

  • T. KUNG, 1980 The design of special purpose VLSI chips. Computer, Jan. 1980 pp. 26–40.

    Google Scholar 

  • H. NISHIO, 1975 Real time sorting of binary numbers by one-dimensional cellular automata. in: Proceedings of the International Symposium on Uniformly Structured Automata and Logic, Tokyo, 1975. pp. 153–162.

    Google Scholar 

  • J. NEUMANN, 1966 The theory of self-reproducing automata. ed. A.W. Burks. University of Illinois Press. Illinois, Urbana.

    Google Scholar 

  • C.D. THOMPSON — H.T. KUNG, 1977 Sorting on a mesh-connected parallel computer. CACM, 20/4/: pp. 263–270

    MATH  MathSciNet  Google Scholar 

  • R. VOLLMAR, 1979 Algorithmen in Zellularautomaten. Teubner, Stuttgart.

    MATH  Google Scholar 

  • F. DIOSLAKI, 1979 Cellular algorithms. Thesis. JATE, Szeged. /in Hungarian/

    Google Scholar 

  • Á. FEHÉR, 1979 Verification of cellular algorithms. Thesis. ELTE, Budapest. /in Hungarian/

    Google Scholar 

  • P. KACSUK, 1979 Cellprocessing in process control. in: Homogeneous computing systems, III–IV. SZKI. Budapest. Ed.: T. Legendi. /in Hungarian/

    Google Scholar 

  • E. KATONA, 1981a Binary addition and multiplication in cellular spaces. To appear in: Proceedings FCT’ 81 Szeged.

    Google Scholar 

  • E. KATONA, 1981b Cellular algorithms for vector-and matrix-multi-plication. To appear in: Acta Cybernetica, 1981.

    Google Scholar 

  • E. KATONA, 1981c The simulation of associative storage in cellular space and its applications. To appear in: Acta Cybernetica, 1981.

    Google Scholar 

  • E. KATONA, 1981d The applications of cellprocessors in conventional data processing. To appear in: Proceedings of III Hungarian Computer Science Conference. Budapest. Jan. 26–28. 1981.

    Google Scholar 

  • E. KATONA, CONPAR'81 Cellular algorithms for binary matrix operations. This conference proceedings.

    Google Scholar 

  • E. KATONA — Cellular algorithms for decimal arithmetic operations.

    Google Scholar 

  • T. LEGENDI, 1981 Submitted to EIK.

    Google Scholar 

  • J. LANGER, 1980 Cellular algorithm for path searching in switching networks. Thesis. TU Budapest. /in Hungarian/

    Google Scholar 

  • T. LEGENDI, 1976 1978a Cellprocessors in computer architecture. Computational Linguistics and Computer Languages. 11: 147–169 /1976/, 12: 153–164 /1978/

    Google Scholar 

  • 1977a INTERCELLAS — an iteractive cellular space simulation language. Acta Cybernetica, 3 /3/: 261–267 /1977/

    MATH  Google Scholar 

  • T. LEGENDI 1977b Programming of cellular processors. in: Proceedings of “Cellular meeting” Braunschweig /U. Golze, R. Vollmar/. Informatik-Berichte Nr. 7703 Technische Universität Braunschweig. 1977. pp. 53–66.

    Google Scholar 

  • 1979 A 2D transition function definition language for a subsystem of the CELLAS cellular processor simulation language. Computational Linguistics and Computer Languages. 13: 169–194 /1979/

    Google Scholar 

  • T. LEGENDI et al. 1980a CELLAS User's Manual. JATE, Szeged.

    Google Scholar 

  • T. LEGENDI et al. 1980b INTERCELLAS User's Manual. JATE, Szeged.

    Google Scholar 

  • T. LEGENDI 1981a Programming of a cellprocessor model. To appear in: Proceedings III Hungarian Computer Science Conference. Budapest. Jan. 26–28. 1981

    Google Scholar 

  • T. LEGENDI 1981b New cellular algorithms. To appear in: Acta Cybernetica 1981

    Google Scholar 

  • G. MOLNÁR, 1979 Cellprogram for an IBM assembler. in: Thesis. JATE, Budapest. /in Hungarian/

    Google Scholar 

  • L. PÁLVÖLGYI, 1978 Cellular algorithms. in: Thesis. ELTE, Budapest.

    Google Scholar 

  • L. PÁLVÖLGYI 1981 Cellular algorithms for picture processing. in: Homogeneous computing systems, V. SZKI, Budapest. Ed.: T. Legendi, /in Hungarian/

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Group on Theory of Automata, Hungarian Academy of Sciences, Somogyi u. 7, H-6720, Szeged, Hungary

    T. Legendi

Authors
  1. T. Legendi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

W. Brauer P. Brinch Hansen D. Gries C. Moler G. Seegmüller J. Stoer N. Wirth Wolfgang Händler

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Legendi, T. (1981). Cellular algorithms and their verification. In: Brauer, W., et al. Conpar 81. CONPAR 1981. Lecture Notes in Computer Science, vol 111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0105117

Download citation

  • DOI: https://doi.org/10.1007/BFb0105117

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10827-6

  • Online ISBN: 978-3-540-38715-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation