Parallel Sorting Algorithm for the Operation of Industrial Intelligent Systems

Abstract

A parallel even-odd sort algorithm has been identified and developed as a basis. The switching circuit consists of two alternating options for switching elements in pairs. These switchings are based on the local on-device assembling in pairs of array elements having adjacent indices. Moreover, such local on-device assembling of elements in pairs leads to “small” movements of elements along the length of array and the regular character of pairs generation. In each pair, we performed an operand comparison-exchange operation. Reducing the time of sorting is based on designing the switching options with a ring structure of elements. A comparison of classical and modified algorithms has shown the advantage of array ring structure, in which pairs of boundary elements are created at each sorting step. The given paper shows the advantage of the modified sorting over the standard even-odd sort by 15% -18% for the operation of industrial intelligent systems.