首页> 外文会议>International Conference on Electronic Computer Technology >Accelarating the Euclidean distance matrix computation using GPUs
【24h】

Accelarating the Euclidean distance matrix computation using GPUs

机译:使用GPU加速欧几里德距离矩阵计算

获取原文

摘要

Euclidean distance matrix is used to find out the similarity of two matrices. It is a very important matrix operation used frequently in mathematical and pattern recognition based problems. The Euclidean distance matrix is a compute intensive algorithm which is also a very important step in a majority of image/speech processing algorithms. In addition to its extensive use in signal processing, it is also used in a lot of scientific calculations. Since most of the applications deal with huge matrices, the calculation often takes a significant amount of time thus slowing down algorithms. This makes the algorithms almost impossible to be implemented for real time applications. In this paper we attempt at reducing the execution time using Graphical Processing Units (GPUs). GPUs are essentially graphics cards that available at a very affordable cost and are increasing present in all computers. We use Compute Unified Device Architecture CUDA, introduced by NVIDIA for programming the GPUs.
机译:欧几里德距离矩阵用于找出两个矩阵的相似性。 它是一种非常重要的矩阵操作,经常在数学和模式识别基于问题中使用。 欧几里德距离矩阵是计算密集算法,这也是大多数图像/语音处理算法中的非常重要的步骤。 除了在信号处理中广泛使用外,它还用于大量科学计算。 由于大多数应用程序处理庞大的矩阵,因此计算通常需要大量的时间,从而减慢算法。 这使得算法几乎不可能用于实时应用程序。 在本文中,我们尝试使用图形处理单元(GPU)来减少执行时间。 GPU基本上是显卡,可以非常实惠的成本提供,并且在所有计算机中都在增加。 我们使用由NVIDIA引入的Compute Unified Device架构CUDA进行编程GPU。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号