<?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">intechngu</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник НГУ. Серия: Информационные технологии</journal-title><trans-title-group xml:lang="en"><trans-title>Vestnik NSU. Series: Information Technologies</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1818-7900</issn><issn pub-type="epub">2410-0420</issn><publisher><publisher-name>НГУ</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.25205/1818-7900-2025-23-1-5-18</article-id><article-id custom-type="elpub" pub-id-type="custom">intechngu-304</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>Разработка программных систем автоматизированного проектирования и исполнения программ для эффективной реализации численных алгоритмов на основе концепции Q-детерминанта</article-title><trans-title-group xml:lang="en"><trans-title>Development of Software Systems for Computer-aided Design and Program Execution for the Effective Implementation of Numerical Algorithms Based on the Concept of Q-determinant</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-4717-0045</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Алеева</surname><given-names>В. Н.</given-names></name><name name-style="western" xml:lang="en"><surname>Aleeva</surname><given-names>V. N.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Алеева Валентина Николаевна, кандидат физико-математических наук</p><p>Челябинск</p></bio><bio xml:lang="en"><p>Valentina N. Aleeva, Candidate of Science in Physics and Mathematic</p><p>Chelyabinsk</p></bio><email xlink:type="simple">allevavn@susu.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Южно-Уральский государственный университет (НИУ)</institution><country>Россия</country></aff><aff xml:lang="en"><institution>South Ural State University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2025</year></pub-date><pub-date pub-type="epub"><day>08</day><month>07</month><year>2025</year></pub-date><volume>23</volume><issue>1</issue><fpage>5</fpage><lpage>18</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Алеева В.Н., 2025</copyright-statement><copyright-year>2025</copyright-year><copyright-holder xml:lang="ru">Алеева В.Н.</copyright-holder><copyright-holder xml:lang="en">Aleeva V.N.</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://intechngu.elpub.ru/jour/article/view/304">https://intechngu.elpub.ru/jour/article/view/304</self-uri><abstract><p>Статья посвящена решению актуальной проблемы разработки программных систем автоматизированного проектирования и исполнения программ для эффективной реализации численных алгоритмов. Теоретической основой описанного исследования является концепция Q-детерминанта, которая предлагает унифицированное представление численных алгоритмов в форме Q-детерминантов. Q-детерминант дает возможность выразить и оценить ресурс параллелизма алгоритма, а также показать способ его параллельного исполнения. В статье рассматриваются общие принципы организации программных систем автоматизированного проектирования и исполнения программ для эффективной реализации численных алгоритмов. Реализация этих принципов продемонстрирована на примерах создания конкретных программных систем. Кроме того, проведено сравнение подходов к реализации разработанных программных систем.</p></abstract><trans-abstract xml:lang="en"><p>The paper is devoted to solving the actual problem of developing software systems for computer-aided design and program execution for the effective implementation of numerical algorithms. The theoretical basis of our research is the concept of Q-determinant. This concept suggests a unified representation of numerical algorithms in the form of Q-determinants. The Q-determinant makes it possible to express and evaluate the parallelism resource of the algorithm, as well as show the method of its parallel execution. In the paper we consider the general principles of software systems organizing for computer-aided design and program execution for the effective implementation of numerical algorithms. We demonstrate the realization of these principles by the examples of the creation of specific software systems. In addition, we compare the approaches to the implementation of the considered software systems.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>Q-детерминант алгоритма</kwd><kwd>Q-эффективная реализация алгоритма</kwd><kwd>ресурс параллелизма алгоритма</kwd><kwd>Q-эффективная программа</kwd><kwd>автоматизированное проектирование эффективных программ</kwd></kwd-group><kwd-group xml:lang="en"><kwd>Q-determinant of algorithm</kwd><kwd>Q-effective implementation of algorithm</kwd><kwd>parallelism resource of algorithm</kwd><kwd>Q-effective program</kwd><kwd>computer-aided design of effective programs</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">Как выпускник математического (теперь механико-математического) факультета Новосибирского государственного университета, выражаю благодарность факультету за данные мне знания.</funding-statement><funding-statement xml:lang="en">As I a graduate of the mathematical (now mechanics and mathematics) faculty of Novosibirsk State University, I would like to express my gratitude to the faculty for the knowledge given to me.</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">Алеева В. Н. Анализ параллельных численных алгоритмов. Препринт № 590. Новосибирск: ВЦ СО АН СССР, 1985. 23 с.</mixed-citation><mixed-citation xml:lang="en">Aleeva V. N. Analysis of Parallel Numerical Algorithms. Preprint no. 590. Novosibirsk, Computing Center of the Siberian Branch of the Academy of Sciences of the USSR, 1985. 23 p. (in Russian)</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Алеева В. Н., Зотова П. С., Склезнев Д. С. Расширение возможностей исследования ресурса параллелизма численных алгоритмов с помощью программной Q-системы // Вестник ЮУрГУ. Серия: Вычислительная математика и информатика. 2021. Т. 10, № 2. С. 66‒81. DOI: 10.14529/cmse210205</mixed-citation><mixed-citation xml:lang="en">Aleeva V. N., Zotova P. S., Skleznev D. S. Advancement of Research for the Parallelism Resource of Numerical Algorithms with the Help of Software Q-system. Bulletin of the South Ural State University. Series: Computational Mathematics and Software Engineering, 2021, vol. 10, no. 2, pp. 66‒81. (in Russian) DOI: 10.14529/cmse210205</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Алеева В. Н., Шатов М. Б. Применение концепции Q-детерминанта для эффективной реализации численных алгоритмов на примере метода сопряженных градиентов для решения систем линейных уравнений // Вестник ЮУрГУ. Серия: Вычислительная математика и информатика. 2021. Т. 10, № 3. С. 56‒71. DOI: 10.14529/cmse210304</mixed-citation><mixed-citation xml:lang="en">Aleeva V. N., Shatov M. B. Application of the Q-determinant Concept for Efficient Implementation of Numerical Algorithms by the Example of the Conjugate Gradient Method for Solving Systems of Linear Equations. Bulletin of the South Ural State University. Series: Computational Mathematics and Software Engineering, 2021, vol. 10, no. 3, pp. 56‒71. (in Russian) DOI: 10.14529/cmse210304</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Aleeva V. Designing a Parallel Programs on the Base of the Conception of Q-Determinant // Supercomputing. RuSCDays 2018. Communications in Computer and Information Science. 2019. Vol. 965. P. 565‒577. DOI: 10.1007/978-3-030-05807-4_48</mixed-citation><mixed-citation xml:lang="en">Aleeva V. Designing a Parallel Programs on the Base of the Conception of Q-Determinant. Supercomputing. RuSCDays 2018. Communications in Computer and Information Science, 2019, vol. 965, pp. 565‒577. DOI: 10.1007/978-3-030-05807-4_48</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Aleeva V. N. Improving Parallel Computing Efficiency // Proceedings ‒ 2020 Global Smart Industry Conference, GloSIC 2020. IEEE. 2020. P. 113‒120. Article number 9267828. DOI: 10.1109/GloSIC50886.2020.9267828</mixed-citation><mixed-citation xml:lang="en">Aleeva V. N. Improving Parallel Computing Efficiency. Proceedings ‒ 2020 Global Smart Industry Conference, GloSIC 2020. IEEE. 2020. P. 113‒120. Article number 9267828. DOI: 10.1109/GloSIC50886.2020.9267828</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Valentina Aleeva, Rifkhat Aleev. Investigation and Implementation of Parallelism Resources of Numerical Algorithms // ACM Transactions on Parallel Computing. 2023. Vol. 10. no. 2, Article number 8. P. 1‒64. DOI: 10.1145/3583755</mixed-citation><mixed-citation xml:lang="en">Aleeva V., Aleev R. Investigation and Implementation of Parallelism Resources of Numerical Algorithms. ACM Transactions on Parallel Computing, 2023, vol. 10, no. 2, pp. 1‒64. DOI: 10.1145/3583755</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Aleeva V. N., Aleev R. Zh. High-Performance Computing Using Application of Q-determinant of Numerical Algorithms // Proceedings ‒ 2018 Global Smart Industry Conference, GloSIC 2018. IEEE. 2018. 8 p. Article number 8570160. DOI: 10.1109/GloSIC.2018.8570160</mixed-citation><mixed-citation xml:lang="en">Aleeva V. N., Aleev R. Zh. High-Performance Computing Using Application of Q-determinant of Numerical Algorithms. Proceedings ‒ 2018 Global Smart Industry Conference, GloSIC 2018. IEEE. 2018. 8 p. Article number 8570160. DOI: 10.1109/GloSIC.2018.8570160</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Aleeva V., Bogatyreva E., Skleznev A., et al. Software Q-system for the Research of the Resource of Numerical Algorithms Parallelism // Supercomputing. RuSCDays 2019. Communications in Computer and Information Science. 2019. Vol. 1129. P. 641‒652. DOI: 10.1007/978-3-030-36592-9_52</mixed-citation><mixed-citation xml:lang="en">Aleeva V., Bogatyreva E., Skleznev A., et al. Software Q-system for the Research of the Resource of Numerical Algorithms Parallelism. Supercomputing. RuSCDays 2019. Communications in Computer and Information Science, 2019, vol. 1129, pp. 641‒652. DOI: 10.1007/978-3-030-36592-9_52</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Aleeva V. N., Sharabura I. S., Suleymanov D. E. Software System for Maximal Parallelization of Algorithms on the Base of the Conception of Q-determinant // Parallel Computing Technologies (PaCT 2015). Lecture Notes in Computer Science. 2015. Vol. 9251. P. 3‒9. DOI: 10.1007/978-3-319-21909-7_1</mixed-citation><mixed-citation xml:lang="en">Aleeva V. N., Sharabura I. S., Suleymanov D. E. Software System for Maximal Parallelization of Algorithms on the Base of the Conception of Q-determinant. Parallel Computing Technologies (PaCT 2015). Lecture Notes in Computer Science, 2015, vol. 9251, pp. 3‒9. DOI: 10.1007/978-3-319-21909-7_1</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Воеводин В. В., Воеводин Вл. В. Параллельные вычисления. СПб.: БХВ-Петербург, 2002. 608 с.</mixed-citation><mixed-citation xml:lang="en">Voevodin V. V., Voevodin Vl. V. Parallel Computing. St.Petersburg, BHV-Petersburg, 2002. 608 p. (in Russian)</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Antonov A. S., Dongarra J., Voevodin V. V. AlgoWiki Project as an Extension of the Top500 Methodology // Supercomputing Frontiers and Innovations. 2018. Vol. 5, no. 1. P. 4‒10. DOI: 10.14529/jsfi180101</mixed-citation><mixed-citation xml:lang="en">Antonov A. S., Dongarra J., Voevodin V. V. AlgoWiki Project as an Extension of the Top500 Methodology. Supercomputing Frontiers and Innovations, 2018, vol. 5, no. 1, pp. 4‒10. DOI: 10.14529/jsfi180101</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Bosilca G., Bouteiller A., Danalis A., et al. Flexible Development of Dense Linear Algebra Algorithms on Massively Parallel Architectures with DPLASMA // 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum. 2011. P. 1432‒1441. DOI: 10.1109/IPDPS.2011.299</mixed-citation><mixed-citation xml:lang="en">Bosilca G., Bouteiller A., Danalis A., et al. Flexible Development of Dense Linear Algebra Algorithms on Massively Parallel Architectures with DPLASMA. 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum, 2011. P. 14321441. DOI: 10.1109/IPDPS.2011.299</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Bosilca G., Bouteiller A., Danalis A., et al. PaRSEC: Exploiting Heterogeneity to Enhance Scalability // Computing in Science &amp; Engineering. 2013. Vol. 15, no. 6. P. 36‒45. DOI: 10.1109/MCSE.2013.98</mixed-citation><mixed-citation xml:lang="en">Bosilca G., Bouteiller A., Danalis A., et al. PaRSEC: Exploiting Heterogeneity to Enhance Scalability. Computing in Science &amp; Engineering, 2013, vol. 15, no. 6, pp. 36‒45. DOI: 10.1109/MCSE.2013.98</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Balaprakash P., Dongarra J., Gamblin T., et al. Autotuning in High-Performance Computing Applications // Proceedings of the IEEE. 2018. Vol. 106, no. 11. P. 2068‒2083. DOI: 10.1109/JPROC.2018.2841200</mixed-citation><mixed-citation xml:lang="en">Balaprakash P., Dongarra J., Gamblin T., et al. Autotuning in High-Performance Computing Applications. Proceedings of the IEEE, 2018, vol. 106, no. 11, pp. 2068‒2083. DOI: 10.1109/JPROC.2018.2841200</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Bauer M., Treichler S., Slaughter E., and A. Aiken A. Legion: Expressing locality and independence with logical regions // SC ‘12: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis. 2012. P. 1‒11. DOI: 10.1109/SC.2012.71</mixed-citation><mixed-citation xml:lang="en">Bauer M., Treichler S., Slaughter E., and A. Aiken A. Legion: Expressing locality and independence with logical regions. SC ‘12: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis. 2012. P. 1‒11. DOI: 10.1109/SC.2012.71</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Алеева В. Н. Автоматизированное проектирование и исполнение эффективных программ для численных алгоритмов // Вестник ЮУрГУ. Серия: Вычислительная математика и информатика. 2023. Т. 12, № 3. С. 31‒49. DOI: 10.14529/cmse230303</mixed-citation><mixed-citation xml:lang="en">Aleeva V. N. Computer-aided design and execution of effective programs for numerical algorithms. Bulletin of the South Ural State University. Series: Computational Mathematics and Software Engineering. 2023. Vol. 12, no. 3. P. 31‒49. (in Russian) DOI: 10.14529/cmse230303</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Manatin P., Aleeva V. Efficient Implementation of Numerical Algorithms Based on a Lexical Analyzer // Parallel Computational Technologies. PCT 2024. Communications in Computer and Information Science. 2024. Vol 2241. P. 107‒121. DOI: 10.1007/978-3-031-73372-7_8</mixed-citation><mixed-citation xml:lang="en">Manatin P., Aleeva V. Efficient Implementation of Numerical Algorithms Based on a Lexical Analyzer. Parallel Computational Technologies. PCT 2024. Communications in Computer and Information Science, 2024, vol. 2241, pp. 107‒121. DOI: 10.1007/978-3-031-73372-7_8</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Leung J. Y.-T., Zhao H. Scheduling problems in master-slave model // Annals of Operations Research. 2008. Vol. 159. P. 215‒231. DOI: 10.1007/s10479-007-0271-4</mixed-citation><mixed-citation xml:lang="en">Leung J. Y.-T., Zhao H. Scheduling problems in master-slave mode. Annals of Operations Research, 2008, vol. 159, pp. 215‒231. DOI: 10.1007/s10479-007-0271-4</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>
