Efficient Partitioning Based Hierarchical Agglomerative Clustering Using Graphics Accelerators with CUDA

S.A. Arul Shalom, Manoranjan Dash
School of Computer Engineering, Nanyang Technological University, 50 Nanyang Avenue ̧639798 Singapore
International Journal of Artificial Intelligence & Applications (IJAIA), Vol.4, No.2, March 2013



   author={Shalom, SA Arul and Dash, Manoranjan},

   journal={International Journal},



Download Download (PDF)   View View   Source Source   



We explore the capabilities of today’s high-end Graphics processing units (GPU) on desktop computers to efficiently perform hierarchical agglomerative clustering (HAC) through partitioning of gene expressions. Our focus is to significantly reduce time and memory bottlenecks of the traditional HAC algorithm by parallelization and acceleration of computations without compromising the accuracy of clusters. We use partially overlapping partitions (PoP) to parallelize the HAC algorithm using the hardware capabilities of GPU with Compute Unified Device Architecture (CUDA). We compare the computational performance of GPU over the CPU and our experiments show that the computational performance of GPU is much faster than the CPU. The traditional HAC and partitioning based HAC are up to 66 times and 442 times faster on the GPU respectively, than the time taken by a CPU for the traditional HAC computations. Moreover, the PoP HAC on GPU requires only a fraction of the memory required by the traditional algorithm on the CPU. The novelties in our research includes boosting computational speed while utilizing GPU global memory, identifying minimum distance pair in virtually a single-pass, avoiding the necessity to maintain huge data in memories and complete the entire HAC computation within the GPU.
Rating: 1.5/5. From 2 votes.
Please wait...

* * *

* * *

HGPU group © 2010-2024 hgpu.org

All rights belong to the respective authors

Contact us: