Comparison of two MST algorithms for associative parallel processors

  • Ann Sh. Nepomniaschaya
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 964)


In this paper, we analyze procedures for finding a minimal spanning tree of a graph for an abstract associative STAR-machine with bit-serial processing. We compare the implementations of the Prim-Dijkstra algorithm and the Baase algorithm on the STAR-machine for the same graph representation. Then we briefly describe our STAR-system.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Baase, S.: Computer algorithms: Introduction to design and analysis. Addison-Wesley Reading MA 1978.Google Scholar
  2. 2.
    Dijkstra, E. W.: A note on two problems in connection with graphs. Numerische Math. 1 (1959) 269–271.Google Scholar
  3. 3.
    Fernstrom, C., Kruzela, J., Svensson, B.: LUCAS associative array processor. Design, programming and application studies. Lecture Notes in Computer Science Berlin: Springer-Verlag 216 1986.Google Scholar
  4. 4.
    Foster, C. C.: Content addressable parallel processors. Van Nostrand Reinhold Company, New York 1976.Google Scholar
  5. 5.
    Grosspietsch, K. E.: Associative processors and memories: A survey. IEEE, Micro (June, 1992) 12–19.Google Scholar
  6. 6.
    Huebler, A., Sykora, O.: Image processing and recognition algorithms for an orthogonal computer. Computers and Artificial Intelligence 6 N2 (1987) 131–149.Google Scholar
  7. 7.
    Lange, R. G.: High level language for associative and parallel computation with Staran. Proc. of Intl. Conf. on Parallel Processing (1976) 170–176.Google Scholar
  8. 8.
    Miklosko, J., Klette, R., Vajtersic, M., Vrto, J.: Fast algorithms and their implementation on specialized parallel computers. Special Topics in Supercomputing North-Holand 5 1989.Google Scholar
  9. 9.
    Nepomniaschaya, A. Sh.: Language STAR for associative and parallel computation with vertical data processing. Proc. of the Intern. Conf. ”Parallel Computing Technologies”. Novosibirsk USSR (1991) 258–265.Google Scholar
  10. 10.
    Nepomniaschaya, A. Sh.: Investigation of associative search algorithms in vertical processing systems. Proc. of the Intern. Conf. ”Parallel Computing Technologies”. Obninsk Russia (1993) 631–641.Google Scholar
  11. 11.
    Otrubova, B., Sykora O.: Orthogonal computer and its application to some graph problems. Parcella'86. Berlin Academie Verlag (1986) 259–266.Google Scholar
  12. 12.
    Potter, J. L.: Associative computing: A programming paradigm for massively parallel computers. Kent State University, Plenum Press, New York and London 1992.Google Scholar
  13. 13.
    Pratt, V. R., Stockmeyer, L.J.: A characterization of the power of vector machines. J. of Computer and System Sciences. 12 N2 (1976) 198–221.Google Scholar
  14. 14.
    Prim, R. C.: Shortest connection networks and some generalizations. Bell System Tech. J. 36, (1957) 1389–1401.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Ann Sh. Nepomniaschaya
    • 1
  1. 1.Supercomputer Software DepartmentComputing Center, Siberian Division of Russian Academy of SciencesNovosibirskRussia

Personalised recommendations