Investigation of Parallel Applications for Heterogeneous Architectures Using the SYCL and OpenMP Standards
Abstract
The results of research on parallel applications for heterogeneous architectures using the SYCL standards and the DPC++ language, as well as OpenMP, developed by students of the Department of Applied Mathematics and Artificial Intelligence (AM&AI) at MPEI during research work are presented. As an applied problem, the search for shortest paths in graphs of various dimensions using the Bellman–Ford and delta‑step algorithms is considered. The impact of algorithm choice on the solution efficiency, as well as the heterogeneous multi-core architecture, is examined. The Bellman-Ford algorithm is easily parallelized and demonstrated excellent scalability. In contrast, using a GPU for the delta-step algorithm did not provide significant speedup due to the complexity of memory coordination and the need to repeatedly copy data between devices. Testing was conducted using the following hardware: an Intel Core i5-12400F CPU (6 cores, 12 threads) and an NVIDIA GeForce GTX1660 GPU (1408 CUDA cores). The test results show that even within a single computational task, different implementations can exhibit different behavior when the task parameters are changed. This confirms the importance of preliminary analysis and testing when choosing a hardware&software architecture for tasks requiring high performance. The developed software suite visualizes the dependence of parallel algorithm implementation speedup on the number of vertices in the graph for various method parameters and is successfully used in the educational and research processes of the AM&AI Department at MPEI.