<?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 custom-type="elpub" pub-id-type="custom">dan-242</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>FUNCTIONS ASSIGNING THE DEPENDENCES OF GRAINED ALGORITHMS</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>LIKHODED</surname><given-names>N. A.</given-names></name></name-alternatives><email xlink:type="simple">likhoded@bsu.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>TOLSTIKOV</surname><given-names>A. A.</given-names></name></name-alternatives><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><institution>Белорусский государственный университет, Минск</institution><country>Belarus</country></aff><pub-date pub-type="collection"><year>2014</year></pub-date><pub-date pub-type="epub"><day>10</day><month>06</month><year>2016</year></pub-date><volume>58</volume><issue>4</issue><fpage>35</fpage><lpage>41</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">LIKHODED N.A., TOLSTIKOV A.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://doklady.belnauka.by/jour/article/view/242">https://doklady.belnauka.by/jour/article/view/242</self-uri><abstract><p>Разработан метод получения информационной структуры зернистых алгоритмов с аффинными зависимостями. Сформулированы и доказаны утверждения, позволяющие формализовать нахождение всех функций зависимостей глобального уровня.</p></abstract><trans-abstract xml:lang="en"><p>In case of parallel grained affine algorithm a method of obtaining dependences is developed. Propositions to formalize the dependences in parallel grained algorithms are stated and proved.</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. G., Rajopadhye S. // Technical Report CS-09-101, Colorado State University, Department of Computer Science, February. 2009. – 21 p.</mixed-citation><mixed-citation xml:lang="en">Kim D. G., Rajopadhye S. // Technical Report CS-09-101, Colorado State University, Department of Computer Science, February. 2009. – 21 p.</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. // Proc. 15th Workshop on Compilers for Parallel Computers. Vienna, Austria. 2010. July.</mixed-citation><mixed-citation xml:lang="en">Tavarageri S., Hartono A., Baskaran M. et al. // Proc. 15th Workshop on Compilers for Parallel Computers. Vienna, Austria. 2010. July.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Baskaran M., Ramanujam J., Sadayappan P. // Proceedings of the Compiler Construction, 19th International Conference. Part of the Joint European Conferences on Theory and Practice of Software. Paphos, Cyprus. 2010. March.</mixed-citation><mixed-citation xml:lang="en">Baskaran M., Ramanujam J., Sadayappan P. // Proceedings of the Compiler Construction, 19th International Conference. Part of the Joint European Conferences on Theory and Practice of Software. Paphos, Cyprus. 2010. March.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Di P., Ye D., Su Yu et al. // 41st International Conference on Parallel Processing. Pittsburgh, 2012. P. 350–359.</mixed-citation><mixed-citation xml:lang="en">Di P., Ye D., Su Yu et al. // 41st International Conference on Parallel Processing. Pittsburgh, 2012. P. 350–359.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Bandishti V., Pananilath I., Bondhugula U. // Proceedings of Supercomputing. Los Alamitos, CA, USA. IEEE Computer Society Press, 2012. P. 40:1–40:11.</mixed-citation><mixed-citation xml:lang="en">Bandishti V., Pananilath I., Bondhugula U. // Proceedings of Supercomputing. Los Alamitos, CA, USA. IEEE Computer Society Press, 2012. P. 40:1–40:11.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Воеводин В. В., Воеводин Вл. В. Параллельные вычисления. СПб., 2002. – 608 с.</mixed-citation><mixed-citation xml:lang="en">Воеводин В. В., Воеводин Вл. В. Параллельные вычисления. СПб., 2002. – 608 с.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Лиходед Н. А., Соболевский П. И. // Докл. НАН Беларуси. 2011. Т. 55, № 2. С. 22–26.</mixed-citation><mixed-citation xml:lang="en">Лиходед Н. А., Соболевский П. И. // Докл. НАН Беларуси. 2011. Т. 55, № 2. С. 22–26.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</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-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>
