Реалізація паралельного алгоритму швидкого сортування

Abstract

The paper considers the implementation of a parallel quick sort algorithm using multithreading in the Python programming language. Modern approaches to the organization of parallel computing are analyzed, mathematical modeling of the parallel algorithm is performed taking into account Amdahl’s and Gustafson’s laws, and a task flow graph of the algorithm is synthesized. The choice of the programming language and development environment is justified. A software implementation of the parallel quick sort algorithm using threads is developed, and a UML activity diagram of the algorithm is constructed. Program testing and analysis of the obtained results are carried out. The use of the developed algorithm makes it possible to increase data processing performance and efficiently utilize the resources of multicore computing systems.