Summary
Parallel system with distributed memory is a promising platform to achieve a high performance computing with less construction cost. Applications with less communications, such as a kind of parameter sweep applications (PSA), can be efficiently carried out on such a parallel system, but some applications are not suitable for the parallel system due to a large communication cost. We focus on PNN (Pairwise Nearest Neighbor) codebook generation algorithm for VQ (Vector Quantization) compression algorithm and propose a parallel version of the PNN algorithm suitable for the parallel system with distributed memory, called “multi-step parallel PNN”.
The multi-step parallel PNN is a modified version of the PNN algorithm that creates a different codebook than the original PNN does, thus the quality of a codebook created by using the multi-step parallel PNN may be worse than that of a codebook by the original PNN. However, our experimental results show that the quality of the codebook is almost same as that of the original one. We also confirm the effectiveness of the multi-step parallel PNN by the evaluation of the computational complexity of the algorithm and the preliminary experiment executed on a PC cluster system.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Gersho, A., Gray, R.: Vector Quantization and Signal Compression. Kluwer Academic Publishers, Boston (1992)
Franti, P., Kaukoranta, T., Shen, D., Chang, K.: Fast and Memory Efficient Implementation of the Exact PNN. IEEE Tran. on Image Processing 9(5), 773–777 (2000)
Sony Computer Entertainment Inc., Cell Broadband Engine, http://cell.scei.co.jp/index_e.html
Anderson, D., Cobb, J., Korpela, E., Lebofsky, M., Werthimer, D.: SETI@home: an experiment in public-resource computing. Communications of the ACM 45(11), 56–61 (2002)
Huedo, E., Montero, R., Llorente, I.: Experiences on Adaptive Grid Scheduling of Parameter Sweep Applications. In: Proc. of the 12th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2004), pp. 28–33 (2004)
Equitz, W.: A new vector quantization clustering algorithm. IEEE trans. on Acoustics, Speech and Signal Processing 37(10), 1568–1575 (1980)
Dhillon, I.S., Modha, D.S.: A data-clustering algorithm on distributed memory multiprocessors. In: Proc. of Large-scale Parallel KDD Systems Workshop, ACM SIGKDD (1999)
Garg, A., Mangla, A., Gupta, N., Bhatnagar, V.: PBIRCH: Acalable parallel clustering algorithm for incremental Data. In: Proc. of the 10th Int’l Data Engineering and Applications Symp. (2006)
Olsen, C.F.: Parallel algorithms for hierarchical clustering. Parallel Computing 21, 1313–1325 (1995)
Wakatani, A.: Evaluation of parallel VQ compression algorithms on an SMP system. In: Proc. of IEEE CCECE 2006, pp. 1899–1904 (2006)
Wakatani, A.: A VQ compression algorithm for a multiprocessor system with a global sort collective function. In: Proc. of IEEE/ACIS ICIS 2006, pp. 11–16 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Wakatani, A. (2008). Multi-step Parallel PNN Algorithm for Distributed-Memory Systems. In: Lee, R., Kim, HK. (eds) Computer and Information Science. Studies in Computational Intelligence, vol 131. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79187-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-79187-4_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79186-7
Online ISBN: 978-3-540-79187-4
eBook Packages: EngineeringEngineering (R0)