<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">bsuir</journal-id><journal-title-group><journal-title xml:lang="ru">Доклады БГУИР</journal-title><trans-title-group xml:lang="en"><trans-title>Doklady BGUIR</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1729-7648</issn><issn pub-type="epub">2708-0382</issn><publisher><publisher-name>БГУИР</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">bsuir-829</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>Статьи</subject></subj-group></article-categories><title-group><article-title>ЭВРИСТИЧЕСКИЙ ГЕНЕТИЧЕСКИЙ АЛГОРИТМ ОПТИМИЗАЦИИ ВЫЧИСЛИТЕЛЬНЫХ КОНВЕЙЕРОВ</article-title><trans-title-group xml:lang="en"><trans-title>Heuristic genetic algorithm of computational pipelines optimization</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Прихожий</surname><given-names>А. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Prihozhy</surname><given-names>A. A.</given-names></name></name-alternatives><email xlink:type="simple">noemail@neicon.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Ждановский</surname><given-names>А. М.</given-names></name><name name-style="western" xml:lang="en"><surname>Zhdanouski</surname><given-names>A. M.</given-names></name></name-alternatives><email xlink:type="simple">noemail@neicon.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Карасик</surname><given-names>О. Н.</given-names></name><name name-style="western" xml:lang="en"><surname>Karasik</surname><given-names>O. N.</given-names></name></name-alternatives><email xlink:type="simple">noemail@neicon.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Маттавелли</surname><given-names>М. ..</given-names></name><name name-style="western" xml:lang="en"><surname>Mattavelli</surname><given-names>M. ..</given-names></name></name-alternatives><email xlink:type="simple">noemail@neicon.ru</email><xref ref-type="aff" rid="aff-2"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Белорусский национальный технический университет</institution></aff><aff xml:lang="en"><institution>Belarusian National Technical University</institution></aff></aff-alternatives><aff-alternatives id="aff-2"><aff xml:lang="ru"><institution>École polytechnique fédérale de Lausanne</institution></aff><aff xml:lang="en"><institution>École polytechnique fédérale de Lausanne</institution></aff></aff-alternatives><pub-date pub-type="collection"><year>2017</year></pub-date><pub-date pub-type="epub"><day>03</day><month>06</month><year>2019</year></pub-date><volume>0</volume><issue>1</issue><fpage>34</fpage><lpage>41</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Прихожий А.А., Ждановский А.М., Карасик О.Н., Маттавелли М..., 2019</copyright-statement><copyright-year>2019</copyright-year><copyright-holder xml:lang="ru">Прихожий А.А., Ждановский А.М., Карасик О.Н., Маттавелли М...</copyright-holder><copyright-holder xml:lang="en">Prihozhy A.A., Zhdanouski A.M., Karasik O.N., Mattavelli M...</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://doklady.bsuir.by/jour/article/view/829">https://doklady.bsuir.by/jour/article/view/829</self-uri><abstract><p>Проведен анализ вычислительных конвейеров и методов их оптимизации. Рассмотрен класс потоковых конвейеров, не использующих разделение вычислительных ресурсов и достигающих наибольшей производительности. Для этого класса рассмотрены задачи оптимизации конвейеров, решаемые для случайной логики в процессе высокоуровневого синтеза по поведенческим спецификациям на языках программирования и описания аппаратуры. Исследован эвристический генетический алгоритм оптимизации, применимый к проектам большого размера.</p></abstract><trans-abstract xml:lang="en"><p>An analysis of computational pipelines and their optimization methods has been performed. A class of dataflow pipelines that do not use resource sharing and obtain high throughput has been considered. Pipeline optimization tasks being solved during high-level synthesis from random logic behavioral specifications in programming and hardware description languages have been considered. A heuristic genetic optimization algorithm which is capable of handling large designs has been proposed and investigated.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>поток данных</kwd><kwd>вычислительный конвейер</kwd><kwd>высокоуровневый синтез</kwd><kwd>оптимизация</kwd></kwd-group><kwd-group xml:lang="en"><kwd>data flow</kwd><kwd>computational pipeline</kwd><kwd>high-level synthesis</kwd><kwd>optimization</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Scheduling and hardware sharing in pipelined data paths / K.S. Hwang [et. al.] // Proc. ICCAD-89, November 1989. P. 24-27.</mixed-citation><mixed-citation xml:lang="en">Scheduling and hardware sharing in pipelined data paths / K.S. Hwang [et. al.] // Proc. ICCAD-89, November 1989. P. 24-27.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Sun W., Wirthlin M., Neuendorffer S. FPGA pipeline synthesis design exploration using module selection and resource sharing // Trans. Comp.-Aided Des. Integ. Cir. Sys. 2007. Vol. 26, No. 2. P. 254-265.</mixed-citation><mixed-citation xml:lang="en">Sun W., Wirthlin M., Neuendorffer S. FPGA pipeline synthesis design exploration using module selection and resource sharing // Trans. Comp.-Aided Des. Integ. Cir. Sys. 2007. Vol. 26, No. 2. P. 254-265.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Bakshi S., Gajski D. Component Selection for High-Performance Pipelines // IEEE Trans. VLSI Syst. 1996. Vol. 4, No. 2. P. 181-194.</mixed-citation><mixed-citation xml:lang="en">Bakshi S., Gajski D. Component Selection for High-Performance Pipelines // IEEE Trans. VLSI Syst. 1996. Vol. 4, No. 2. P. 181-194.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Prihozhy A. High-level Synthesis through Transforming VHDL Models // System-on-Chip Methodologies and Design Languages. 2001. P. 135-146.</mixed-citation><mixed-citation xml:lang="en">Prihozhy A. High-level Synthesis through Transforming VHDL Models // System-on-Chip Methodologies and Design Languages. 2001. P. 135-146.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Dataflow/actor-oriented language for the design of complex signal processing systems / C. Lucarz [et. al.] // Proc. Conf. on Design and Architectures for Signal and Image processing, November 2008. P. 1-8.</mixed-citation><mixed-citation xml:lang="en">Dataflow/actor-oriented language for the design of complex signal processing systems / C. Lucarz [et. al.] // Proc. Conf. on Design and Architectures for Signal and Image processing, November 2008. P. 1-8.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Synthesis and Optimization of Pipelines for HW Implementations of Dataflow Programs / A. Prihozhy [et. al.] // IEEE Trans. on CAD of Integrated Circuits and Systems. 2016. Vol. 34, No. 10. P. 1613-1626.</mixed-citation><mixed-citation xml:lang="en">Synthesis and Optimization of Pipelines for HW Implementations of Dataflow Programs / A. Prihozhy [et. al.] // IEEE Trans. on CAD of Integrated Circuits and Systems. 2016. Vol. 34, No. 10. P. 1613-1626.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Rahman H., Prihozhy A., Mattavelli M. Pipeline Synthesis and Optimization of FPGA-Based Video Processing Applications with CAL // EURASIP Journal on Image and Video Processing. 2011. Vol. 19. P. 1-28.</mixed-citation><mixed-citation xml:lang="en">Rahman H., Prihozhy A., Mattavelli M. Pipeline Synthesis and Optimization of FPGA-Based Video Processing Applications with CAL // EURASIP Journal on Image and Video Processing. 2011. Vol. 19. P. 1-28.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
