×

Advanced model of parallel sorting algorithm with ranking. (English. Ukrainian original) Zbl 07840785

Cybern. Syst. Anal. 60, No. 1, 45-49 (2024); translation from Kibern. Sist. Anal. 60, No. 1, 55-60 (2024).
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.

MSC:

68Pxx Theory of data
68Wxx Algorithms in computer science
68-XX Computer science
Full Text: DOI

References:

[1] H. M. Hnatienko and V. E. Snytyuk, Expert Decision-Making Technologies [in Ukrainian], Maklaut LLC, Kyiv (2008).
[2] Schlesinger, M.; Hlavach, V., Ten Lectures on Statistical and Structural Recognition (2004), Kyiv: Naukova Dumka, Kyiv
[3] F. G. Luger, Artificial Intelligence: Structures and Strategies for Complex Problem Solving, Addison-Wesley Publ. (2008).
[4] V. Lucas, “Answer ranking in community question answering: À deep learning approach,” Cornell Univ. (2022). doi:10.48550/arXiv.2212.01218.
[5] M. Shehata, M. Abdelnaeem, and O. Mokhiamar, “Integrated multiple criteria decision-making framework for ranking Pareto optimal solutions of the multiobjective optimization problem of tuned mass dampers,” Ocean Engineering, Vol. 278, No. 1, 14440 (2023).https://doi.org/10.1016j.oceaneng.2023.114440.
[6] Chambon, T.; Guillaume, J-L; Lallement, J., Information complexity ranking: A new method of ranking images by algorithmic complexity, Entropy, 25, 3, 439 (2023) · doi:10.3390/e25030439
[7] D. E. Knuth, The Art of Computer Programming, Vol. 3, Sorting and Searching, Addison-Wesley Longman, Inc., Reading (1998).
[8] Garland, M., Sorting Programming Massively Parallel Processors, Morgan Caufmann (2023) · doi:10.1016/B978-0-323-91231-0.00019-7
[9] R. Sedgewick, Algorithms in C++: Fundamentals, Data Structures, Sorting, Searching, Addison-Wesley (1998). · Zbl 0880.68050
[10] Martyniuk, TB, Structure of associative processor with bitwise serial processing of data, Engineering Simulation, 14, 383-389 (1997)
[11] T. Martyniuk, T. Vasilyeva, V. Suprigan, and M. Al-Heyari, “Features of sorting memory realization,” Proc. SPIE — The Intern. Society for Optical Engineering, Vol. 4425, 89-91 (2001).
[12] T. Martyniuk, B. Krukivskyi, L. Kupershtein, and V. Lukichov, “Neural network model of heteroassociative memory for the classification task,” Radioelectronic and Computer Systems, No. 2 (102), 108-117 (2022). doi:10.32620/reks.2022.2.09.
[13] Kohonen, T., Content-Addressable Memories (1987), Berlin-Heidelberg: Springer-Verlag, Berlin-Heidelberg · Zbl 0613.68009 · doi:10.1007/978-3-642-83056-3
[14] Martyniuk, TB; Krukivskyi, BI, Peculiarities of the parallel sorting algorithm with rank formation, Cybern. Syst. Analysis, 58, 1, 24-28 (2022) · Zbl 1490.68085 · doi:10.1007/s10559-022-00431-8
[15] Tzeitlin, GE, Design of sequential sorting algorithms: Classification, transformation, synthesis, Programmirovanie, No., 3, 3-24 (1989)
[16] F. I. Andon, A. E. Doroshenko, G. E. Tzeitlin, and E. A. Yatsenko, Algebro-Algorithmic Models and Methods of Parallel Programming [in Russian], Akademperiodika, Kyiv (2007).
[17] P. I. Andon, A. Yu. Doroshenko, K. A. Zhereb, and O. A. Yatsenko, Algebra-Algorithmic Models and Methods of Parallel Programming, Akademperiodyka, Kyiv (2018).
[18] Doroshenko, A.; Yatsenko, O., Formal and Adaptive Methods for Automation of Parallel Programs Construction: Emerging Research and Opportunities, IGI Global, Hershey (2021) · doi:10.4018/978-1-5225-9384-3
[19] Kozhemiako, VP; Martyniuk, TB; Khomyuk, VV, Distinctive features of structural programming of synchronous sorting algorithms, Cybern. Syst. Analysis, 42, 5, 714-723 (2006) · Zbl 1117.68021 · doi:10.1007/s10559-006-0110-7
[20] Lorin, H., Sorting and Sort Systems (1975), Mass: Addison-Wesley Publ. Co., Mass · Zbl 0337.68006
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.