The Community for Technology Leaders
Parallel Computing in Electrical Engineering, 2004. International Conference on (2006)
Bialystok, Poland
Sept. 13, 2006 to Sept. 17, 2006
ISBN: 0-7695-2554-7
pp: 331-336
Dariusz Konieczny , Wroclaw University of Technology, Poland
Jan Kwiatkowski , Wroclaw University of Technology, Poland
Urszula Markowska-Kaczmar , Wroclaw University of Technology, Poland
Marcin Pawlik , Wroclaw University of Technology, Poland
ABSTRACT
The Kohonen Feature Maps are commonly employed to process large input data but their effective working abilities can be achieved only after a time-consuming process of learning. Performed tests have shown that the sequential program, solving a typical problem, uses more than 95 percent of its time to localize the winners. The aim of the paper is to present and compare different ways of the algorithm parallelization. We compare two different classes of parallel implementations - the network parallelization and the learning set parallelization. During performed experiments two different ways of experimental evaluation are used: standard evaluation based on such metrics as speedup and efficiency and the approximation method based on the granularity
INDEX TERMS
null
CITATION
Dariusz Konieczny, Jan Kwiatkowski, Urszula Markowska-Kaczmar, Marcin Pawlik, "Performance Evaluation of Different Kohenen Network Parallelization Techniques", Parallel Computing in Electrical Engineering, 2004. International Conference on, vol. 00, no. , pp. 331-336, 2006, doi:10.1109/PARELEC.2006.66
100 ms
(Ver 3.3 (11022016))