Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Parallel Processing by Cellular Automata and Arrays

Parcella 1988: Parcella '88 pp 285–290Cite as

A transitive closure algorithm for a 16-state cellprocessor

  • Submitted Papers
  • Conference paper
  • First Online:

  • 124 Accesses

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

Abstract

Cellprocessors can be considered as microprogrammed Boolean array machines, thus they can process Boolean matrices with very high efficiency. It will be shown that transitive closure of a relation, represented by an nxn Boolean matrix, can be computed in 5n steps using an (n+1)xn array of 16-state cells. If there are several relations, the transitive closure of which should be computed, then a continuous pipeline processing is possible where the processing cost of one matrix is only n steps. The transitive closure algorithm can be partitioned so that arbitrary size relations can be handled with a fixed size cellular array.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A., Hopcroft, J.E. and Ullman, J.D.: The design and analysis of computer algorithms. Addison-Wesley, Reading, Massachusetts, 1975.

    Google Scholar 

  2. Guibas, L.J., Kung, H.T. and Thompson, C.D.: Direct VLSI implementation of combinatorial algorithms. Proc. Caltech Conf. on VLSI, California Inst. Technology, Pasadema 1979, 509–525.

    Google Scholar 

  3. Katona, E.: Examples of cellular algorithms for a 16-state cell-processor architecture. Chapter of a study made on the commission of the Hungarian Government Program on Microelectronics, 1984, in Hungarian.

    Google Scholar 

  4. Katona, E.: A general partitioning method for cellular algorithms. Proc. of the 4th Cellular Meeting, T.U. Braunschweig, 1988.

    Google Scholar 

  5. Robert, Y. and Trystram, D.: Parallel implementation of the algebraic path problem. Proc. of CONPAR 86, Lecture Notes in Computer Science 237, 1986, pp. 149–156.

    Google Scholar 

  6. Zsótér, A.: A cellprocessor based on 16-state cells. Proc. of PARCELLA'86, Akademie-Verlag Berlin, 1986, pp. 66–69.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Endre Katona

Authors
  1. Endre Katona
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gottfried Wolf Tamáas Legendi Udo Schendel

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Katona, E. (1989). A transitive closure algorithm for a 16-state cellprocessor. In: Wolf, G., Legendi, T., Schendel, U. (eds) Parcella '88. Parcella 1988. Lecture Notes in Computer Science, vol 342. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50647-0_119

Download citation

  • DOI: https://doi.org/10.1007/3-540-50647-0_119

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50647-8

  • Online ISBN: 978-3-540-46062-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation