Реалізація паралельного алгоритму сортування вибором за допомогою технології OpenCL

Abstract

The development of the Selection Sort algorithm is considered, and the features of its sequential and parallel implementations using OpenCL technology are studied. The issue of analyzing existing approaches to sorting algorithm implementation in order to improve computational performance is addressed, the choice of tools for developing a software module in C++ and the OpenCL library for parallel computing is justified, class diagrams of the software module are developed, and the choice of the software implementation environment is substantiated. In the work, software implementations of the Selection Sort algorithm in sequential and parallel forms are created, and a comparative analysis of their execution time is performed. The software module is tested on various types of data arrays.