Abstract :
PC Grid is a promising platform to achieve a high performance computing with less construction cost. A kind of parameter sweep applications (PSA) can be efficiently carried out on the PC Grid, but there exist parallel applications are not suitable for it. We focus on PNN (Pairwise Nearest Neighbor) code- book generation algorithm for the VQ compression algorithm and propose a parallel version of the PNN algorithm suitable for the PC Grid, called "One-step Grid PNN", as well as "multi- step Grid PNN", which reduces the computation complexity on a master computer. The Grid 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 Grid 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 one-step and multi-step Grid PNN by the evaluation of the computational complexity of the algorithm and the preliminary experiment executed on a PC cluster system.
Keywords :
computational complexity; electronic data interchange; grid computing; parallel algorithms; workstation clusters; PC Grid system; PC cluster system; PNN codebook generation algorithm; VQ compression algorithm; computational complexity; pairwise nearest neighbor; parameter sweep applications; Books; Clustering algorithms; Compression algorithms; Computational complexity; Concurrent computing; Costs; Grid computing; High performance computing; Mesh generation; Nearest neighbor searches;
