<?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">sibsutis</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник СибГУТИ</journal-title><trans-title-group xml:lang="en"><trans-title>The Herald of the Siberian State University of Telecommunications and Information Science</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1998-6920</issn><publisher><publisher-name>СибГУТИ</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">sibsutis-453</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>Эвристические алгоритмы оптимизации информационных обменов в параллельных PGAS-программах</article-title><trans-title-group xml:lang="en"><trans-title>Heuristic algorithms of communication optimization in parallel PGAS-programs</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>Kulagin</surname><given-names>I. ..</given-names></name></name-alternatives><email xlink:type="simple">ivan.i.kulagin@gmail.com</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>Paznikov</surname><given-names>A. ..</given-names></name></name-alternatives><email xlink:type="simple">apaznikov@gmail.com</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>Kurnosov</surname><given-names>M. ..</given-names></name></name-alternatives><email xlink:type="simple">mkurnosov@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><institution>СибГУТИ</institution><country>Russian Federation</country></aff><pub-date pub-type="collection"><year>2014</year></pub-date><pub-date pub-type="epub"><day>26</day><month>10</month><year>2022</year></pub-date><volume>0</volume><issue>3</issue><fpage>52</fpage><lpage>66</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Кулагин И.И., Пазников А.А., Курносов М.Г., 2022</copyright-statement><copyright-year>2022</copyright-year><copyright-holder xml:lang="ru">Кулагин И.И., Пазников А.А., Курносов М.Г.</copyright-holder><copyright-holder xml:lang="en">Kulagin I..., Paznikov A..., Kurnosov 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://vestnik.sibsutis.ru/jour/article/view/453">https://vestnik.sibsutis.ru/jour/article/view/453</self-uri><abstract><p>В работе предложены эвристические алгоритмы оптимизации информационных обменов в параллельных PGAS-программах, обеспечивающие сокращение времени их выполнения. Последнее достигается с помощью учёта иерархической структуры вычислительных систем при выполнении операции редукции и опережающего копирования удалённых массивов на узлы вычислительной системы. Созданные алгоритмы программно реализованы для PGAS-языков Cray Chapel и IBM X10; проведено их экспериментальное исследование на кластерных вычислительных системах.</p></abstract><trans-abstract xml:lang="en"><p>This paper represents the heuristic algorithms of communication optimization in parallel PGAS-programs providing time minimization of its execution. This is achieved by accounting of hierarchical structure of computer systems while executing reduction and preloading of remote arrays to computer system's nodes. Developed algorithms are implemented for PGAS languages: Cray Chapel and IBM X10 and simulated on cluster computer systems.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>параллельное программирование</kwd><kwd>компиляторная оптимизация</kwd><kwd>редукция</kwd><kwd>скалярная замена</kwd></kwd-group><kwd-group xml:lang="en"><kwd>PGAS</kwd><kwd>Cray Chapel</kwd><kwd>IBM X10</kwd><kwd>PGAS</kwd><kwd>compiler optimization</kwd><kwd>reduction</kwd><kwd>scalar replace</kwd><kwd>Cray Chapel</kwd><kwd>IBM X10</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">Хорошевский В.Г. Распределённые вычислительные системы с программируемой струк-турой // Вестник СибГУТИ. 2010. № 2 (10). С. 3-41.</mixed-citation><mixed-citation xml:lang="en">Хорошевский В.Г. Распределённые вычислительные системы с программируемой струк-турой // Вестник СибГУТИ. 2010. № 2 (10). С. 3-41.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Rabenseifner R. Optimization of Collective Reduction Operations // Computational Science - ICCS 2004 - Lecture Notes in Computer Science. 2004. Vol. 3036. P. 1-9.</mixed-citation><mixed-citation xml:lang="en">Rabenseifner R. Optimization of Collective Reduction Operations // Computational Science - ICCS 2004 - Lecture Notes in Computer Science. 2004. Vol. 3036. P. 1-9.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Li S., Hoefler T., Snir M. NUMA-Aware Shared-Memory Collective Communication for MPI // HPDC 2013. 2013. P. 85-96.</mixed-citation><mixed-citation xml:lang="en">Li S., Hoefler T., Snir M. NUMA-Aware Shared-Memory Collective Communication for MPI // HPDC 2013. 2013. P. 85-96.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Курносов М.Г. Алгоритмы трансляционно-циклических информационных обменов в иерархических распределённых вычислительных системах // Вестник компьютерных и информационных технологий. 2011. № 5. С. 27 - 34.</mixed-citation><mixed-citation xml:lang="en">Курносов М.Г. Алгоритмы трансляционно-циклических информационных обменов в иерархических распределённых вычислительных системах // Вестник компьютерных и информационных технологий. 2011. № 5. С. 27 - 34.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Kennedy K., Allen John R. Optimizing compilers for modern architectures: a dependence-based approach. Morgan Kaufmann Publishers Inc. San Francisco, CA, USA 2002. 834 p.</mixed-citation><mixed-citation xml:lang="en">Kennedy K., Allen John R. Optimizing compilers for modern architectures: a dependence-based approach. Morgan Kaufmann Publishers Inc. San Francisco, CA, USA 2002. 834 p.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Barik R., Zhao J., Grove D., Peshansky I., Budimlic Z., Sarkar V. Communication Optimizations for Distirbuted - Memory X10 Programs // IEEE International Parallel and Distributed Processing Symposium. 2011. P. 1 - 13.</mixed-citation><mixed-citation xml:lang="en">Barik R., Zhao J., Grove D., Peshansky I., Budimlic Z., Sarkar V. Communication Optimizations for Distirbuted - Memory X10 Programs // IEEE International Parallel and Distributed Processing Symposium. 2011. P. 1 - 13.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Chen W., Iancu C., Yelick K. Communication Optimizations for Fine-grained UPC Applications // 14th International Conference on Parallel Architectures and Compilation Techniques (PACT), 2005. Tech Report LBNL-58382.</mixed-citation><mixed-citation xml:lang="en">Chen W., Iancu C., Yelick K. Communication Optimizations for Fine-grained UPC Applications // 14th International Conference on Parallel Architectures and Compilation Techniques (PACT), 2005. Tech Report LBNL-58382.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Mallón D.A., Taboada G.L., Teijeiro C., Domínguez J.G., Gómez A., Wibecan B. Scalable PGAS collective operations in NUMA clusters // Cluster Computing. 2014. 23 p.</mixed-citation><mixed-citation xml:lang="en">Mallón D.A., Taboada G.L., Teijeiro C., Domínguez J.G., Gómez A., Wibecan B. Scalable PGAS collective operations in NUMA clusters // Cluster Computing. 2014. 23 p.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Nishtalab R., Zhenga Y., Hargrovea P.H., Yelick K.A. Tuning collective communication for Partitioned Global Address Space programming models // Parallel Computing. 2011. Vol. 37. P. 576 - 591.</mixed-citation><mixed-citation xml:lang="en">Nishtalab R., Zhenga Y., Hargrovea P.H., Yelick K.A. Tuning collective communication for Partitioned Global Address Space programming models // Parallel Computing. 2011. Vol. 37. P. 576 - 591.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Callahan D., Chamberlain B.L., Zima H.P. The Cascade High Productivity Language // HIPS 2004. 2004. P. 52 - 60.</mixed-citation><mixed-citation xml:lang="en">Callahan D., Chamberlain B.L., Zima H.P. The Cascade High Productivity Language // HIPS 2004. 2004. P. 52 - 60.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Nanjegowda R., Hernandez O., Chapman B., Jin H. Scalability Evaluation of Barrier Algorithms for OpenMP // IWOMP '09 Proceedings of the 5th International Workshop on OpenMP: Evolving OpenMP in an Age of Extreme Parallelism. 2009. Vol. 5568. P. 42 - 52.</mixed-citation><mixed-citation xml:lang="en">Nanjegowda R., Hernandez O., Chapman B., Jin H. Scalability Evaluation of Barrier Algorithms for OpenMP // IWOMP '09 Proceedings of the 5th International Workshop on OpenMP: Evolving OpenMP in an Age of Extreme Parallelism. 2009. Vol. 5568. P. 42 - 52.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Callahan D., Carr S., Kennedy K. Improving register allocation for subscripted variables // PLDI ’90, New York, NY, USA, 1990. ACM. P. 53 - 65.</mixed-citation><mixed-citation xml:lang="en">Callahan D., Carr S., Kennedy K. Improving register allocation for subscripted variables // PLDI ’90, New York, NY, USA, 1990. ACM. P. 53 - 65.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Charles P., Donawa C., Ebcioglu K., Grothoff C., Kielstra A., Praun C., Saraswat V., Sarkar V. X10: An Object-oriented approach to non-uniform Clustered Computing // OOPSLA 2005. P. 519 - 538.</mixed-citation><mixed-citation xml:lang="en">Charles P., Donawa C., Ebcioglu K., Grothoff C., Kielstra A., Praun C., Saraswat V., Sarkar V. X10: An Object-oriented approach to non-uniform Clustered Computing // OOPSLA 2005. P. 519 - 538.</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>
