<?xml version="1.0" encoding="UTF-8"?>
<article article-type="research-article" dtd-version="1.3" xml:lang="ru" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:noNamespaceSchemaLocation="https://metafora.rcsi.science/xsd_files/journal3.xsd">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">moitvivt</journal-id>
      <journal-title-group>
        <journal-title xml:lang="ru">Моделирование, оптимизация и информационные технологии</journal-title>
        <trans-title-group xml:lang="en">
          <trans-title>Modeling, Optimization and Information Technology</trans-title>
        </trans-title-group>
      </journal-title-group>
      <issn pub-type="epub">2310-6018</issn>
      <publisher>
        <publisher-name>Издательство</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.26102/2310-6018/2024.44.1.018</article-id>
      <article-id pub-id-type="custom" custom-type="elpub">1508</article-id>
      <title-group>
        <article-title xml:lang="ru">Метод управления вычислительными ресурсами распределенных систем на основе «жадной» стратегии и онтологии эффективных алгоритмов</article-title>
        <trans-title-group xml:lang="en">
          <trans-title>Distributed computing resource management method based on greedy strategy and efficient algorithms ontology</trans-title>
        </trans-title-group>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes">
          <contrib-id contrib-id-type="orcid">0000-0001-6527-8108</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>Klimenko</surname>
              <given-names>Anna Borisovna</given-names>
            </name>
          </name-alternatives>
          <email>anna_klimenko@mail.ru</email>
          <xref ref-type="aff">aff-1</xref>
        </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>Barinov</surname>
              <given-names>Arseniy Alekseevich</given-names>
            </name>
          </name-alternatives>
          <xref ref-type="aff">aff-2</xref>
        </contrib>
      </contrib-group>
      <aff-alternatives id="aff-1">
        <aff xml:lang="ru">Институт информационных наук и технологий безопасности Российского государственного гуманитарного университета</aff>
        <aff xml:lang="en">Institute of IT and Security Technologies of Russian State University for the Humanities</aff>
      </aff-alternatives>
      <aff-alternatives id="aff-2">
        <aff xml:lang="ru">Институт информационных наук и технологий безопасности Российского государственного гуманитарного университета</aff>
        <aff xml:lang="en">Institute of IT and Security Technologies of Russian State University for the Humanities</aff>
      </aff-alternatives>
      <pub-date pub-type="epub">
        <day>01</day>
        <month>01</month>
        <year>2026</year>
      </pub-date>
      <volume>1</volume>
      <issue>1</issue>
      <elocation-id>10.26102/2310-6018/2024.44.1.018</elocation-id>
      <permissions>
        <copyright-statement>Copyright © Авторы, 2026</copyright-statement>
        <copyright-year>2026</copyright-year>
        <license license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/">
          <license-p>This work is licensed under a Creative Commons Attribution 4.0 International License</license-p>
        </license>
      </permissions>
      <self-uri xlink:href="https://moitvivt.ru/ru/journal/article?id=1508"/>
      <abstract xml:lang="ru">
        <p>В настоящее время управление вычислительными ресурсами в современных системах распределенных вычислений является актуальной проблемой. Эволюция потенциала инфраструктуры привела к тому, что распределенные вычисления могут быть организованы в динамичных гетерогенных и географически распределенных вычислительных средах, примерами которых являются среды «туманные» и «краевые». Динамика как нагрузки, так и топологии подразумевает необходимость смены конфигурации системы, а именно закрепления пользовательских задач за вычислительными устройствами с выделением необходимых ресурсов. Последнее актуализирует вопрос повышения эффективности функционирования планировщика (брокера), обеспечивающего управление ресурсами сети в пределах выделенного фрагмента. Алгоритмическое и программное обеспечение планировщиков основано на моделях и методах теории расписаний и, исходя из постановки задачи, реализует либо простые эвристики, либо методы математического программирования, либо метаэвристики. Однако анализ представленных в открытом доступе постановок задач показал, что они, во-первых, являются частными случаями и реализуют определенные ситуации распределения вычислительных ресурсов, во-вторых, не отражают в полной мере свойств гетерогенности, географической распределенности и динамики вычислительных сред. В рамках данного исследования предложена общая модель задачи распределения вычислительных ресурсов с учетом перечисленных свойств и предложен ее метод решения с использованием предметной онтологии метаэвристических методов. Показана целесообразность построения и применения онтологии на примере анализа эффективности генетических алгоритмов в зависимости от значений параметров решаемой задачи распределения вычислительных ресурсов.</p>
      </abstract>
      <trans-abstract xml:lang="en">
        <p>Currently, managing computing resources in modern distributed computing systems is the relevant problem. As a result of infrastructure capability evolution, distributed computing can be organized in dynamic, heterogeneous and geographically distributed computing environments, examples of which are “fog” and “edge” ones. The dynamics of both load and topology imply the need to change the system configuration, namely, assigning user tasks to computing devices with the allocation of the necessary resources. The latter raises the issue of increasing the efficiency of the scheduler (broker), which facilitates management of network resources within the allocated fragment. Algorithmic and software schedulers are based on models and methods of scheduling theory and implement either simple heuristics, mathematical programming methods or metaheuristics. However, an analysis of publicly available problem statements has shown that, firstly, they are special cases and implement certain situations of computing resource distribution, and secondly, they do not fully reflect the properties of heterogeneity, geographical distribution and dynamics of computing environments. As part of this study, a general model of computing resource allocation problem is proposed with consideration to the listed properties, and a solution method using the subject ontology of metaheuristic methods is proposed. The feasibility of constructing and applying an ontology is shown using the example of analyzing the effectiveness of genetic algorithms depending on the values of the computing resource allocation problem parameters which is being solved.</p>
      </trans-abstract>
      <kwd-group xml:lang="ru">
        <kwd>онтология</kwd>
        <kwd>распределение ресурсов</kwd>
        <kwd>распределенные вычисления</kwd>
        <kwd>управление распределенными вычислениями</kwd>
        <kwd>управление ресурсами</kwd>
        <kwd>оптимизация</kwd>
      </kwd-group>
      <kwd-group xml:lang="en">
        <kwd>ontology</kwd>
        <kwd>resource allocation</kwd>
        <kwd>distributed computing</kwd>
        <kwd>distributed computing management</kwd>
        <kwd>resource management</kwd>
        <kwd>optimization</kwd>
      </kwd-group>
      <funding-group>
        <funding-statement xml:lang="ru">Исследование выполнено без спонсорской поддержки.</funding-statement>
        <funding-statement xml:lang="en">The study was performed without external funding.</funding-statement>
      </funding-group>
    </article-meta>
  </front>
  <back>
    <ref-list>
      <title>References</title>
      <ref id="cit1">
        <label>1</label>
        <mixed-citation xml:lang="ru">Pinedo M.L. Planning and Scheduling in Manufacturing and Services. 2nd ed. New York, NY: Springer; 2014. 536 p.</mixed-citation>
      </ref>
      <ref id="cit2">
        <label>2</label>
        <mixed-citation xml:lang="ru">Han X., Iwama K., Ye D., Zhang G. Strip packing vs. Bin packing. В сборнике: Third International Conference on Algorithmic Aspects in Information and Management (AAIM’07), 6–8 July 2007, Portland, Oregon, USA. Heidelberg: Springer; 2007. p. 358–367.</mixed-citation>
      </ref>
      <ref id="cit3">
        <label>3</label>
        <mixed-citation xml:lang="ru">Burcea M., Wong P.W.H., Yung F.C.C. Online Multi-dimensional Dynamic Bin Packing of Unit-Fraction Items. In: CIAC 2013: 8th International Conference on Algorithms and Complexity, 22–24 May 2013, Barcelona, Spain. Heidelberg: Springer; 2013. p. 85–96.</mixed-citation>
      </ref>
      <ref id="cit4">
        <label>4</label>
        <mixed-citation xml:lang="ru">Топорков В.В. Модели распределенных вычислений. М.: ФИЗМАТЛИТ; 2004. 320 с.</mixed-citation>
      </ref>
      <ref id="cit5">
        <label>5</label>
        <mixed-citation xml:lang="ru">Shaji George A., Hovan George A.S., Baskar T. Edge computing and the future of cloud computing: a survey of industry perspectives and predictions. Partners Universal International Research Journal (PUIRJ). 2023;2(2):19–44. DOI: 10.5281/zenodo.8020101.</mixed-citation>
      </ref>
      <ref id="cit6">
        <label>6</label>
        <mixed-citation xml:lang="ru">Shaji George A., Hovan George A.S., Baskar T. Unshackled by servers: embracing the serverless revolution in modern computing. Partners Universal International Research Journal (PUIRJ). 2023;2(2):229–240. DOI: 10.5281/zenodo.8051052.</mixed-citation>
      </ref>
      <ref id="cit7">
        <label>7</label>
        <mixed-citation xml:lang="ru">Brando V., Lovell J., King E., Boadle D., Scott R., Schroeder T. The potential of autonomous ship-borne hyperspectral radiometers for the validation of ocean color radiometry data. Remote Sensing. 2016;8(2). URL: https://www.mdpi.com/2072-4292/8/2/150. DOI: 10.3390/rs8020150 (дата обращения: 19.12.2023).</mixed-citation>
      </ref>
      <ref id="cit8">
        <label>8</label>
        <mixed-citation xml:lang="ru">Liang Z., Zhong P., Zhang C., Yang W., Xiong W., Yang S., et al. A genetic algorithm-based approach for flexible job shop rescheduling problem with machine failure interference. Eksploatacja i Niezawodność – Maintenance and Reliability. 2023;25(4). URL: https://ein.org.pl/A-genetic-algorithm-based-approach-for-flexible-job-shop-rescheduling-problem-with,171784,0,2.html. DOI: 10.17531/ein/171784 (дата обращения: 19.12.2023).</mixed-citation>
      </ref>
      <ref id="cit9">
        <label>9</label>
        <mixed-citation xml:lang="ru">Espinaco F., Henning G.P. Industrial rescheduling approaches: where are we and what is missing? In: ICPR Americas 2022: International Conference on Production Research – Americas 2022, 23–25 November 2022, Curitiba, Brazil. Cham: Springer; 2023. p. 461–467.</mixed-citation>
      </ref>
      <ref id="cit10">
        <label>10</label>
        <mixed-citation xml:lang="ru">1Nair B., Bhanu S.M.S. A reinforcement learning algorithm for rescheduling preempted tasks in fog nodes. Journal of Scheduling. 2022;25(5):547–565. DOI: 10.1007/s10951-022-00725-x.</mixed-citation>
      </ref>
      <ref id="cit11">
        <label>11</label>
        <mixed-citation xml:lang="ru">Конвей Р.В., Максвелл В.Л., Миллер Л.В. Теория расписаний. М.: Наука; 1975. 359 с.</mixed-citation>
      </ref>
      <ref id="cit12">
        <label>12</label>
        <mixed-citation xml:lang="ru">Khan A., Lonkar A., Maiti A., Sharma A., Wiese A. Tight approximation algorithms for two dimensional Guillotine strip packing. arXiv. 2022.</mixed-citation>
      </ref>
      <ref id="cit13">
        <label>13</label>
        <mixed-citation xml:lang="ru">Henrik I.C., Arindam K., Pokutta S., Tetali P. Approximation and online algorithms for multidimensional bin packing: A survey. Computer Science Review. 2017;24:63–79. DOI: 10.1016/j.cosrev.2016.12.001.</mixed-citation>
      </ref>
      <ref id="cit14">
        <label>14</label>
        <mixed-citation xml:lang="ru">Seiden S.S., Woeginger G.J. The two-dimensional cutting stock problem revisited. Mathematical Programming. 2005;102(3):519–530. DOI: 10.1007/s10107-004-0548-1.</mixed-citation>
      </ref>
      <ref id="cit15">
        <label>15</label>
        <mixed-citation xml:lang="ru">Dow E.M. Decomposed multi-objective bin-packing for virtual machine consolidation. PeerJ Computer Science. 2016;2(e47):e47. DOI: 10.7717/peerj-cs.47.</mixed-citation>
      </ref>
      <ref id="cit16">
        <label>16</label>
        <mixed-citation xml:lang="ru">Telenyk S., Zharikov E., Rolik O. Consolidation of virtual machines using stochastic local search. In: CSIT 2017: The International Conference on Computer Science and Information Technologies, 5–8 September 2017. Cham: Springer; 2018. p. 523–537.</mixed-citation>
      </ref>
      <ref id="cit17">
        <label>17</label>
        <mixed-citation xml:lang="ru">Augustine J., Banerjee S., Irani S. Strip packing with precedence constraints and strip packing with release times. Theoretical Computer Science. 2009;410(38–40):3792–3803. DOI: 10.1016/j.tcs.2009.05.024.</mixed-citation>
      </ref>
      <ref id="cit18">
        <label>18</label>
        <mixed-citation xml:lang="ru">Deppert M.A., Jansen K., Khan A., Rau M., Tutas M. Peak demand minimization via sliced strip packing. Algorithmica. 2023;85(12):3649–3679. DOI: 10.1007/s00453-023-01152-w.</mixed-citation>
      </ref>
      <ref id="cit19">
        <label>19</label>
        <mixed-citation xml:lang="ru">Bódis A., Csirik J. The variable-width strip packing problem. Central European Journal of Operations Research. 2022;30(4):1337–1351. DOI: 10.1007/s10100-021-00772-3.</mixed-citation>
      </ref>
      <ref id="cit20">
        <label>20</label>
        <mixed-citation xml:lang="ru">Барский А.Б. Параллельные информационные технологии. М.: БИНОМ. Лаборатория знаний; 2007. 502 с.</mixed-citation>
      </ref>
      <ref id="cit21">
        <label>21</label>
        <mixed-citation xml:lang="ru">Singh R.M., Awasthi L.K., Sikka G. Techniques for task scheduling in cloud and fog environment: A survey. In: Second International Conference on Futuristic Trends in Networks and Computing Technologies (FTNCT-2019), 22–23 November 2019, Chandigarh, India. Singapore: Springer; 2020. p. 673–685.</mixed-citation>
      </ref>
      <ref id="cit22">
        <label>22</label>
        <mixed-citation xml:lang="ru">Nguyen B.M., Binh H.T.T., Anh T.T., Son D.B. Evolutionary algorithms to optimize task scheduling problem for the IoT based bag-of-tasks application in cloud–fog computing Environment. Applied Sciences. 2019;9(9). URL: https://www.mdpi.com/2076-3417/9/9/1730. DOI: 10.3390/app9091730 (дата обращения: 19.12.2023).</mixed-citation>
      </ref>
      <ref id="cit23">
        <label>23</label>
        <mixed-citation xml:lang="ru">Natesan G., Chokkalingam A. Task scheduling in heterogeneous cloud environment using mean grey wolf optimization algorithm. ICT Express. 2019;5(2):110–114. DOI: 10.1016/j.icte.2018.07.002.</mixed-citation>
      </ref>
      <ref id="cit24">
        <label>24</label>
        <mixed-citation xml:lang="ru">Narendrababu Reddy G., Phani Kumar S. Modified ant colony optimization algorithm for task scheduling in cloud computing systems. In: SCI2018: 2nd International Conference on Smart Computing and Informatics, 27–28 January 2018, Vijayawada, India. Singapore: Springer; 2019. p. 357–365.</mixed-citation>
      </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>