Efficient parallel processing of competitive learning algorithms
Autor: | Hiroyuki Takizawa, Shintaro Momose, Hiroaki Kobayashi, Tadao Nakamura, Kentaro Sano |
---|---|
Rok vydání: | 2004 |
Předmět: |
Self-organizing map
Analysis of parallel algorithms Speedup Computer Networks and Communications Computer science Competitive learning Quantization (signal processing) Vector quantization Parallel algorithm Codebook Parallel computing Computer Graphics and Computer-Aided Design Theoretical Computer Science Artificial Intelligence Hardware and Architecture Scalability Algorithm Software |
Zdroj: | Parallel Computing. 30:1361-1383 |
ISSN: | 0167-8191 |
Popis: | Vector quantization (VQ) is an attractive technique for lossy data compression, which has been a key technology for data storage and/or transfer. So far, various competitive learning (CL) algorithms have been proposed to design optimal codebooks presenting quantization with minimized errors. Although algorithmic improvements of these CL algorithms have achieved faster codebook design than conventional ones, limitations of speedup still exist when large data sets are processed on a single processor. Considering a variety of CL algorithms, parallel processing on flexible computing environment, like general-purpose parallel computers is in demand for a large-scale codebook design. This paper presents a formulation for efficiently parallelizing CL algorithms, suitable for distributed-memory parallel computers with a message-passing mechanism. Based on this formulation, we parallelize three CL algorithms: the Kohonen learning algorithm, the MMPDCL algorithm and the LOJ algorithm. Experimental results indicate a high scalability of the parallel algorithms on three different types of commercially available parallel computers: IBM SP2, NEC AzusA and PC cluster. |
Databáze: | OpenAIRE |
Externí odkaz: |