Utilization of OpenCL for large graph problems on graphics processing unit

DOI10.1016/j.endm.2017.11.007zbMath1383.05113OpenAlexW2771817287MaRDI QIDQ2413347

Pankaj Singh Sammal, Vinod Kumar Mishra

Publication date: 10 April 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.11.007

zbMATH Keywords

graph coloringgraphics processing unitsingle source shortest pathall pair shortest path

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Uses Software

• CUDA
• OpenCL

Cites Work

• Solving path problems on the GPU
• A Survey on Parallel Computing and its Applications in Data-Parallel Problems Using GPU Architectures
• Unnamed Item
• Unnamed Item

This page was built for publication: Utilization of OpenCL for large graph problems on graphics processing unit