Comparison of Open MP and CUDA

Authors

  • Nawaz FKM School of Computer Science and Engineering, VIT University Vellore, INDIA,
  • Chattopadhyay A School of Computer Science and Engineering, VIT University Vellore, INDIA,
  • Kirthan G J School of Computer Science and Engineering, VIT University Vellore, INDIA,
  • Girish D Mane School of Computer Science and Engineering, VIT University Vellore, INDIA,
  • Rohith N Savanth School of Computer Science and Engineering, VIT University Vellore, INDIA,

Keywords:

OpenMP, CUDA, Matrix Multiplication, GPU, CPU

Abstract

In this paper we will study the architectures of both Open Mp and CUDA architectures and make some comparisons among both in terms of basic program execution time. We will use a basic serial version of Matrix Multiplication Algorithm and modify it in terms of CUDA and Open MP and study comparatively.

References

Kirk David B, Hwu Wen Mei. W, “programming massively parallel processors”, NVIDIA Elsevier, ISBN: 978-0-12-381472-2, Vol.10, 2010, pp.59-120.

Sanders Jason, Kandrot Edward, “Cuda By Example”, Addison – Wesley, ISBN-13: 978-0-13-138768-3, 2011, pp.37-57.

Niraj R Chauhan and Mayur S. Burange, “Multicore Heterogeneous Computing with OpenACC”, International Journal of Computer Science and Engineering E-ISSN: 2347-2693, Vol.2, Issue-3, 2014, pp.92-97.

Downloads

Published

2014-12-31

How to Cite

[1]
F. K. M. Nawaz, A. Chattopadhyay, G. J. Kirthan, G. D. Mane, and R. N. Savanth, “Comparison of Open MP and CUDA”, Int. J. Comp. Sci. Eng., vol. 2, no. 12, pp. 38–41, Dec. 2014.

Issue

Section

Research Article