Peculiarities of the Parallel Sorting Algorithm with Rank Formation

dc.contributor.author	Martyniuk, Т. B.	en
dc.contributor.author	Krukivskyi, B. I.	en
dc.contributor.author	Мартинюк, Т. Б.	uk
dc.contributor.author	Круківський, Б. І	uk
dc.date.accessioned	2023-02-09T09:01:27Z
dc.date.available	2023-02-09T09:01:27Z
dc.date.issued	2022
dc.identifier.citation	Martyniuk T. B. Peculiarities of the Parallel Sorting Algorithm with Rank Formation [Text] / T. B. Martyniuk, B. I. Krukivskyi // Cybernetics and Systems Analysisthis. – 2022. – Vol. 58, № 1. – P. 24–28.	en
dc.identifier.issn	1060-0396
dc.identifier.uri	http://ir.lib.vntu.edu.ua//handle/123456789/36361
dc.description.abstract	A new approach to parallel sorting of an array of numbers with formation of their ranks is analyzed. In the sorting process, operations, such as a decrement operation to process elements of a numerical array, and an increment operation to form their ranks are performed. A description of the parallel sorting algorithm with ran	en
dc.language.iso	en	en
dc.publisher	Інститут математики НАН України	uk
dc.relation.ispartof	Cybernetics and Systems Analysisthis. Vol. 58, № 1 : 24–28.	en
dc.relation.uri	https://link.springer.com/article/10.1007/s10559-022-00431-8
dc.subject	system of algorithmic algebras	en
dc.subject	parallel sorting	en
dc.subject	numerical slice	en
dc.subject	rank	en
dc.subject	mask	en
dc.title	Peculiarities of the Parallel Sorting Algorithm with Rank Formation	en
dc.type	Article