Distinctive features of structural programming of synchronous sorting algorithms

Abstract

Parallel (synchronous) algorithms of sorting arrays are considered. A modified synchronous sorting algorithm based on the pairwise exchange method is proposed and simulated.Keywords: synchronous sorting algorithm, sorting by the pairwise exchange method, systems of algorithmic algebras.

Analysis of Features of Analog-to-Digital Conversion “Duration-Code”

“…Особливості одиничного кодування інформації Особливістю АЦ перетворення «тривалість-код» за виразом (1) є те, що найбільш природним для кодування вихідної цифрової інформації є одиничний код [5,10,11]. Відомо три різновиди одиничних кодів: одиничний парний, одиничний нормальний та одиничний позиційний коди [10 -12].…”

“…Очевидно, що для апаратного запису, збереження та зчитування одиничних кодів доцільно використовувати зсувні регістри як аналог так званих операційних модулів, що містять лінійку з n бістабільних елементів [4,5,10]. Останні зорієнтовано на реалізацію на оптоелектронній елементній базі.…”

Data array multiprocessing by difference slices

“…According to the classification of the processing of elements of the array [1, 3], we will consider below the left-hand processing of the array Ì as a result of the cyclic shift of the pointer ù from left to right. Along with the well-known structural programming structures such as composition, alternative, and cycle [2,7], decomposition ( ) A B + is often employed as the operation of parallel application of the operators À and  used for the description of synchronous algorithms of sorting by pairwise exchange [4]. The basic conditions (predicates) include the conditions known from [2,3], namely, l r £ is true if this relation is true for neighboring elements l and r of the array; d ( * ) is true once the pointer ù has attained the marker * , and a new condition: g is true if the relation min = 0 holds for the minimum value in the array Ì.…”

“…These publication have confirmed the universality of the apparatus of structured program schemes, its ample opportunities in the analysis, classification, and development of new algorithms with optimal characteristics [2][3][4]6]. The further development of algebraic algorithmics promotes the development and analysis of families of algebras that are adequate to the basic paradigms of programming and are intended for the formalized description of various discrete models such as logic, theoretic-automatic, grammatical, and algorithmic [7][8][9].…”

“…Structural programming of sorting algorithms are discussed in detail in [1][2][3][4][5]. These publication have confirmed the universality of the apparatus of structured program schemes, its ample opportunities in the analysis, classification, and development of new algorithms with optimal characteristics [2][3][4]6].…”