Skip to main content
SpringerLink
Log in

Peculiarities of the Parallel Sorting Algorithm with Rank Formation

  • Published:
Cybernetics and Systems Analysis Aims and scope

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 rank formation in the basis of Glushkov’s System of Algorithmic Algebras (SAA) is proposed.

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

  2. W. K. Pratt, Introduction to Digital Image Processing, CRC Press (2014).

    Google Scholar 

  3. V. Y. Osynskyi, T. B. Martyniuk, A. A. Kozlov, and M. S. Nasser Mokhamed, “Features of the optoelectronic realization of the sorting neural network,” Optoelectronic Information-Power Technologies, Vol. 18, No. 2, 58–67 (2009).

    Google Scholar 

  4. G. E. Tseitlin, “Design of serial sorting algorithms: classification, transformation, synthesis,” Programmirovanie, No. 3, 3–24 (1989).

    Google Scholar 

  5. G. E. Tseitlin, “Parallelization of sorting algorithms,” Cybern. Syst. Analysis, Vol. 25, No. 6, 790–798 (1989). https://doi.org/10.1007/BF01069781.

    Article  MathSciNet  Google Scholar 

  6. E. A. Yatsenko, “Regular schemes of algorithms of address sorting and search,” Upravl. Sistemy i Mashiny, No. 5, 61–66 (2004).

  7. 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/10.1007/s10559-006-0110-7.

    Article  MATH  Google Scholar 

  8. G. E. Tseitlin, “Structured programming in symbolic multiprocessing,” Cybern. Syst. Analysis, Vol. 19, No. 5, 614–625 (1983). https://doi.org/10.1007/BF01068755.

    Article  MathSciNet  MATH  Google Scholar 

  9. G. E. Tseitlin, “Glushkov algebras and clone theory,” Cybern. Syst. Analysis, Vol. 39, No. 4, 509–516 (2003). https://doi.org/10.1023/B:CASA.0000003501.97990.e5.

    Article  MathSciNet  MATH  Google Scholar 

  10. F. I. Andon, A. E. Doroshenko, G. E. Tseitlin, and E. A. Yatsenko, Algebraic–Algorithmic Models and Methods of Parallel Programming [in Russian], Akademperiodika, Kyiv (2007).

  11. P. I. Andon, A. Y. Doroshenko, and K. A. Zhereb, ”Programming high-performance parallel computations: formal models and graphics processing units,” Cybern. Syst. Analysis, Vol. 47, No. 4, 659–668 (2011). https://doi.org/10.1007/s10559-011-9346-y.

    Article  Google Scholar 

  12. F. I. Andon, A. E. Doroshenko, A. G. Beketov, V. A. Iovchev, and E. A. Yatsenko, “Software tools for automation of parallel programming on the basis of algebra of algorithms,” Cybern. Syst. Analysis, Vol. 51, No. 1, 142–149 (2015). https://doi.org/10.1007/s10559-015-9706-0.

    Article  MATH  Google Scholar 

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

  14. K. J. Thurber, Large Scale Computer Architecture: Parallel and Associative Processors, Hayden Book Company, Rochelle Park, N.J. (1976).

    Google Scholar 

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

    Google Scholar 

  16. T. Martyniuk, T. Vasilyeva, V. Suprigan, and M. AL-Heyari, “Features of sorting memory realization,” Proc. SPIE, Vol. 4425 (Selected Papers from the Intern. Conf. on Optoelectronic Information Technologies), 89–91 (2001).

  17. T. Martyniuk, L. Kupershtein, and A. Kozhemiako, Aspects of Difference-Slice Data Processing in Neural Network Structures [in Russian], LAMBERT Academic Publishing (2018).

  18. T. B. Martyniuk and V. V. Khomyuk, “Data array multiprocessing by difference slices,” Cybern. Syst. Analysis, Vol. 47, No. 6, 948–953 (2011). https://doi.org/10.1007/s10559-011-9374-7.

    Article  MathSciNet  Google Scholar 

  19. T. B. Martyniuk, A. V. Kozhemiako, and L. M. Kupershtein, “Formalization of the object classification algorithm,” Cybern. Syst Analysis, Vol. 51, No. 5, 751–756 (2015). https://doi.org/10.1007/s10559-015-9767-0.

    Article  MathSciNet  MATH  Google Scholar 

  20. H. Lorin, Sorting and Sort Systems, Addison-Wesley, Reading, MA (1975).

    MATH  Google Scholar 

  21. K. I. Kucherenko and E. F. Ochin, “Two-dimensional median image filtering processors based on sorting networks,” Avtometriya, No. 2, 13–19 (1988).

    Google Scholar 

  22. T. B. Martyniuk, N. O. Denysiuk, and B. I. Krukivskyi, “Associative processors with parallel-serial data processing,” Information Technology and Computer Engineering, Vol. 44, No. 1, 27–36 (2019). 10.31649/1999-9941-2019-44-1-27-36.

  23. T. B. Martyniuk and B. I. Krukivsky, “Model of parallel sorter for associative processor,” Visnyk of Vinnytsia Polytechnical Institute, No. 5 (152), 49–55 (2020). 10.31649/1997-9266-2020-152-5-49-55.

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, 2022, pp. 31–36.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Martyniuk, T.B., Krukivskyi, B.I. Peculiarities of the Parallel Sorting Algorithm with Rank Formation. Cybern Syst Anal 58, 24–28 (2022). https://doi.org/10.1007/s10559-022-00431-8

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-022-00431-8

Keywords

Search

Navigation