{"id":9895,"date":"2021-12-14T19:48:10","date_gmt":"2021-12-14T17:48:10","guid":{"rendered":"http:\/\/journals.khnu.km.ua\/vestnik\/?p=9895"},"modified":"2026-07-26T18:07:45","modified_gmt":"2026-07-26T15:07:45","slug":"metody-zahystu-informaczijnyh-resursiv-v-telekomunikaczijnyh-systemah","status":"publish","type":"post","link":"https:\/\/journals.khnu.km.ua\/vestnik\/?p=9895","title":{"rendered":"\u0410\u043d\u0430\u043b\u0456\u0437 \u043c\u0435\u0442\u043e\u0434\u0456\u0432 \u0442\u0430 \u043c\u043e\u0434\u0435\u043b\u0435\u0439 \u0432\u0438\u0440\u0456\u0448\u0435\u043d\u043d\u044f \u0437\u0430\u0434\u0430\u0447\u0456 \u0432\u0437\u0430\u0454\u043c\u043e\u0431\u043b\u043e\u043a\u0443\u0432\u0430\u043d\u043d\u044f \u043f\u0440\u043e\u0446\u0435\u0441\u0456\u0432 \u0443 \u043a\u043e\u043c\u043f’\u044e\u0442\u0435\u0440\u043d\u0438\u0445 \u0441\u0438\u0441\u0442\u0435\u043c\u0430\u0445"},"content":{"rendered":"

<\/p>\n

\u0410\u041d\u0410\u041b\u0406\u0417 \u041c\u0415\u0422\u041e\u0414\u0406\u0412 \u0422\u0410 \u041c\u041e\u0414\u0415\u041b\u0415\u0419 \u0412\u0418\u0420\u0406\u0428\u0415\u041d\u041d\u042f \u0417\u0410\u0414\u0410\u0427\u0406 \u0412\u0417\u0410\u0404\u041c\u041e\u0411\u041b\u041e\u041a\u0423\u0412\u0410\u041d\u041d\u042f \u041f\u0420\u041e\u0426\u0415\u0421\u0406\u0412 \u0423 \u041a\u041e\u041c\u041f’\u042e\u0422\u0415\u0420\u041d\u0418\u0425 \u0421\u0418\u0421\u0422\u0415\u041c\u0410\u0425<\/p>\n

ANALYSIS OF METHODS AND MODELS FOR SOLVING THE PROCESS DEADLOCK PROBLEM IN COMPUTER SYSTEMS<\/p>\n

\u0421\u0442\u043e\u0440\u0456\u043d\u043a\u0438: 2<\/strong>7-31<\/strong>. \u041d\u043e\u043c\u0435\u0440: \u21165, 2021 (301)<\/strong> \"\"<\/a>
\n\u00a0<\/strong>\u0410\u0432\u0442\u043e\u0440:<\/strong>
\n\u041c\u041e\u0421\u0422\u041e\u0412\u0418\u0419 \u0421.\u0412.
\n\u0425\u043c\u0435\u043b\u044c\u043d\u0438\u0446\u044c\u043a\u0438\u0439 \u043d\u0430\u0446\u0456\u043e\u043d\u0430\u043b\u044c\u043d\u0438\u0439 \u0443\u043d\u0456\u0432\u0435\u0440\u0441\u0438\u0442\u0435\u0442
\nORCID ID: 0000-0002-9505-3206
\ne-mail: serhii.mostovyi@khmnu.edu.ua
\nMOSTOVYI SERHII V.
\nKhmelnytskyi National University
\nDOI:<\/strong> https:\/\/www.doi.org\/10.31891\/2307-5732-2021-301-5-27-31<\/a>
\n\u0420\u0435\u0446\u0435\u043d\u0437\u0456\u044f\/Peer review <\/strong>: 06.09.2021\u0440.
\n\u041d\u0430\u0434\u0440\u0443\u043a\u043e\u0432\u0430\u043d\u0430\/Printed :<\/strong> 10.10.2021 \u0440.
\n\u0410\u043d\u043e\u0442\u0430\u0446\u0456\u044f \u043c\u043e\u0432\u043e\u044e \u043e\u0440\u0438\u0433\u0456\u043d\u0430\u043b\u0443<\/strong>
\n\u0423 \u0441\u0442\u0430\u0442\u0442\u0456 \u043f\u0440\u043e\u0432\u0435\u0434\u0435\u043d\u043e \u0430\u043d\u0430\u043b\u0456\u0437 \u043f\u0440\u0438\u0447\u0438\u043d, \u0443\u043c\u043e\u0432 \u0442\u0430 \u043c\u0435\u0445\u0430\u043d\u0456\u0437\u043c\u0456\u0432 \u0432\u0438\u043d\u0438\u043a\u043d\u0435\u043d\u043d\u044f \u0432\u0437\u0430\u0454\u043c\u043e\u0431\u043b\u043e\u043a\u0443\u0432\u0430\u043d\u044c \u043f\u0440\u043e\u0446\u0435\u0441\u0456\u0432 \u0443 \u0441\u0443\u0447\u0430\u0441\u043d\u0438\u0445 \u0431\u0430\u0433\u0430\u0442\u043e\u0437\u0430\u0434\u0430\u0447\u043d\u0438\u0445 \u043a\u043e\u043c\u043f’\u044e\u0442\u0435\u0440\u043d\u0438\u0445 \u0441\u0438\u0441\u0442\u0435\u043c\u0430\u0445. \u0420\u043e\u0437\u0433\u043b\u044f\u043d\u0443\u0442\u043e \u043a\u043b\u0430\u0441\u0438\u0444\u0456\u043a\u0430\u0446\u0456\u044e \u0441\u0438\u0441\u0442\u0435\u043c\u043d\u0438\u0445 \u0440\u0435\u0441\u0443\u0440\u0441\u0456\u0432 \u0437\u0430 \u0444\u0456\u0437\u0438\u0447\u043d\u043e\u044e \u043f\u0440\u0438\u0440\u043e\u0434\u043e\u044e, \u043c\u043e\u0436\u043b\u0438\u0432\u0456\u0441\u0442\u044e \u0441\u043f\u0456\u043b\u044c\u043d\u043e\u0433\u043e \u0432\u0438\u043a\u043e\u0440\u0438\u0441\u0442\u0430\u043d\u043d\u044f, \u043c\u043e\u0436\u043b\u0438\u0432\u0456\u0441\u0442\u044e \u043f\u0440\u0438\u043c\u0443\u0441\u043e\u0432\u043e\u0433\u043e \u0432\u0438\u043b\u0443\u0447\u0435\u043d\u043d\u044f \u0442\u0430 \u043a\u0456\u043b\u044c\u043a\u0456\u0441\u0442\u044e \u0435\u043a\u0437\u0435\u043c\u043f\u043b\u044f\u0440\u0456\u0432. \u041f\u0440\u043e\u0430\u043d\u0430\u043b\u0456\u0437\u043e\u0432\u0430\u043d\u043e \u0441\u0443\u0447\u0430\u0441\u043d\u0456 \u0433\u0440\u0430\u0444\u043e\u0432\u0456 \u0442\u0430 \u0441\u0442\u043e\u0445\u0430\u0441\u0442\u0438\u0447\u043d\u0456 \u043c\u043e\u0434\u0435\u043b\u0456 \u0440\u0435\u0441\u0443\u0440\u0441\u043d\u043e\u0457 \u0432\u0437\u0430\u0454\u043c\u043e\u0434\u0456\u0457, \u0437\u043e\u043a\u0440\u0435\u043c\u0430 \u043a\u043b\u0430\u0441\u0438\u0447\u043d\u0456 \u0433\u0440\u0430\u0444\u0438 \u0440\u043e\u0437\u043f\u043e\u0434\u0456\u043b\u0443 \u0440\u0435\u0441\u0443\u0440\u0441\u0456\u0432, \u0433\u0440\u0430\u0444\u0438 \u043e\u0447\u0456\u043a\u0443\u0432\u0430\u043d\u043d\u044f \u0442\u0430 \u043c\u0430\u0440\u043a\u043e\u0432\u0441\u044c\u043a\u0456 \u043c\u043e\u0434\u0435\u043b\u0456 \u0441\u0442\u0430\u043d\u0456\u0432 \u043a\u043e\u043c\u043f’\u044e\u0442\u0435\u0440\u043d\u043e\u0457 \u0441\u0438\u0441\u0442\u0435\u043c\u0438. \u0414\u0435\u0442\u0430\u043b\u044c\u043d\u043e \u0434\u043e\u0441\u043b\u0456\u0434\u0436\u0435\u043d\u043e \u0447\u043e\u0442\u0438\u0440\u0438 \u043e\u0441\u043d\u043e\u0432\u043d\u0456 \u0433\u0440\u0443\u043f\u0438 \u043c\u0435\u0442\u043e\u0434\u0456\u0432 \u0431\u043e\u0440\u043e\u0442\u044c\u0431\u0438 \u0456\u0437 \u0432\u0437\u0430\u0454\u043c\u043e\u0431\u043b\u043e\u043a\u0443\u0432\u0430\u043d\u043d\u044f\u043c\u0438: \u0456\u0433\u043d\u043e\u0440\u0443\u0432\u0430\u043d\u043d\u044f (\u0430\u043b\u0433\u043e\u0440\u0438\u0442\u043c \u0441\u0442\u0440\u0430\u0443\u0441\u0430), \u0437\u0430\u043f\u043e\u0431\u0456\u0433\u0430\u043d\u043d\u044f (\u0448\u043b\u044f\u0445\u043e\u043c \u043f\u043e\u0440\u0443\u0448\u0435\u043d\u043d\u044f \u0443\u043c\u043e\u0432 \u041a\u043e\u0444\u0444\u043c\u0430\u043d\u0430), \u0443\u043d\u0438\u043a\u043d\u0435\u043d\u043d\u044f (\u0432\u043a\u043b\u044e\u0447\u0430\u044e\u0447\u0438 \u0430\u043b\u0433\u043e\u0440\u0438\u0442\u043c \u0431\u0430\u043d\u043a\u0456\u0440\u0430) \u0442\u0430 \u0432\u0438\u044f\u0432\u043b\u0435\u043d\u043d\u044f \u0437 \u043f\u043e\u0434\u0430\u043b\u044c\u0448\u0438\u043c \u0443\u0441\u0443\u043d\u0435\u043d\u043d\u044f\u043c \u043a\u0440\u0438\u0442\u0438\u0447\u043d\u0438\u0445 \u0441\u0442\u0430\u043d\u0456\u0432. \u041e\u0431\u0491\u0440\u0443\u043d\u0442\u043e\u0432\u0430\u043d\u043e \u043d\u0430\u0443\u043a\u043e\u0432\u043e-\u0442\u0435\u0445\u043d\u0456\u0447\u043d\u0435 \u043f\u0440\u043e\u0442\u0438\u0440\u0456\u0447\u0447\u044f \u043c\u0456\u0436 \u0440\u0435\u0430\u043a\u0442\u0438\u0432\u043d\u0438\u043c \u0445\u0430\u0440\u0430\u043a\u0442\u0435\u0440\u043e\u043c \u0431\u0456\u043b\u044c\u0448\u043e\u0441\u0442\u0456 \u0442\u0440\u0430\u0434\u0438\u0446\u0456\u0439\u043d\u0438\u0445 \u043f\u0456\u0434\u0445\u043e\u0434\u0456\u0432 \u0442\u0430 \u043d\u0435\u043e\u0431\u0445\u0456\u0434\u043d\u0456\u0441\u0442\u044e \u043f\u0440\u043e\u0430\u043a\u0442\u0438\u0432\u043d\u043e\u0433\u043e \u043e\u0446\u0456\u043d\u044e\u0432\u0430\u043d\u043d\u044f \u0440\u0438\u0437\u0438\u043a\u0456\u0432. \u0414\u043e\u0432\u0435\u0434\u0435\u043d\u043e \u0434\u043e\u0446\u0456\u043b\u044c\u043d\u0456\u0441\u0442\u044c \u043f\u0435\u0440\u0435\u0445\u043e\u0434\u0443 \u0434\u043e \u043c\u0435\u0442\u043e\u0434\u0456\u0432 \u0437\u0430\u0432\u0447\u0430\u0441\u043d\u043e\u0433\u043e \u043f\u0440\u043e\u0433\u043d\u043e\u0437\u0443\u0432\u0430\u043d\u043d\u044f \u0441\u0442\u0430\u043d\u0443 \u0432\u0437\u0430\u0454\u043c\u043e\u0431\u043b\u043e\u043a\u0443\u0432\u0430\u043d\u043d\u044f \u043d\u0430 \u043e\u0441\u043d\u043e\u0432\u0456 \u0441\u0438\u0433\u043d\u0430\u0442\u0443\u0440 \u043f\u0440\u043e\u0446\u0435\u0441\u0456\u0432, \u043d\u0435\u0447\u0456\u0442\u043a\u043e\u0457 \u043a\u043b\u0430\u0441\u0442\u0435\u0440\u0438\u0437\u0430\u0446\u0456\u0457 Fuzzy C-Means \u0442\u0430 \u043d\u0435\u0447\u0456\u0442\u043a\u043e\u0433\u043e \u043b\u043e\u0433\u0456\u0447\u043d\u043e\u0433\u043e \u0432\u0438\u0441\u043d\u043e\u0432\u043a\u0443.
\n\u041a\u043b\u044e\u0447\u043e\u0432\u0456 \u0441\u043b\u043e\u0432\u0430:<\/strong> \u043a\u043e\u043c\u043f\u2019\u044e\u0442\u0435\u0440\u043d\u0456 \u0441\u0438\u0441\u0442\u0435\u043c\u0438, \u0432\u0437\u0430\u0454\u043c\u043e\u0431\u043b\u043e\u043a\u0443\u0432\u0430\u043d\u043d\u044f \u043f\u0440\u043e\u0446\u0435\u0441\u0456\u0432, \u0441\u0438\u0441\u0442\u0435\u043c\u043d\u0456 \u0440\u0435\u0441\u0443\u0440\u0441\u0438, \u0433\u0440\u0430\u0444\u0438 \u0440\u043e\u0437\u043f\u043e\u0434\u0456\u043b\u0443 \u0440\u0435\u0441\u0443\u0440\u0441\u0456\u0432, \u0433\u0440\u0430\u0444 \u043e\u0447\u0456\u043a\u0443\u0432\u0430\u043d\u043d\u044f, \u043c\u0430\u0440\u043a\u043e\u0432\u0441\u044c\u043a\u0456 \u043c\u043e\u0434\u0435\u043b\u0456, \u0443\u043c\u043e\u0432\u0438 \u041a\u043e\u0444\u0444\u043c\u0430\u043d\u0430, \u0430\u043b\u0433\u043e\u0440\u0438\u0442\u043c \u0431\u0430\u043d\u043a\u0456\u0440\u0430, \u043f\u0440\u043e\u0433\u043d\u043e\u0437\u0443\u0432\u0430\u043d\u043d\u044f \u0440\u0438\u0437\u0438\u043a\u0443.<\/p>\n

\u00a0<\/strong>\u0420\u043e\u0437\u0448\u0438\u0440\u0435\u043d\u0430 \u0430\u043d\u043e\u0442\u0430\u0446\u0456\u044f \u0430\u043d\u0433\u043b\u0456\u0439\u0441\u044c\u043a\u043e\u044e \u043c\u043e\u0432\u043e\u044e<\/strong><\/p>\n

The article analyzes the causes, conditions, and mechanisms of process deadlocks in modern multitasking computer systems. The classification of system resources is examined based on their physical nature, shareability, preemptibility, and the number of instances. Modern graph-based and stochastic models of resource interaction are analyzed, specifically classical resource allocation graphs, wait-for graphs, and Markov models of computer system states. Four main groups of deadlock handling methods are investigated in detail: ignoring (the ostrich algorithm), prevention (by violating Coffman conditions), avoidance (including the banker’s algorithm), and detection followed by the elimination of critical states. A scientific and technical contradiction between the reactive nature of most traditional approaches and the need for proactive risk assessment is substantiated. The feasibility of transitioning to methods for the early prediction of deadlock states based on process signatures, Fuzzy C-Means clustering, and fuzzy logic inference is demonstrated.
\nKeywords:<\/strong> computer systems, process deadlock, system resources, resource allocation graphs, wait-for graph, Markov models, Coffman conditions, banker’s algorithm, risk prediction.<\/p>\n

References<\/strong><\/p>\n

    \n
  1. Dychka, I. A. Orhanizatsiia obchysliuvalnykh protsesiv u paralelnykh ta rozpodilenykh komp\u2019iuternykh systemakh. Komp\u2019iuterna Inzheneriia. \u2013 2018. \u2013 \u2116 2. \u2013 P. 45\u201352.<\/li>\n
  2. Mukhin, V. Ye., & Volokita, A. M. Metody ta zasoby adaptyvnoho upravlinnia resursamy v rozpodilenykh komp’iuternykh merezhakh. Naukova Dumka, 2020. \u2013 240 p.<\/li>\n
  3. Melnyk, A. O. Arkhitektura komp’iuternykh system ta yikhnikh komponentiv: pidruchnyk. Lviv Polytechnic Publishing House, 2019. \u2013 412 p.<\/li>\n
  4. Coffman E. G. System Deadlocks \/ E. G. Coffman, M. J. Elphick, A. Shoshani \/\/ ACM Computing Surveys. \u2013 1971. \u2013 Vol. 3, No. 2. \u2013 P. 67\u201378.<\/li>\n
  5. Dijkstra E. W. Co-operating sequential processes \/ E. W. Dijkstra \/\/ Programming Languages \/ Academic Press. \u2013 1968. \u2013 P. 43\u2013112.<\/li>\n
  6. Holt R. C. Some Deadlock Properties of Computer Systems \/ R. C. Holt \/\/ ACM Computing Surveys. \u2013 1972. \u2013 Vol. 4, No. 3. \u2013 P. 179\u2013196.<\/li>\n
  7. Tanenbaum A. S. Modern Operating Systems: 4th Edition \/ A. S. Tanenbaum, H. Bos. \u2013 Boston: Pearson, 2015. \u2013 1136 p.<\/li>\n
  8. Stallings W. Operating Systems: Internals and Design Principles: 9th Edition \/ W. Stallings. \u2013 New York: Pearson, 2018. \u2013 864 p.<\/li>\n
  9. Chandy K. M. Distributed Deadlock Detection \/ K. M. Chandy, J. Misra, L. M. Haas \/\/ ACM Transactions on Computer Systems. \u2013 1983. \u2013 Vol. 1, No. 2. \u2013 P. 144\u2013156.<\/li>\n
  10. Mathur U. Dynamic Deadlock Detection for Concurrent Programs \/ U. Mathur, A. Pavlogiannis, M. Viswanathan \/\/ Proceedings of the ACM on Programming Languages. \u2013 2020. \u2013 Vol. 4 (POPL). \u2013 P. 1\u201330.<\/li>\n<\/ol>\n","protected":false},"excerpt":{"rendered":"","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":[],"categories":[58],"tags":[],"_links":{"self":[{"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=\/wp\/v2\/posts\/9895"}],"collection":[{"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=9895"}],"version-history":[{"count":10,"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=\/wp\/v2\/posts\/9895\/revisions"}],"predecessor-version":[{"id":21889,"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=\/wp\/v2\/posts\/9895\/revisions\/21889"}],"wp:attachment":[{"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=9895"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=9895"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=9895"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}