Parallel Implementation of Dynamic Programming Algorithm Using Graphics Processing Unit

M. Khurram Rehman, M. Umer Sarwar, M. Ramzan Talib, M. Salman Mansoor, M. Bilal Sarwar
Department of Computer Science, GC University, Faisalabad, Pakistan
International Journal of Computer Science and Management Research (IJCSMR), Volume 2, Issue 4, 2013

   title={Parallel Implementation of Dynamic Programming Algorithm Using Graphics Processing Unit},

   author={Rehman, M Khurram and Sarwar, M Umer and Talib, M Ramzan and Mansoor, M Salman and Sarwar, M Bilal},



Download Download (PDF)   View View   Source Source   



In this research implementation of a dynamic programming algorithm (Viterbi) has been done on graphics processing unit of NVidia using CUDA model. As graphical processing units are becoming important in supporting central processing units for the acceleration of complex floating point calculations. The complex computation goes on parallel in graphics processing unit as it contains hundreds of processing units as compared to central processing units which have only extended up to tens of cores yet. Because of this capacity of graphics processing units complex computations can be accelerated up to 10-100 times and even more depending upon the program. And more importantly data transfer between central processing unit and graphics processing unit do not create a bottleneck because latest PCI bus can transfer data up to 8 GB/s. Recently two main graphics processing unit’s architectures are becoming popular one is the CUDA (Compute Unified Device Architecture) and the other one is ATI Stream. CUDA is modification of C language with some extensions and limitations. Here a dynamic programming algorithm named "viterbi" has been implemented in CUDA using graphics processing unit and concluded that it has been accelerated from 3 to 6 times as compared to the serial execution on central processing unit. This research can help in future implementation of dynamic programming algorithms using matrix-matrix multiplication approach instead of matrix-vector multiplication approach which can speed up the processing of this kind of algorithms. This research has explored the use of the graphics processing unit in Viterbi algorithm which is used for sequence alignment, keyword spotting system etc.
VN:F [1.9.22_1171]
Rating: 0.0/5 (0 votes cast)

* * *

* * *

Follow us on Twitter

HGPU group

1666 peoples are following HGPU @twitter

Like us on Facebook

HGPU group

339 people like HGPU on Facebook

* * *

Free GPU computing nodes at hgpu.org

Registered users can now run their OpenCL application at hgpu.org. We provide 1 minute of computer time per each run on two nodes with two AMD and one nVidia graphics processing units, correspondingly. There are no restrictions on the number of starts.

The platforms are

Node 1
  • GPU device 0: nVidia GeForce GTX 560 Ti 2GB, 822MHz
  • GPU device 1: AMD/ATI Radeon HD 6970 2GB, 880MHz
  • CPU: AMD Phenom II X6 @ 2.8GHz 1055T
  • RAM: 12GB
  • OS: OpenSUSE 13.1
  • SDK: nVidia CUDA Toolkit 6.5.14, AMD APP SDK 3.0
Node 2
  • GPU device 0: AMD/ATI Radeon HD 7970 3GB, 1000MHz
  • GPU device 1: AMD/ATI Radeon HD 5870 2GB, 850MHz
  • CPU: Intel Core i7-2600 @ 3.4GHz
  • RAM: 16GB
  • OS: OpenSUSE 12.3
  • SDK: AMD APP SDK 3.0

Completed OpenCL project should be uploaded via User dashboard (see instructions and example there), compilation and execution terminal output logs will be provided to the user.

The information send to hgpu.org will be treated according to our Privacy Policy

HGPU group © 2010-2015 hgpu.org

All rights belong to the respective authors

Contact us: