<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE root>
<article 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" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="research-article" dtd-version="1.2" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">News of the Kabardino-Balkarian Scientific Center of the Russian Academy of Sciences</journal-id><journal-title-group><journal-title xml:lang="en">News of the Kabardino-Balkarian Scientific Center of the Russian Academy of Sciences</journal-title><trans-title-group xml:lang="ru"><trans-title>Известия Кабардино-Балкарского научного центра РАН</trans-title></trans-title-group></journal-title-group><issn publication-format="print">1991-6639</issn><issn publication-format="electronic">2949-1940</issn></journal-meta><article-meta><article-id pub-id-type="publisher-id">255997</article-id><article-id pub-id-type="doi">10.35330/1991-6639-2024-26-2-34-43</article-id><article-id pub-id-type="edn">SLDLOB</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="ru"><subject>Информатика и информационные процессы</subject></subj-group><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Informatics and information processes</subject></subj-group><subj-group subj-group-type="article-type"><subject>Research Article</subject></subj-group></article-categories><title-group><article-title xml:lang="en">Using hierarchical indexing for access control to shared resources in microservices</article-title><trans-title-group xml:lang="ru"><trans-title>Использование иерархических индексов для блокировки доступа к разделяемому ресурсу в микросервисах</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0009-0007-3996-1844</contrib-id><name-alternatives><name xml:lang="en"><surname>Kirillov</surname><given-names>Vladimir S.</given-names></name><name xml:lang="ru"><surname>Кириллов</surname><given-names>Владимир Святославович</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="ru"><p>канд. физ.-мат. наук, доцент</p></bio><bio xml:lang="en"><p>Candidate of Physical and Mathematical Sciences</p></bio><email>vkirillov74@gmail.com</email><xref ref-type="aff" rid="aff1"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="ru">Северо-Кавказский федеральный университет</institution></aff><aff><institution xml:lang="en">North Caucasus Federal University</institution></aff></aff-alternatives><content-language>ru</content-language><pub-date date-type="pub" iso-8601-date="2024-04-15" publication-format="electronic"><day>15</day><month>04</month><year>2024</year></pub-date><pub-date date-type="collection"><year>2024</year></pub-date><volume>26</volume><issue>2</issue><issue-title xml:lang="ru"/><issue-title xml:lang="en"/><fpage>34</fpage><lpage>43</lpage><history><date date-type="received" iso-8601-date="2024-05-31"><day>31</day><month>05</month><year>2024</year></date><date date-type="accepted" iso-8601-date="2024-05-31"><day>31</day><month>05</month><year>2024</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2024, Kirillov V.S.</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2024, Кириллов В.С.</copyright-statement><copyright-year>2024</copyright-year><copyright-holder xml:lang="en">Kirillov V.S.</copyright-holder><copyright-holder xml:lang="ru">Кириллов В.С.</copyright-holder><ali:free_to_read xmlns:ali="http://www.niso.org/schemas/ali/1.0/"/><license><ali:license_ref xmlns:ali="http://www.niso.org/schemas/ali/1.0/">https://creativecommons.org/licenses/by/4.0</ali:license_ref></license></permissions><self-uri xlink:href="https://journals.rcsi.science/1991-6639/article/view/255997">https://journals.rcsi.science/1991-6639/article/view/255997</self-uri><abstract xml:lang="en"><p>This article discusses an innovative algorithm designed for efficient blocking of access to shared resources in microservices. The main feature of this algorithm lies in unifying the processes of resource blocking and operation execution in multithreaded microservices with a hierarchical structure of shared resources. The use of this algorithm significantly simplifies the development of a resource locking system and allows the customization of the level of detail in the blocked resources according to the requirements imposed on the processed microservice messages. One major advantage of the algorithm is the ability to block access to multiple resources without the risk of thread deadlock. This ensures reliability and security in message processing by microservices, especially in cases where simultaneous access to multiple shared resources is required. The research results demonstrate that the proposed algorithm can significantly improve the efficiency of resource locking systems in a microservices architecture, reduce the likelihood of errors, and simplify software development. In the long term, the use of this algorithm can contribute to enhancing the performance and reliability of distributed systems based on microservices.</p></abstract><trans-abstract xml:lang="ru"><p>В данной статье рассматривается инновационный алгоритм, предназначенный для эффективной блокировки доступа к разделяемым ресурсам в микросервисах. Главная особенность этого алгоритма заключается в унификации процессов блокировки и выполнения операций в многопоточных микросервисах с иерархической структурой разделяемых ресурсов. Использование данного алгоритма значительно упрощает разработку системы блокировки ресурсов и дает возможность изменять детализацию блокируемых ресурсов в соответствии с требованиями, предъявляемыми к обрабатываемым микросервисом сообщениям. Большим преимуществом алгоритма является возможность блокировки доступа к нескольким ресурсам без риска взаимной блокировки потоков. Это обеспечивает гарантию надежности и безопасности обработки сообщений микросервисами, особенно в случаях, когда необходимо обращаться к нескольким разделяемым ресурсам одновременно. Результаты исследования показывают, что предложенный алгоритм может значительно улучшить эффективность системы блокировки ресурсов в микросервисной архитектуре, снизить вероятность возникновения ошибок и упростить разработку программного обеспечения. В долгосрочной перспективе использование данного алгоритма может способствовать повышению производительности и надежности распределенных систем на основе микросервисов.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>микросервисы</kwd><kwd>иерархии</kwd><kwd>разделяемые ресурсы</kwd></kwd-group><kwd-group xml:lang="en"><kwd>microservices</kwd><kwd>hierarchies</kwd><kwd>shared resources</kwd></kwd-group><funding-group/></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><mixed-citation>Lukˇsa M. Kubernetes in Action. NY: Manning Publications Co., 2018. 624 p.</mixed-citation></ref><ref id="B2"><label>2.</label><mixed-citation>Rosso J., Lander R., Brand A., Harris J. Production Kubernetes. Sebastopol, California: O’Reilly Media, Inc., 2021. 508 p.</mixed-citation></ref><ref id="B3"><label>3.</label><mixed-citation>Nickoloff J., Kuenzli S. Docker in Action, 2 edition. NY: Manning Publications Co., 2019. 336 p.</mixed-citation></ref><ref id="B4"><label>4.</label><mixed-citation>Brose G., Vogel A., Dubby K. Java programming with CORBA: advanced techniques for building destributed applications. USA: Wiley Computer Publishing, 2001. 710 p.</mixed-citation></ref><ref id="B5"><label>5.</label><mixed-citation>Brose G., Vogel A., Dubby K. OLE automation programmer’s reference: creating programmable 32-bit applications. USA: Redmond, Wash.: Microsoft Press, 1996. 399 p.</mixed-citation></ref><ref id="B6"><label>6.</label><mixed-citation>Humphries J., Konsumer D., Muto D. Practical gRPC. USA: Bleeding Edge Press, 2018. 169 p.</mixed-citation></ref><ref id="B7"><label>7.</label><mixed-citation>Abernethy R.Programmer’s Guide to Apache Thrift. NY: Manning Publications Co., 2019. 592 p.</mixed-citation></ref><ref id="B8"><label>8.</label><mixed-citation>Walls C. Spring Boot in Action. NY: Manning Publications Co., 2015. 264 p.</mixed-citation></ref><ref id="B9"><label>9.</label><mixed-citation>Andrews G.R., Schneider F.B. Concepts and Notations for Concurrent Programming. Computing Surveys. Vol. 15. No. 1. 1983. Pp. 3–43. https://dl.acm.org/doi/pdf/10.1145/ 356901.356903</mixed-citation></ref><ref id="B10"><label>10.</label><mixed-citation>Wirth N. Toward a discipline of real-time programming. Comm. of the ACM. Vol. 20. No. 8. 1977. Pp. 577–583. https://dl.acm.org/doi/pdf/10.1145/359763.359798</mixed-citation></ref><ref id="B11"><label>11.</label><mixed-citation>Kevin J. The Real-Time Producer/Consumer Paradigm: A paradigm for the construction of efficient, predictable real-time systems. SAC ’93: Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing, 1993.</mixed-citation></ref><ref id="B12"><label>12.</label><mixed-citation>Ozansoy C., Zayegh A., Kalam A. The Real-Time Publisher/Subscriber Communication Model for Distributed Substation Systems. IEEE Transactions on Power Delivery. Vol. 22(3). 2007. Pp. 1411–1423.</mixed-citation></ref><ref id="B13"><label>13.</label><mixed-citation>Silberschatz A., Gagne G., Galvin B.P. Operating System Concepts. NY: John Wiley &amp; Sons, 2008. 971 p.</mixed-citation></ref><ref id="B14"><label>14.</label><mixed-citation>Hennessy John L., Patterson David A. Computer Architecture: A Quantitative Approach: Morgan Kaufmann, 2011. 476 p.</mixed-citation></ref><ref id="B15"><label>15.</label><mixed-citation>O’Neil P., O’Neil E., Pal Sh. et al. ORDPATHs: Insert-Friendly XML Node Labels. Proceedings of the 2004 ACM SIGMOD international conference on Management of data. 2004. Pp. 903–908.</mixed-citation></ref></ref-list></back></article>
