<?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">kaz29</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник Казахстанско-Британского технического университета</journal-title><trans-title-group xml:lang="en"><trans-title>Herald of the Kazakh-British Technical University</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1998-6688</issn><issn pub-type="epub">2959-8109</issn><publisher><publisher-name>Казахстанско-Британский Технический Университет</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.55452/1998-6688-2026-23-1-185-196</article-id><article-id custom-type="elpub" pub-id-type="custom">kaz29-2512</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>COMPUTER SCIENCE</subject></subj-group></article-categories><title-group><article-title>РАЗРАБОТКА ПОВЕДЕНИЯ АГЕНТОВ ДЛЯ AD-HOC ГРИД-ВЫЧИСЛЕНИЙ</article-title><trans-title-group xml:lang="en"><trans-title>DEVELOPMENT OF AN AGENT BEHAVIOR FOR AD-HOC GRID COMPUTING</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-0003-1476-9542</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>Kumalakov</surname><given-names>B.</given-names></name></name-alternatives><bio xml:lang="ru"><p>PhD, ассоциированный профессор</p><p>г. Астана</p></bio><bio xml:lang="en"><p>PhD, Associate Professor</p><p>г. Астана</p></bio><email xlink:type="simple">bolatzhan.kumalakov@astanait.edu.kz</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>Tsoy</surname><given-names>D.</given-names></name></name-alternatives><bio xml:lang="ru"><p>м.н.с.</p><p>Astana IT University</p></bio><bio xml:lang="en"><p>Junior Researcher</p><p>г. Астана</p></bio><email xlink:type="simple">soy.daniil.an@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru">Astana IT University<country>Казахстан</country></aff><aff xml:lang="en">Astana IT University<country>Kazakhstan</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2026</year></pub-date><pub-date pub-type="epub"><day>29</day><month>03</month><year>2026</year></pub-date><volume>23</volume><issue>1</issue><fpage>185</fpage><lpage>196</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Кумалаков Б., Цой Д., 2026</copyright-statement><copyright-year>2026</copyright-year><copyright-holder xml:lang="ru">Кумалаков Б., Цой Д.</copyright-holder><copyright-holder xml:lang="en">Kumalakov B., Tsoy D.</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.kbtu.edu.kz/jour/article/view/2512">https://vestnik.kbtu.edu.kz/jour/article/view/2512</self-uri><abstract><p>В этом исследовании рассматривается проблема эффективности планирования задач и ограниченной отказоустойчивости в специализированных грид-вычислительных средах, где традиционные системы полагаются на централизованное управление и стабильную инфраструктуру. Чтобы преодолеть это, было разработано поведение децентрализованных агентов с использованием платформы Java Agent DEvelopment Framework, позволяющей автономно перераспределять задачи между гетерогенными рабочими агентами. Предлагаемая архитектура Планировщик – Рабочий обеспечивает динамическую координацию и восстановление после сбоев без централизованной оркестровки. Эксперименты на пяти устройствах показывают, что увеличение числа агентов с одного до трех сокращает общее время выполнения в 1,98–3,25 раза, в то время как наилучшая производительность достигается при использовании четырех агентов, что обеспечивает ускорение в 2,99 раза при выполнении 100 задач. Однако использование шести агентов на меньшем количестве устройств снижает эффективность до 2,34 раза из-за нехватки ресурсов и увеличенной коммуникационной нагрузки. Исследование ограничено одной топологией сети и небольшим испытательным стендом. Тем не менее результаты демонстрируют практический потенциал децентрализованного планирования на основе агентов для создания устойчивых распределенных систем машинного обучения.</p></abstract><trans-abstract xml:lang="en"><p>This study addresses the problem of inefficient task scheduling and limited fault tolerance in ad-hoc grid computing environments, where traditional systems rely on centralized control and stable infrastructure. To overcome this, a decentralized agent behavior was developed using the Java Agent DEvelopment Framework, enabling autonomous task redistribution among heterogeneous Worker agents. The proposed Scheduler–Worker architecture allows dynamic coordination and failure recovery without centralized orchestration. Experiments on five devices show that increasing the number of agents from one to three reduces total execution time by 1.98–3.25, while the best performance is achieved with four agents, providing a 2.99 speedup for 100 tasks. However, using six agents on fewer devices reduces efficiency to 2.34 due to resource contention and communication overhead. The study is limited by a single network topology and a small-scale testbed. Nevertheless, the results demonstrate the practical potential of agent-based decentralized scheduling for resilient distributed machine learning systems.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>мультиагентная система</kwd><kwd>грид-вычисления</kwd><kwd>JADE</kwd><kwd>распределенные вычисления</kwd><kwd>отказоустойчивость</kwd><kwd>планирование задач</kwd><kwd>консенсус агентов</kwd></kwd-group><kwd-group xml:lang="en"><kwd>multi-agent system</kwd><kwd>ad-hoc grid computing</kwd><kwd>JADE</kwd><kwd>distributed computing</kwd><kwd>fault tolerance</kwd><kwd>task scheduling</kwd><kwd>agent consensus</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">Tanenbaum, A.S., Van Steen, M. Distributed Systems: Principles and Paradigms, 2nd ed. (Pearson Education, 2007).</mixed-citation><mixed-citation xml:lang="en">Tanenbaum, A.S., Van Steen, M. Distributed Systems: Principles and Paradigms, 2nd ed. (Pearson Education, 2007).</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Coulouris, G., Dollimore, J., Kindberg, T., Blair, G. Distributed Systems: Concepts and Design, 5th ed. (Addison-Wesley, 2011).</mixed-citation><mixed-citation xml:lang="en">Coulouris, G., Dollimore, J., Kindberg, T., Blair, G. Distributed Systems: Concepts and Design, 5th ed. (Addison-Wesley, 2011).</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Wooldridge, M. An Introduction to Multi-Agent Systems, 2nd ed. (John Wiley &amp; Sons, 2009).</mixed-citation><mixed-citation xml:lang="en">Wooldridge, M. An Introduction to Multi-Agent Systems, 2nd ed. (John Wiley &amp; Sons, 2009).</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Huhns, M.N., Singh, M.P. (editors) Readings in Agents (Morgan Kaufmann, 1998).</mixed-citation><mixed-citation xml:lang="en">Huhns, M.N., Singh, M.P. (editors) Readings in Agents (Morgan Kaufmann, 1998).</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Greenwood, D., Bellifemine, F., Caire, G. Developing Multi-Agent Systems with JADE (Wiley, 2007).</mixed-citation><mixed-citation xml:lang="en">Greenwood, D., Bellifemine, F., Caire, G. Developing Multi-Agent Systems with JADE (Wiley, 2007).</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Kalia, K., Gupta, N. Analysis of Hadoop MapReduce scheduling in heterogeneous environment. Ain Shams Engineering Journal, 12(1), 1101–1110 (2021). https:// doi.org/10.1016/j.asej.2020.06.009</mixed-citation><mixed-citation xml:lang="en">Kalia, K., Gupta, N. Analysis of Hadoop MapReduce scheduling in heterogeneous environment. Ain Shams Engineering Journal, 12(1), 1101–1110 (2021). https:// doi.org/10.1016/j.asej.2020.06.009</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Sewal, P., Singh, H. A Critical Analysis of Apache Hadoop and Spark for Big Data Processing. 2021 6th International Conference on Signal Processing, Computing and Control (ISPCC), 308–313 (2021). https:// doi.org/10.1109/ISPCC53510.2021.9609518</mixed-citation><mixed-citation xml:lang="en">Sewal, P., Singh, H. A Critical Analysis of Apache Hadoop and Spark for Big Data Processing. 2021 6th International Conference on Signal Processing, Computing and Control (ISPCC), 308–313 (2021). https:// doi.org/10.1109/ISPCC53510.2021.9609518</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Raptis, T.P., Passarella, A. A survey on networked data streaming with Apache Kafka. IEEE Access, 11, 85333–85350 (2023). https://doi.org/10.1109/ACCESS.2023.3303810</mixed-citation><mixed-citation xml:lang="en">Raptis, T.P., Passarella, A. A survey on networked data streaming with Apache Kafka. IEEE Access, 11, 85333–85350 (2023). https://doi.org/10.1109/ACCESS.2023.3303810</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Lee, J.-Y., Kim, M.-H., Shah, S.A.R., Ahn, S.-U., Yoon, H., Noh, S.-Y. Performance Evaluations of Distributed File Systems for Scientific Big Data in FUSE Environment. Electronics, 10(12), 1471 (2021). https://doi.org/10.3390/electronics10121471</mixed-citation><mixed-citation xml:lang="en">Lee, J.-Y., Kim, M.-H., Shah, S.A.R., Ahn, S.-U., Yoon, H., Noh, S.-Y. Performance Evaluations of Distributed File Systems for Scientific Big Data in FUSE Environment. Electronics, 10(12), 1471 (2021). https://doi.org/10.3390/electronics10121471</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Ma, C., Chi, Y. Evaluation test and improvement of load balancing algorithms of Nginx. IEEE Access, 10, 14311–14324 (2022). https://doi.org/10.1109/ACCESS.2022.3146422</mixed-citation><mixed-citation xml:lang="en">Ma, C., Chi, Y. Evaluation test and improvement of load balancing algorithms of Nginx. IEEE Access, 10, 14311–14324 (2022). https://doi.org/10.1109/ACCESS.2022.3146422</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Singh, N., Hamid, Y., Juneja, S., et al. Load balancing and service discovery using Docker Swarm for microservice based big data applications. Journal of Cloud Computing, 12, 4 (2023). https://doi.org/10.1186/s13677-022-00358-7</mixed-citation><mixed-citation xml:lang="en">Singh, N., Hamid, Y., Juneja, S., et al. Load balancing and service discovery using Docker Swarm for microservice based big data applications. Journal of Cloud Computing, 12, 4 (2023). https://doi.org/10.1186/s13677-022-00358-7</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Burns, B., Beda, J., Hightower, K., Evenson, L. Kubernetes: Up and Running: Dive into the Future of Infrastructure (O’Reilly Media, 2022).</mixed-citation><mixed-citation xml:lang="en">Burns, B., Beda, J., Hightower, K., Evenson, L. Kubernetes: Up and Running: Dive into the Future of Infrastructure (O’Reilly Media, 2022).</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Pauloski, J.G., Rydzy, K., Hayot-Sasson, V., Foster, I., Chard, K. Accelerating Python applications with Dask and ProxyStore. arXiv preprint arXiv:2410.12092 (2024). https://doi.org/10.48550/arXiv.2410.12092</mixed-citation><mixed-citation xml:lang="en">Pauloski, J.G., Rydzy, K., Hayot-Sasson, V., Foster, I., Chard, K. Accelerating Python applications with Dask and ProxyStore. arXiv preprint arXiv:2410.12092 (2024). https://doi.org/10.48550/arXiv.2410.12092</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Ajitha, S. Methodology for Load Balancing in Multi-Agent System Using SPE Approach. Security Issues and Privacy Concerns in Industry 4.0 Applications, 207–227 (2021). https://doi.org/10.1002/9781119776529.ch11</mixed-citation><mixed-citation xml:lang="en">Ajitha, S. Methodology for Load Balancing in Multi-Agent System Using SPE Approach. Security Issues and Privacy Concerns in Industry 4.0 Applications, 207–227 (2021). https://doi.org/10.1002/9781119776529.ch11</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Iturria-Rivera, P.E., Erol-Kantarci, M. Competitive Multi-Agent Load Balancing with Adaptive Policies in Wireless Networks. 2022 IEEE 19th Annual Consumer Communications &amp; Networking Conference (CCNC), 796–801 (2022). https://doi.org/10.1109/CCNC49033.2022.9700667</mixed-citation><mixed-citation xml:lang="en">Iturria-Rivera, P.E., Erol-Kantarci, M. Competitive Multi-Agent Load Balancing with Adaptive Policies in Wireless Networks. 2022 IEEE 19th Annual Consumer Communications &amp; Networking Conference (CCNC), 796–801 (2022). https://doi.org/10.1109/CCNC49033.2022.9700667</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Li, Z., Yu, J., Liu, X., Peng, L. Load Balancing for Task Scheduling Based on Multi-Agent Reinforcement Learning in Cloud-Edge-End Collaborative Environments. Proceedings of the 2024 8th International Conference on Machine Learning and Soft Computing (ICMLSC ’24), 94–100 (2024). https:// doi.org/10.1145/3647750.3647765</mixed-citation><mixed-citation xml:lang="en">Li, Z., Yu, J., Liu, X., Peng, L. Load Balancing for Task Scheduling Based on Multi-Agent Reinforcement Learning in Cloud-Edge-End Collaborative Environments. Proceedings of the 2024 8th International Conference on Machine Learning and Soft Computing (ICMLSC ’24), 94–100 (2024). https:// doi.org/10.1145/3647750.3647765</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Rahmika, A.R., Tahir, Z., Paundu, A.W., Zainuddin, Z. Web server load balancing mechanism with least connection algorithm and multi-agent system. CommIT (Communication and Information Technology) Journal, 17(2), 245–258 (2023). https://doi.org/10.21512/commit.v17i2.8872</mixed-citation><mixed-citation xml:lang="en">Rahmika, A.R., Tahir, Z., Paundu, A.W., Zainuddin, Z. Web server load balancing mechanism with least connection algorithm and multi-agent system. CommIT (Communication and Information Technology) Journal, 17(2), 245–258 (2023). https://doi.org/10.21512/commit.v17i2.8872</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Binyamin, S.S., Ben Slama, S. Multi-Agent Systems for Resource Allocation and Scheduling in a Smart Grid. Sensors, 22(21), 8099 (2022). https://doi.org/10.3390/s22218099</mixed-citation><mixed-citation xml:lang="en">Binyamin, S.S., Ben Slama, S. Multi-Agent Systems for Resource Allocation and Scheduling in a Smart Grid. Sensors, 22(21), 8099 (2022). https://doi.org/10.3390/s22218099</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Chatterjee, B. Distributed Machine Learning. Proceedings of the 25th International Conference on Distributed Computing and Networking (ICDCN ’24), 4–7 (2024). https://doi.org/10.1145/3631461.3632516</mixed-citation><mixed-citation xml:lang="en">Chatterjee, B. Distributed Machine Learning. Proceedings of the 25th International Conference on Distributed Computing and Networking (ICDCN ’24), 4–7 (2024). https://doi.org/10.1145/3631461.3632516</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">Dai, F., Hossain, M.A., Wang, Y. State of the Art in Parallel and Distributed Systems: Emerging Trends and Challenges. Electronics, 14(4), 677 (2025). https://doi.org/10.3390/electronics14040677</mixed-citation><mixed-citation xml:lang="en">Dai, F., Hossain, M.A., Wang, Y. State of the Art in Parallel and Distributed Systems: Emerging Trends and Challenges. Electronics, 14(4), 677 (2025). https://doi.org/10.3390/electronics14040677</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>
