Rapid Performance of a Generalized Distance Calculation

Scott Fisackerly, Eric Chu, David L. Foster, Dave Foster

Research output: Contribution to conferencePresentation

Abstract

The ever-increasing size of data sets and the need for real-time processing drives the need for high speed analysis. Since traditional CPUs are designed to execute a small number of sequential process, they are ill-suited to keep pace with this growth and exploit the massive parallelism inherent in these problem spaces. In the last several years, the parallelism of GPUs has made them a viable solution for general purpose computing. However, effective use of GPUs requires a significantly different programming paradigm. Towards the goal of creating a function library that maximizes the performance improvement of GPUs in data analysis and clustering, this paper presents an implementation of a general n-dimensional distance calculation commonly used in these types of algorithms. Experimental results show up to a 390x speedup using a Tesla C1060 and up to a 538x speedup using a GeForce GTX 480 over an Intel Core i7.

Original languageAmerican English
StatePublished - Jan 1 2011
EventProceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA) [BOOK] pp. 374-378 -
Duration: Jan 1 2011 → …

Conference

ConferenceProceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA) [BOOK] pp. 374-378
Period1/1/11 → …

Keywords

  • GPU computing
  • Distance calculation
  • Parallel computing

Disciplines

  • Electrical and Computer Engineering

Cite this