<?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">vestifm</journal-id><journal-title-group><journal-title xml:lang="ru">Известия Национальной академии наук Беларуси. Серия физико-математических наук</journal-title><trans-title-group xml:lang="en"><trans-title>Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1561-2430</issn><issn pub-type="epub">2524-2415</issn><publisher><publisher-name>The Republican Unitary Enterprise Publishing House "Belaruskaya Navuka"</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">vestifm-53</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>THE METHOD OF OBTAINING THE BOUNDARIES OF THE DOMAINS OF THE FUNCTIONS OF GLOBAL DEPENDENCES IN PARALLELING COMPUTATION PROBLEMS</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><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>Likhoded</surname><given-names>N. A.</given-names></name></name-alternatives><xref ref-type="aff" rid="aff-2"/></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>Mandrik</surname><given-names>P. A.</given-names></name></name-alternatives><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>Institute of Mathematics of the National Academy of Sciences of Belarus, Minsk</institution></aff></aff-alternatives><aff-alternatives id="aff-2"><aff xml:lang="ru"><institution>Белорусский государственный университет, Минск</institution></aff><aff xml:lang="en"><institution>Belarusian State University, Minsk</institution></aff></aff-alternatives><pub-date pub-type="collection"><year>2014</year></pub-date><pub-date pub-type="epub"><day>17</day><month>05</month><year>2016</year></pub-date><volume>0</volume><issue>2</issue><fpage>5</fpage><lpage>11</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Соболевский П.И., Лиходед Н.А., Мандрик П.А., 2016</copyright-statement><copyright-year>2016</copyright-year><copyright-holder xml:lang="ru">Соболевский П.И., Лиходед Н.А., Мандрик П.А.</copyright-holder><copyright-holder xml:lang="en">Sobolevsky P.I., Likhoded N.A., Mandrik P.A.</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://vestifm.belnauka.by/jour/article/view/53">https://vestifm.belnauka.by/jour/article/view/53</self-uri><abstract><p>Разработан способ получения областей определения функций глобальных зависимостей, основанный на уточненных аппроксимациях множества тайлов. Точное представление границ областей определения функций глобальных зависимостей позволяет избегать избыточных вычислений при выполнении коммуникационных операций и дает больше возможностей для распараллеливания зернистых алгоритмов.</p></abstract><trans-abstract xml:lang="en"><p>A method to obtain the domains of the functions of global dependences based on the refined approximations of the set of tiles is developed. The exact presentation of the boundaries of the domains of the functions of global dependences avoids redundant computations in the performance of communication operations and provides more opportunities for granular paralleling algorithms.</p></trans-abstract></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Xue J, Cai W. // Parallel Computing. 2002. Vol. 28, N 5. P. 915-939.</mixed-citation><mixed-citation xml:lang="en">Xue J, Cai W. // Parallel Computing. 2002. Vol. 28, N 5. P. 915-939.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Kim D., Rajopdhye S. Parameterized tiling for imperfectly nested loops // Technical Report CS-09-101, Colorado State University, Department of Computer Science, February 2009.</mixed-citation><mixed-citation xml:lang="en">Kim D., Rajopdhye S. Parameterized tiling for imperfectly nested loops // Technical Report CS-09-101, Colorado State University, Department of Computer Science, February 2009.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Tavarageri S., Hartono A., Baskaran M. et al. Parametric tiling of affine loop nests // Proc. 15th Workshop on Compilers for Parallel Computers. Vienna, Austria, July 2010.</mixed-citation><mixed-citation xml:lang="en">Tavarageri S., Hartono A., Baskaran M. et al. Parametric tiling of affine loop nests // Proc. 15th Workshop on Compilers for Parallel Computers. Vienna, Austria, July 2010.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Baskaran M., Ramanujam J., Sadayappan, P. Automatic C-to-CUDA code generation for affine programs // Proc. of the Compiler Construction, 19th International Conference. Part of the Joint European Conferences on Theory and Practice of Software. Paphos, Cyprus, March 2010.</mixed-citation><mixed-citation xml:lang="en">Baskaran M., Ramanujam J., Sadayappan, P. Automatic C-to-CUDA code generation for affine programs // Proc. of the Compiler Construction, 19th International Conference. Part of the Joint European Conferences on Theory and Practice of Software. Paphos, Cyprus, March 2010.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Толстиков А. А., Лиходед Н. А. Функции, определяющие информационную структуру зернистых алгоритмов // XI Белорусская математическая конференция: тез. докл. Междунар. науч. конф. Минск, Респ. Беларусь, 5-8 нояб. 2012 г. Минск, 2012. Ч. 3. С. 23-24.</mixed-citation><mixed-citation xml:lang="en">Толстиков А. А., Лиходед Н. А. Функции, определяющие информационную структуру зернистых алгоритмов // XI Белорусская математическая конференция: тез. докл. Междунар. науч. конф. Минск, Респ. Беларусь, 5-8 нояб. 2012 г. Минск, 2012. Ч. 3. С. 23-24.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Воеводин В. В., Воеводин Вл. В. Параллельные вычисления. СПб., 2002.</mixed-citation><mixed-citation xml:lang="en">Воеводин В. В., Воеводин Вл. В. Параллельные вычисления. СПб., 2002.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Соболевский П. И., Баханович С. В. // Весщ НАН Беларуи. Сер. фiз.-мат. навук. 2012. № 4. С. 111-117.</mixed-citation><mixed-citation xml:lang="en">Соболевский П. И., Баханович С. В. // Весщ НАН Беларуи. Сер. фiз.-мат. навук. 2012. № 4. С. 111-117.</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>
