<?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">dan</journal-id><journal-title-group><journal-title xml:lang="ru">Доклады Национальной академии наук Беларуси</journal-title><trans-title-group xml:lang="en"><trans-title>Doklady of the National Academy of Sciences of Belarus</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1561-8323</issn><issn pub-type="epub">2524-2431</issn><publisher><publisher-name>The Republican Unitary Enterprise Publishing House "Belaruskaya Navuka"</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.29235/1561-8323-2018-62-5-525-530</article-id><article-id custom-type="elpub" pub-id-type="custom">dan-548</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><subj-group subj-group-type="section-heading" xml:lang="en"><subject>MATHEMATICS</subject></subj-group></article-categories><title-group><article-title>Плотные покрытия области вычислений  гексагональными тайлами</article-title><trans-title-group xml:lang="en"><trans-title>Dense coverage of the computational domain by hexagonal tiles</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>Sobolevsky</surname><given-names>P. I.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Соболевский Павел Иосифович – доктор физико-математических наук, профессор, главный научный сотрудник.</p><p>Ул. Сурганова, 11, 220072, Минск</p></bio><bio xml:lang="en"><p>Sobolevsky Pavel Iosiphovich – D. Sc. (Physics and Mathematics), Professor, Chief researcher.</p><p>11, Surganov Str., 220072, Minsk</p></bio><email xlink:type="simple">sobolevsky@im.bas-net.by</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>Bakhanovich</surname><given-names>S. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Баханович Сергей Викторович – кандидат физико-математических наук, ведущий научный сотрудник.</p><p>Ул. Сурганова, 11, 220072, Минск</p></bio><bio xml:lang="en"><p>Bakhanovich Sergei Viktorovich – Ph. D. (Physics and Mathematics), leading researcher.</p><p>11, Surganov Str., 220072, Minsk</p></bio><email xlink:type="simple">bsv@im.bas-net.by</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Институт математики Национальной академии наук Беларуси</institution></aff><aff xml:lang="en"><institution>Institute of Mathematics of the National Academy of Sciences of Belarus</institution></aff></aff-alternatives><pub-date pub-type="collection"><year>2018</year></pub-date><pub-date pub-type="epub"><day>29</day><month>10</month><year>2018</year></pub-date><volume>62</volume><issue>5</issue><fpage>525</fpage><lpage>530</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Соболевский П.И., Баханович С.В., 2018</copyright-statement><copyright-year>2018</copyright-year><copyright-holder xml:lang="ru">Соболевский П.И., Баханович С.В.</copyright-holder><copyright-holder xml:lang="en">Sobolevsky P.I., Bakhanovich S.V.</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.belnauka.by/jour/article/view/548">https://doklady.belnauka.by/jour/article/view/548</self-uri><abstract><p>Исследованы аспекты применения гексагонального тайлинга к алгоритмам с двумерной областью вычислений. Предложено формальное определение параметризованного гексагонального тайлинга. Получены необходимые и достаточные условия плотного покрытия области вычислений гексагональными тайлами.</p><p>Представлено членом-корреспондентом Л. А. Яновичем</p></abstract><trans-abstract xml:lang="en"><p>The hexagonal tiling in application to algorithms with a two-dimensional computational domain is investigated. A formal definition of a parametrized hexagonal tiling is proposed. Necessary and sufficient conditions for a dense coverage of the computational domain by hexagonal tiles are obtained.</p><p>Communicated by Corresponding Member Leonid A. Yanovich</p></trans-abstract><kwd-group xml:lang="ru"><kwd>тайлинг</kwd><kwd>гексагональный тайлинг</kwd><kwd>тайл</kwd><kwd>оптимизация программ</kwd><kwd>суперкомпьютер</kwd></kwd-group><kwd-group xml:lang="en"><kwd>tiling</kwd><kwd>hexagonal tiling</kwd><kwd>tile</kwd><kwd>code optimization</kwd><kwd>supercomputer</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">Подпрограмма «Математические методы» Государственной программы научных исследований «Конвергенция 2020»</funding-statement><funding-statement xml:lang="en">Subprogram “Mathematical Methods” of the State Research Program “Convergence 2020”</funding-statement></funding-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Xue, J. Loop Tiling For Parallelism / J. Xue. - Norwell, MA, USA: Kluwer Academic Publishers, 2000. https://doi.org/10.1007/978-1-4615-4337-4</mixed-citation><mixed-citation xml:lang="en">Xue J. Loop Tiling For Parallelism. Norwell, MA, USA, Kluwer Academic Publishers, 2000. https://doi.org/10.1007/978-1-4615-4337-4</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Parameterized tiled loops for free / L. Renganarayanan [et al.] // SIGPLAN Conference on Programming Language Design and Implementation. - New York, NY, USA: ASMPress, 2007. - P. 405-414.</mixed-citation><mixed-citation xml:lang="en">Renganarayanan L., Kim D., Rajopadhye S., Strout M. Parameterized tiled loops for free. SIGPLAN Conference on Programming Language Design and Implementation. New York, NY, USA, ASMPress, 2007, pp. 405-414.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">DynTile: Parametric Tiled Loop Generation for Parallel Execution on Multicore Processors / A. Hartono [et al.] // 24th International Parallel and Distributed Processing Symposium (2010 IPDPS Conference). - Atlanta, 2010.</mixed-citation><mixed-citation xml:lang="en">Hartono A., Baskaran M., Ramanujam J., Sadayappan P. DynTile: Parametric Tiled Loop Generation for Parallel Execution on Multicore Processors. 24th International Parallel and Distributed Processing Symposium (2010 IPDPS Conference), Atlanta, 2010.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Bakhanovich, S. V. Parametrized Tiling: Accurate Approximations and Analysis of Global Dependences / S. V. Bakha-novich, P. I. Sobolevsky // Computational Mathematics and Mathematical Physics. - 2014. - Vol. 54, N 11. - P. 1748-1758. https://doi.org/10.1134/s0965542514110037</mixed-citation><mixed-citation xml:lang="en">Bakhanovich S. V., Sobolevsky P. I. Parametrized Tiling: Accurate Approximations and Analysis of Global Dependences. Computational Mathematics and Mathematical Physics, 2014, vol. 54, no. 11, pp. 1748-1758. https://doi.org/10.1134/s0965542514110037</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">The Relation Between Diamond Tiling and Hexagonal Tiling / T. Grosser [et al.] // First International Workshop on High-Performance Stencil Computations, January 21, 2014. - Vienna, Austria, 2014.</mixed-citation><mixed-citation xml:lang="en">Grosser T., Verdoolaege S., Cohen A., Sadayappan P. The Relation Between Diamond Tiling and Hexagonal Tiling. First International Workshop on High-Performance Stencil Computations, Vienna, Austria, 2014.</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>
