Skip to main content
SpringerLink
Log in

Parallelizing self-organizing maps

  • Contributed Papers
  • Conference paper
  • First Online:
SOFSEM'97: Theory and Practice of Informatics (SOFSEM 1997)

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

Abstract

Several ways of parallelizing the self-organizing network (Kohonen maps) are studied on the BSP-like parallel machine model. Optimal number of processors and criteria for choosing the right task decomposition are presented. Theoretical results are verified in the PVM environment on a cluster of workstations.

This research was partially supported by GAASCR under grant no. A2030602, and by GACR under grant no. 201/95/0976.

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

  1. Geist A., Beguelin A., Dongarra J., Jiang W., Manchek R., Sunderam V.: PVM 3 User's Guide and Reference Manual, 1994.

    Google Scholar 

  2. Ghosh J., Hwang K.: Mapping Neural Networks onto Message-Passing Multicomputers. Journal of Parallel and Distributed Computing 6, pp. 291–330, 1989.

    Google Scholar 

  3. Kohonen T.: Self-Organizing Maps Springer-Verlag, Berlin, 1995.

    Google Scholar 

  4. Valiant L. G.: A Bridging Model for Parallel Computation. Communications of ACM, 33(8), 103–111, 1990.

    Google Scholar 

  5. N. Vassilas and P. Thiran and P. Ienne: How to modify Kohonen self-organizing feature maps for an efficient digital parallel implementation. Fourth International Conference on Artificial Neural Networks (Conf. Publ. No.409), 86-91, IEE, 1995.

    Google Scholar 

  6. V. Demian and J.-C. Mignot: Implementation of the self-organizing feature map on parallel computers. Computers and Artificial Intelligence, 14(i), 63–80, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Physics, 25, Malostranké nám.

    David Štrupl

  2. Institute of Computer Science, ASCR, P.O. Box 5, 182 07, Prague

    Roman Neruda

Authors
  1. David Štrupl
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roman Neruda
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

František Plášil Keith G. Jeffery

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Štrupl, D., Neruda, R. (1997). Parallelizing self-organizing maps. In: Plášil, F., Jeffery, K.G. (eds) SOFSEM'97: Theory and Practice of Informatics. SOFSEM 1997. Lecture Notes in Computer Science, vol 1338. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63774-5_139

Download citation

  • DOI: https://doi.org/10.1007/3-540-63774-5_139

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63774-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation