Abstract
Parallel (synchronous) algorithms of sorting arrays are considered. A modified synchronous sorting algorithm based on the pairwise exchange method is proposed and simulated.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. I. Kucherenko and Ye. F. Ochin, “Processors of two-dimensional median filtering of images on the basis of sorting networks,” Avtometriya, No. 2, 13–19 (1988).
V. N. Kustov, “Parallel sorting in switching networks,” Automat. Vychisl. Tekhn., No. 3, 76–81 (1989).
V. F. Guzik, V. Ye. Zolotovskii, and S. A. Chinenkov, “Organization of various sorting methods in computing systems,” Elektronnoe Modelirovanie, 14, No. 3, 25–28 (1992).
V. R. Grigor’yev and S. P. Naumov, “Neural-net organization of sorting algorithms on a three-dimensional optical neural network chip,” Avtometriya, No. 3, 28–37 (1993).
Ya. Ye. Romm, “Parallel merge sort using comparison matrices. I,” Cybernetics and Systems Analysis, No. 5, 3–23 (1994).
V. A. Vyshinskii, “Sorting numbers in a matrix-algebraic computer,” USiM, No. 2, 50–52 (2001).
T. B. Martynuyk, “Organization of an associative processor with sequential bit-by-bit data processing,” Elektronnoe Modelirovanie, 18, No. 3, 28–31 (1996).
D. D. Zerbino and I. G. Tsmots, “A processor for sorting numbers on the basis of cellular automata,” in: 3rd Ukrainian Conf. on Automatic Control “Avtomatika-96,” Vol. 1, SevGTU, Sevastopol (1996), pp. 177–179.
H. Lorin, Sorting and Sort Systems [Russian translation], Mir, Moscow (1983).
D. Knut, The Art of Computer Programming [Russian translation], Vol. 3, Sorting and Searching, Mir, Moscow (1978).
I. V. Prangishvili, S. Ya. Vilenkin, and L. I. Medvedev, Parallel Computing Systems under Shared Control [in Russian], Energoatomizdat, Moscow (1983).
V. M. Glushkov, G. Ye. Tseitlin, and E. L. Yushchenko, Method of Symbolic Multiprocessing [in Russian], Naukova Dumka, Kiev (1980).
G. Ye. Tseitlin, “Structured programming in symbolic multiprocessing,” Kibernetika, No. 5, 22–30 (1983).
V. M. Glushkov, G. Ye. Tseitlin, and Ye. L. Yushchenko, Algebra, Languages, and Programming [in Russian], Naukova Dumka, Kiev (1989).
G. Ye. Tseitlin, “Designing sequential sorting algorithms: Classification, transformation, and synthesis,” Programmirovanie, No. 3, 3–24 (1989).
G. Ye. Tseitlin, “Parallelization of sorting algorithms,” Kibernetika, No. 6, 67–74 (1989).
T. B. Martinyuk, V. V. Homyuk, R. A. Rasenko, and S. A. Emin, “Analysis of time characteristics in sorting randomly distributed data,” Visn. Vinnitsk. Politekh. Inst., No. 1, 34–38 (2003).
V. I. Shinkarenko, “Estimating the efficiency of algorithms taking into account the architecture of a computer,” in: Proc. Intern. Scientific and Methodical Conf. “Computer simulation,” Dneprodzerzhinsk (2000), pp. 268–269.
Author information
Authors and Affiliations
Additional information
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 122–133, September–October 2006.
Rights and permissions
About this article
Cite this article
Kozhemiako, V.P., Martyniuk, T.B. & Khomyuk, V.V. Distinctive features of structural programming of synchronous sorting algorithms. Cybern Syst Anal 42, 714–723 (2006). https://doi.org/10.1007/s10559-006-0110-7
Received:
Issue Date:
DOI: https://doi.org/10.1007/s10559-006-0110-7