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(...

Full description

Saved in:
Bibliographic Details
Published inCybernetics and systems analysis Vol. 60; no. 1; pp. 45 - 49
Main Authors Martyniuk, T. B., Krukivskyi, B. I.
Format Journal Article
LanguageEnglish
Published New York Springer US 01.01.2024
Springer Nature B.V
Subjects
Acceleration
Arrays
Artificial Intelligence
Control
Mathematics
Mathematics and Statistics
Processor Architectures
Ranking
Software Engineering/Programming and Operating Systems
Sorting algorithms
Systems Theory
system of algorithmic algebras
decrement/increment
rank
parallel sorting
mask
Online AccessGet full text
ISSN1060-0396
1573-8337
DOI10.1007/s10559-024-00645-y

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1060-0396
1573-8337
DOI:10.1007/s10559-024-00645-y