Skip to main content
SpringerLink
Log in

Advanced Model of Parallel Sorting Algorithm with Ranking

  • Published:
Cybernetics and Systems Analysis Aims and scope

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

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. H. M. Hnatienko and V. E. Snytyuk, Expert Decision-Making Technologies [in Ukrainian], Maklaut LLC, Kyiv (2008).

  2. M. Schlesinger and V. Hlavach, Ten Lectures on Statistical and Structural Recognition [in Russian], Naukova Dumka, Kyiv (2004).

    Google Scholar 

  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). https://doi.org/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. T. Chambon, J.-L. Guillaume, and J. Lallement, “Information complexity ranking: A new method of ranking images by algorithmic complexity,” Entropy, Vol. 25, No. 3, 439 (2023). https://doi.org/https://doi.org/10.3390/e25030439.

    Article  MathSciNet  PubMed  PubMed Central  ADS  Google Scholar 

  7. D. E. Knuth, The Art of Computer Programming, Vol. 3, Sorting and Searching, Addison-Wesley Longman, Inc., Reading (1998).

  8. M. Garland, Sorting Programming Massively Parallel Processors, Morgan Caufmann (2023). https://doi.org/https://doi.org/10.1016/B978-0-323-91231-0.00019-7.

    Article  Google Scholar 

  9. R. Sedgewick, Algorithms in C++: Fundamentals, Data Structures, Sorting, Searching, Addison-Wesley (1998).

  10. T. B. Martyniuk, “Structure of associative processor with bitwise serial processing of data,” Engineering Simulation, Vol. 14, 383–389 (1997).

    Google Scholar 

  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). https://doi.org/10.32620/reks.2022.2.09.

  13. T. Kohonen, Content-Addressable Memories, Springer-Verlag, Berlin–Heidelberg (1987).

    Book  Google Scholar 

  14. T. B. Martyniuk and B. I. Krukivskyi, “Peculiarities of the parallel sorting algorithm with rank formation,” Cybern. Syst. Analysis, Vol. 58, No. 1, 24–28 (2022). https://doi.org/https://doi.org/10.1007/s10559-022-00431-8.

    Article  Google Scholar 

  15. G. E. Tzeitlin, “Design of sequential sorting algorithms: Classification, transformation, synthesis,” Programmirovanie, No. 3, 3–24 (1989).

    MathSciNet  Google Scholar 

  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. A. Doroshenko and O. Yatsenko, Formal and Adaptive Methods for Automation of Parallel Programs Construction: Emerging Research and Opportunities, IGI Global, Hershey (2021). https://doi.org/https://doi.org/10.4018/978-1-5225-9384-3.

    Article  Google Scholar 

  19. V. P. Kozhemiako, T. B. Martyniuk, and V. V. Khomyuk, “Distinctive features of structural programming of synchronous sorting algorithms,” Cybern. Syst. Analysis, Vol. 42, No. 5, 714–723 (2006). https://doi.org/https://doi.org/10.1007/s10559-006-0110-7.

    Article  Google Scholar 

  20. H. Lorin, Sorting and Sort Systems, Addison-Wesley Publ. Co., Mass. (1975).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Vinnytsia National Technical University, Vinnytsia, Ukraine

    T. B. Martyniuk & B. I. Krukivskyi

Authors
  1. T. B. Martyniuk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. I. Krukivskyi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to T. B. Martyniuk.

Additional information

Translated from Kibernetyka ta Systemnyi Analiz, No. 1, January–February, 2024, pp. 55–60; https://doi.org/10.34229/KCA2522-9664.24.1.5

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Martyniuk, T.B., Krukivskyi, B.I. Advanced Model of Parallel Sorting Algorithm with Ranking. Cybern Syst Anal 60, 45–49 (2024). https://doi.org/10.1007/s10559-024-00645-y

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-024-00645-y

Keywords

Search

Navigation