Abstract
During recent years graphics processing unit (GPU) has become an inexpensive high-performance parallel computing units and general purpose computation on graphics processing unit (GPGPU) become an alternative of conventional CPU computation, which provide massive parallel computation capability to a normal computer over a system which uses only CPU. This paper investigates the performance of the algorithm for the solution of single source shortest path (SSSP) problem, all pair shortest path (APSP) problem and graph coloring problem for large graph on GPU regardless of a specific vendor. The application programming interface (API) used for programming in graphic processing unit is open compute language (OpenCL), it is a specification for heterogeneous computing. The performance of solutions on GPU is compared with the solution on CPU in term of their execution time. The result indicates the significant improvement in the performance of the solutions on GPU over solutions on CPU.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
