Realization of Dijkstra Graph Algorithms Based on OpenCL

Nowadays, biomedical imaging involves more and more imaging data, which needs quickly calculate the shortest curvature value.Shortest path algorithm plays an important role in this application, dijkstra algorithm is a common algorithm for calculating the shortest path from source to other nodes.In the past, the shortest path algorithm was considered to be too slow on the CPU to be used for curvature calculations in cross-disciplinary and curvature measurement types.The OpenCL architecture, based on heterogeneous platforms, is an industry-standard framework that can be used as a coprocessor for general purpose computing.The curvature of the cerebral cortex is a hotspot in biomedical research.We use OpenCL to accelerate the calculation of the advantages of the field of high-performance computing and achieve the Dijkstra algorithm for parallel programming.The experimental results show that we get 4.73-9.69 times speedup, which shows that OpenCL has a good acceleration effect, and the shortest path algorithm has achieved a good improvement.