Abstract
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 array of numbers 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 the formation of ranks in a compact form using the basis of Glushkov’s system of algorithmic algebras (SAA) is given. Keywords: system of algorithmic algebras, parallel sorting, mask, rank, decrement/increment.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
