Optimized description of algorithms of multiprocessing on the base of SAA of Glushkov
Keywords:
systems of algorithmic algebras (saa), transposition, predicates, method of pair exchange, sortingAbstract
The given paper considers the description of algorithms of sorting on the method of pair exchange in the base of the systems of the algorithmic algebras (SAA) of V. M. Glushkov. The results of a variant of modernization of sorting of data array had been analyzed.Downloads
-
PDF (Українська)
Downloads: 114
Abstract views: 120
Published
2010-11-12
How to Cite
[1]
T. B. Martyniuk, L. V. Ohorodniichuk, and M. S. Nasser, “Optimized description of algorithms of multiprocessing on the base of SAA of Glushkov”, Вісник ВПІ, no. 6, pp. 162–165, Nov. 2010.
Issue
Section
Information technologies and computer sciences
License
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
