parSOM: Using Parallelism to Overcome Memory Latency in Self-Organizing Neural Networks

  • Authors:
  • Philipp Tomsich;Andreas Rauber;Dieter Merkl

  • Affiliations:
  • -;-;-

  • Venue:
  • HPCN Europe 2000 Proceedings of the 8th International Conference on High-Performance Computing and Networking
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

The self-organizing map is a prominent unsupervised neural network model which lends itself to the analysis of high-dimensional input data. However, the high execution times required to train the map put a limit to its application in many high-performance data analysis application domains, where either very large datasets are encountered and/or interactive response times are required. In this paper we present the parSOM, a software-based parallel implementation of the self-organizing map, which is particularly optimized for the analysis of high-dimensional input data. This model scales well in a parallel execution environment, and, by coping with memory latencies, a better than linear speed-up can be achieved using a simple, asymmetric model of parallelization. We demonstrate the benefits of the proposed implementation in the field of text classification, which due to the high dimensionalities of the data spaces encountered, forms a prominent application domain for high-performance computing.