Advanced Model of Parallel Sorting Algorithm with Ranking

The model of parallel sorting of a number array with ranking based on the simultaneous application of high-speed decrement/increment operations according to the number array and the array of their ranks is improved. Acceleration of the proposed algorithm is achieved by fixing the result of zeroing( n – 1) elements of the number array instead of its complete zeroing. The description of the algorithm of parallel sorting with ranking in a compact form using the basis of Glushkov’s system of algorithmic algebras (SAA) is given.