Evolutionary Development of Generic Sorting Networks by Means of Rewriting Systems
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F20%3APU135157" target="_blank" >RIV/00216305:26230/20:PU135157 - isvavai.cz</a>
Result on the web
<a href="https://ieeexplore.ieee.org/document/8720059" target="_blank" >https://ieeexplore.ieee.org/document/8720059</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/TEVC.2019.2918212" target="_blank" >10.1109/TEVC.2019.2918212</a>
Alternative languages
Result language
angličtina
Original language name
Evolutionary Development of Generic Sorting Networks by Means of Rewriting Systems
Original language description
This paper presents an evolutionary developmental method for the design of arbitrarily growing sorting networks. The developmental model is based on a parallel rewriting system (a grammar) that is specified by an alphabet, an initial string (an axiom), and a set of rewriting rules. The rewriting process iteratively expands the axiom in order to develop more complex strings during a series of development steps (i.e., derivations in the grammar). A mapping function is introduced that allows for converting the strings onto comparator structures-building blocks of sorting networks. The construction of the networks is performed in such a way that a given (initial) sorting network grows progressively by adding further building blocks within each development step. For a given (fixed) alphabet, the axiom together with the rewriting rules themselves are the subjects of the evolutionary search. It will be shown that suitable grammars can be evolved for the construction of arbitrarily large sorting networks that grow with various given sizes of development steps. Moreover, the resulting networks exhibit significantly better properties (the number of comparators and delay) in comparison with those obtained by means of similar existing methods.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/LQ1602" target="_blank" >LQ1602: IT4Innovations excellence in science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
ISSN
1089-778X
e-ISSN
1941-0026
Volume of the periodical
24
Issue of the periodical within the volume
2
Country of publishing house
US - UNITED STATES
Number of pages
13
Pages from-to
232-244
UT code for WoS article
000524328700003
EID of the result in the Scopus database
2-s2.0-85082996317