A transitive closure algorithm for a 16-state cellprocessor

  • Endre Katona
Submitted Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 342)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [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. [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. [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. [4]
    Katona, E.: A general partitioning method for cellular algorithms. Proc. of the 4th Cellular Meeting, T.U. Braunschweig, 1988.Google Scholar
  5. [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. [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

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Endre Katona
    • 1
  1. 1.Research Group on Automata TheoryHungarian Academy of SciencesSzegedHungary

Personalised recommendations