<?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">ntv</journal-id><journal-title-group><journal-title xml:lang="ru">Научно-технический вестник информационных технологий, механики и оптики</journal-title><trans-title-group xml:lang="en"><trans-title>Scientific and Technical Journal of Information Technologies, Mechanics and Optics</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2226-1494</issn><issn pub-type="epub">2500-0373</issn><publisher><publisher-name>Университет ИТМО</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.17586/2226-1494-2022-22-2-269-278</article-id><article-id custom-type="elpub" pub-id-type="custom">ntv-158</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>Имитационная модель облачных вычислений со спорадическим механизмом управления параллельным решением задач</article-title><trans-title-group xml:lang="en"><trans-title>Cloud computing simulation model with a sporadic mechanism of parallel task solving control</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-4313-0887</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>Golosov</surname><given-names>P. E.</given-names></name></name-alternatives><bio xml:lang="ru"><p> Голосов Павел Евгеньевич — кандидат технических наук, декан </p><p> Москва, 119571 </p><p> sc 55035594300 </p></bio><bio xml:lang="en"><p>Pavel E. Golosov — PhD, Dean </p><p>Moscow, 119571 </p><p> sc 55035594300 </p></bio><email xlink:type="simple">pgolosov@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0003-4121-1894</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>Gostev</surname><given-names>I. M.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Гостев Иван Михайлович — доктор технических наук, ведущий научный сотрудник </p><p> sc 6602252369 </p><p> Москва, 127051 </p></bio><bio xml:lang="en"><p>Ivan M. Gostev — D.Sc., Leading Researcher </p><p> Moscow, 127051 </p><p> sc 6602252369</p></bio><email xlink:type="simple">igostev@gmail.com</email><xref ref-type="aff" rid="aff-2"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Российская академия народного хозяйства и государственной службы при Президенте Российской Федерации (РАНГХиГС)</institution><country>Россия</country></aff><aff xml:lang="en"><institution>The Russian Presidential Academy of National Economy and Public Administration (RANEPA)</institution><country>Russian Federation</country></aff></aff-alternatives><aff-alternatives id="aff-2"><aff xml:lang="ru"><institution>Институт проблем передачи информации имени А.А. Харкевича РАН</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute)</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2022</year></pub-date><pub-date pub-type="epub"><day>14</day><month>12</month><year>2024</year></pub-date><volume>22</volume><issue>2</issue><fpage>269</fpage><lpage>278</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Голосов П.Е., Гостев И.М., 2024</copyright-statement><copyright-year>2024</copyright-year><copyright-holder xml:lang="ru">Голосов П.Е., Гостев И.М.</copyright-holder><copyright-holder xml:lang="en">Golosov P.E., Gostev I.M.</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://ntv.elpub.ru/jour/article/view/158">https://ntv.elpub.ru/jour/article/view/158</self-uri><abstract><p>Рассмотрена имитационная модель вычислительной системы, построенная в среде Simulink (SimEvent). В соответствии с теорией массового обслуживания система классифицируется как G/G/n/∞. При этом в системе присутствует множество входных потоков, их очередь бесконечна, применяются две обратные связи, отражающие ситуацию повторной обработки в случае отказа или отсутствия решения при первой попытке обработки. Архитектура системы ориентирована на параллельную обработку определенного класса задач, при этом сами задачи независимы по данным. Модель исследована при равномерно распределенных и экспоненциальных входных потоках. Исследована ситуация непрерывных потоков нескольких типов задач, для которых варьируются приоритеты и число фрагментов разбиения. Число фрагментов обуславливает степень параллелизма при выполнении задачи. Показан способ автоматического определения оптимального количества фрагментов задачи для гарантии ее выполнения в директивный срок. Предложено использование механизмов спорадического управления количеством фрагментов задач, поступающих в непрерывном потоке, и управления приоритетами каждого из фрагментов задач. Данный механизм позволит существенно ускорить прохождение задач в директивный срок выполнения. Снижена нагрузка на вычислительную систему и повышена эффективность ее работы. Применение предложенных алгоритмов существенно упростит механизмы планирования в вычислительной системе, что позволит исключить использование планировщика.</p></abstract><trans-abstract xml:lang="en"><p>A simulation model of a computer system built in the Simulink (SimEvent) environment is considered. According to the queuing theory, the system is classified as G/G/n/∞. This means that there are multiple input streams in the system, their queue is infinite, and two feedbacks are applied. These feedbacks reflect the situation of the repeated processing in case of failure or lack of a solution at the first processing attempt. The system architecture under consideration is focused on parallel processing of a certain class of tasks, while the tasks themselves are data-independent. The model is investigated for uniformly distributed and exponential input streams. The situation of continuous streams for several types of tasks is considered, for which priorities and the numbers of partitioning fragments vary. The number of fragments determines the degree of parallelism in the execution of the task. The paper shows a method for automatically determining the optimal number of task fragments to guarantee its completion within the target period. The use of sporadic control mechanisms for a number of the task fragments received in a continuous stream and the priorities managing of each of the task fragments are proposed. The proposed mechanism of the sporadic management made it possible to significantly speed up the tasks completion within the target deadline. As a result, the load on the computing system has been reduced and the efficiency of its operation has been increased. The use of the proposed algorithms significantly simplifies the scheduling mechanisms in the computer system, which allows you to exclude the scheduler.</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>cloud computing</kwd><kwd>parallel algorithms</kwd><kwd>simulation modeling</kwd><kwd>scheduling</kwd><kwd>effectiveness of execution</kwd><kwd>deadline</kwd><kwd>sporadic control</kwd><kwd>SimEvent</kwd><kwd>Simulink</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">Erl T., Puttini R., Mahmood Z. Cloud Computing: Concepts, Technology &amp; Architecture. Pearson, 2013. 528 p.</mixed-citation><mixed-citation xml:lang="en">Erl T., Puttini R., Mahmood Z. Cloud Computing: Concepts, Technology &amp; Architecture. Pearson, 2013, 528 p.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Sudheer M.S., Reddy K.G., Sree R.K., Raju V.P. An effective analysis on various scheduling algorithms in cloud computing // Proc. of the International Conference on Inventive Computing and Informatics (ICICI). 2017. P. 931–936. https://doi.org/10.1109/ICICI.2017.8365274</mixed-citation><mixed-citation xml:lang="en">Sudheer M.S., Reddy K.G., Sree R.K., Raju V.P. An effective analysis on various scheduling algorithms in cloud computing. Proc. of the International Conference on Inventive Computing and Informatics (ICICI), 2017, pp. 931–936. https://doi.org/10.1109/ICICI.2017.8365274</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Hu J., Gu J., Sun G., Zhao T. A scheduling strategy on load balancing of virtual machine resources in cloud computing environment // Proc. of the 3rd International Symposium on Parallel Architectures, Algorithms and Programming (PAAP). 2010. P. 89–96. https://doi.org/10.1109/PAAP.2010.65</mixed-citation><mixed-citation xml:lang="en">Hu J., Gu J., Sun G., Zhao T. A scheduling strategy on load balancing of virtual machine resources in cloud computing environment. Proc. of the 3rd International Symposium on Parallel Architectures, Algorithms and Programming (PAAP), 2010, pp. 89–96. https://doi. org/10.1109/PAAP.2010.65 4. Brandberg C., Di Natale M. A SimEvents model for the analysis of scheduling and memory access delays in multicores. Proc. of the 13th International Symposium on Industrial Embedded Systems (SIES), 2018, pp. 8442094. https://doi.org/10.1109/SIES.2018.8442094</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Brandberg C., Di Natale M. A SimEvents model for the analysis of scheduling and memory access delays in multicores // Proc. of the 13th International Symposium on Industrial Embedded Systems (SIES). 2018. P. 8442094. https://doi.org/10.1109/SIES.2018.8442094</mixed-citation><mixed-citation xml:lang="en">Gomathi B., Krishnasamy K. Task scheduling algorithm based on Hybrid Particle Swarm Optimization in cloud computing environment. Journal of Theoretical and Applied Information Technology, 2013, vol. 55, no. 1, pp. 33–38.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Gomathi B., Krishnasamy K. Task scheduling algorithm based on Hybrid Particle Swarm Optimization in cloud computing environment // Journal of Theoretical and Applied Information Technology. 2013. V. 55. N 1. P. 33–38.</mixed-citation><mixed-citation xml:lang="en">Rossi F.D., Calheiros R.N., De Rose C.A.F. A terminology to classify artefacts for cloud infrastructure. Research Advances in Cloud Computing. Springer, 2017, pp. 75–91. https://doi.org/10.1007/978-981-10-5026-8_4</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Rossi F.D., Calheiros R.N., De Rose C.A.F. A terminology to classify artefacts for cloud infrastructure // Research Advances in Cloud Computing. Springer, 2017. P. 75–91. https://doi.org/10.1007/978-981-10-5026-8_4</mixed-citation><mixed-citation xml:lang="en">Tomar A., Pant B., Tripathi V., Verma K.K., Mishra S. Improving QoS of cloudlet scheduling via effective particle swarm model. Lecture Notes in Electrical Engineering, 2022, vol. 768, pp. 137–150. https://doi.org/10.1007/978-981-16-2354-7_13</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Tomar A., Pant B., Tripathi V., Verma K.K., Mishra S. Improving QoS of cloudlet scheduling via effective particle swarm model // Lecture Notes in Electrical Engineering. 2022. V. 768. P. 137–150. https://doi.org/10.1007/978-981-16-2354-7_13</mixed-citation><mixed-citation xml:lang="en">Golosov Р.Е., Kozlov M.V., Malashenko Yu.E., Nazarova I.A., Ronzhin A.F. Analysis of computer job control under uncertainty. Journal of Computer and Systems Sciences International, 2012, vol. 51, no. 1, pp. 49–64. https://doi.org/10.1134/S1064230711060062</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Golosov Р.Е., Kozlov M.V., Malashenko Yu.E., Nazarova I.A., Ronzhin A.F. Analysis of computer job control under uncertainty // Journal of Computer and Systems Sciences International. 2012. V. 51. N 1. P. 49–64. https://doi.org/10.1134/S1064230711060062</mixed-citation><mixed-citation xml:lang="en">Zymbler M.L. A parallel discord discovery algorithm for time series on many-core accelerators. Numerical Methods and Programming, 2019, vol. 20, no. 3, pp. 211–223. (in Russian). https://doi.org/10.26089/NumMet.v20r320</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Цымблер М.Л. Параллельный алгоритм поиска диссонансов временного ряда для многоядерных ускорителей // Вычислительные методы и программирование. 2019. Т. 20. № 3. С. 211– 223. https://doi.org/10.26089/NumMet.v20r320</mixed-citation><mixed-citation xml:lang="en">Golosov P.E., Gostev I.M. On some simulation models of operating system functioning with preemptive scheduling. Telecommunications, 2021, no. 8, pp. 2–22. (in Russian). https://doi.org/10.31044/1684-2588-2021-0-8-2-22</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Голосов П.Е., Гостев И.М. Об имитационном моделировании функционирования операционной системы с вытесняющим планированием // Телекоммуникации. 2021. № 8. С. 2–22. https://doi.org/10.31044/1684-2588-2021-0-8-2-22</mixed-citation><mixed-citation xml:lang="en">Li W., Mani R., Mosterman P.J. Extensible discrete-event simulation framework in SimEvents. Proc. of the 2016 Winter Simulation Conference (WSC), 2016, pp. 943–954. https://doi.org/10.1109/WSC.2016.7822155</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Li W., Mani R., Mosterman P.J. Extensible discrete-event simulation framework in SimEvents // Proc. of the 2016 Winter Simulation Conference (WSC). 2016. P. 943–954. https://doi.org/10.1109/ WSC.2016.7822155</mixed-citation><mixed-citation xml:lang="en">Tareghian S., Bornaee Z. A new approach for scheduling jobs in cloud computing environment. Cumhuriyet University Faculty of Science Science Journal (CSJ), 2015, vol. 36, no. 3, pp. 2499–2506.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Tareghian S., Bornaee Z. A new approach for scheduling jobs in cloud computing environment // Cumhuriyet University Faculty of Science Science Journal (CSJ). 2015. V. 36. N 3. P. 2499–2506.</mixed-citation><mixed-citation xml:lang="en">Kecskemeti G., Hajji W., Tso F.P. Modelling low power compute clusters for cloud simulation. Proc. of the 25th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP), 2017, pp. 39–45. https://doi.org/10.1109/PDP.2017.33</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Kecskemeti G., Hajji W., Tso F.P. Modelling low power compute clusters for cloud simulation // Proc. of the 25th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP). 2017. P. 39–45. https://doi.org/10.1109/ PDP.2017.33</mixed-citation><mixed-citation xml:lang="en">MathWorks. 2016. Simulink® User’s Guide. MathWorks®, Release R2016a, Natick, MA.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">MathWorks. 2016. Simulink® User’s Guide. MathWorks®, Release R2016a, Natick, MA.</mixed-citation><mixed-citation xml:lang="en">MathWorks. 2016. SimEvents®, User’s Guide. MathWorks®, Release R2016a, Natick, MA.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">MathWorks. 2016. SimEvents®, User’s Guide. MathWorks®, Release R2016a, Natick, MA.</mixed-citation><mixed-citation xml:lang="en">Golosov P.E., Gostev I.M. About one cloud computing simulation model. Systems of Signals Generating and Processing in the Field of on Board Communications, Conference Proceedings, 2021, pp. 9416100. https://doi.org/10.1109/IEEECONF51389.2021.9416100</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Golosov P.E., Gostev I.M. About one cloud computing simulation model // Systems of Signals Generating and Processing in the Field of on Board Communications, Conference Proceedings. 2021. P. 9416100. https://doi.org/10.1109/IEEECONF51389.2021.9416100</mixed-citation><mixed-citation xml:lang="en">Golosov P.E., Gostev I.M. Simulation of servers with interrupts in large multiprocessor systems. Journal of Instrument Engineering, 2021, vol. 64, no. 11, pp. 879–886. (in Russian). https://doi.org/10.17586/0021-3454-2021-64-11-879-886</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Голосов П.Е., Гостев И.М. Имитационное моделирование серверов с прерываниями в больших многопроцессорных системах // Известия вузов. Приборостроение. 2021. Т. 64. № 11. С. 879–886. https://doi.org/10.17586/0021-3454-2021-64-11-879-886</mixed-citation><mixed-citation xml:lang="en">Голосов П.Е., Гостев И.М. Имитационное моделирование серверов с прерываниями в больших многопроцессорных системах // Известия вузов. Приборостроение. 2021. Т. 64. № 11. С. 879–886. https://doi.org/10.17586/0021-3454-2021-64-11-879-886</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>
