DOI:
10.34229/KCA2522-9664.24.1.5
UDC 004.94.2
ADVANCED MODEL OF PARALLEL SORTING ALGORITHM WITH RANK FORMATION
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 Glushkov’s system of algorithmic algebras (SAA) is given
.
Keywords: system of algorithmic algebras, parallel sorting, mask, rank, decrement/increment.
full text
REFERENCES
- Hnatienko H.M., Snityuk V.E. Expert decision-making technologies [in Ukrainian]. Kyiv: "Maclaut" LLC, 2008. 444 p.
- Shlesinger M., Glavach V. Ten lectures on statistical and structural recognition [in Russian]. Kyiv: Nauk. dumka, 2004. 548 p.
- George F. Luger. Artificial intelligence: Structures and strategies for complex problem solving. 6th ed. Publisher: Addison-Wesley, 2008. 792 p.
- Lucas V. Answer ranking in community question answering: А deep learning approach. Cornell University, 2022. 72 p. https://doi.org/10.48550/arXiv.2212.01218 .
- Shehata M., Abdelnaeem M., Mokhiamar O. Integrated multiple criteria decision-making framework for ranking Pareto optimal solutions of the multiobjective optimization problem of tuned mass dampers. Ocean Engineering. 2023. Vol. 278, N 114440. https://doi.org/10.1016j.oceaneng.2023.114440.
- Chambon T., Guillaume Jean-Loup, Lallement J. Information complexity ranking: A new method of ranking images by algorithmic complexity. Entropy. 2023. Vol. 25, N 3. P. 439. https://doi.org/10.3390/e25030439 .
- Knuth D.E. The art of computer programming. V.3, Sorting and Searching. Reading: Addison-Wesley Longman, Inc., 1998. 800 p.
- Garland M. Sorting Programming massively parallel processors. (Fourth Edition). Morgan Caufmann, 2023. 551 p. https://doi.org/10.1016/B978-0-323-91231-0.00019-7.
- Sedgewick R. Algorithms in C++: Fundamentals, data structures, sorting, searching. Addison-Wesley, 1998. 716 p.
- Martyniuk T.B. Structure of associative processor with bitwise serial processing of data. Engineering Simulation. 1997. Vol. 14. P. 383–389.
- Martyniuk T., Vasilyeva T., Suprigan V., AL-Heyari M. Features of sorting memory realization. Proceedings of SPIE-The International Society for Optical Engineering. 2001. Vol. 4425. P. 89–91.
- Martyniuk T., Krukivskyi B., Kupershtein L., Lukichov V. Neural network model of heteroassociative memory for the classification task. Radioelectronic and Computer Systems. 2022. № 2(102). P. 108–117. https://doi.org/10.32620/reks.2022.2.09 .
- Kohonen T. Content-addressable memories. Berlin; Heidelberg: Springer-Verlag, 1987. 388 p.
- Martyniuk T.B., Krukivskyi B.I. Peculiarities of the parallel sorting algorithm with rank formation. Cybernetics and Systems Analysis. 2022. Vol. 58, N 1. P. 24–28. https://doi.org/10.1007/s10559-022-00431-8 .
- Tseytlin G.E. Design of sequential sorting algorithms: classification, transformation, synthesis. Programmirovanie. 1989. N3. P. 3–24.
- Andon F.I., Doroshenko A.E., Tseytlin G.E., Yatsenko E.A. Algebraic algorithmic models and parallel programming methods [in Russian]. Kyiv: Akademperiodika, 2007. 631 p.
- Andon P.I., Doroshenko A.Yu., Zhereb K.A., Yatsenko O.A. Algebra-algorithmic models and methods of parallel programming. Kyiv: Akademperiodyka, 2018. 192 p.
- Doroshenko A., Yatsenko O. Formal and adaptive methods for automation of parallel programs construction: emerging research and opportunities. Hershey: IGI Global, 2021. 279 p. https://doi.org/10.4018/978-1-5225-9384-3.
- Kozhemiako V.P., Martyniuk T.B., Khomyuk V.V. Distinctive features of structural programming of synchronous sorting algorithms. Cybernetics and Systems Analysis. 2006. Vol. 42, N 5. P. 714–723.
- Lorin H. Sorting and sort systems. Mass.: Addison-Wesley Publishing Company, 1975. 373 p.
