<?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">cheb</journal-id><journal-title-group><journal-title xml:lang="ru">Чебышевский сборник</journal-title><trans-title-group xml:lang="en"><trans-title>Chebyshevskii Sbornik</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2226-8383</issn><publisher><publisher-name>Tula State Lev Tolstoy  Pedagogical University</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.22405/2226-8383-2019-20-2-499-511</article-id><article-id custom-type="elpub" pub-id-type="custom">cheb-657</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>Сomputer science</subject></subj-group></article-categories><title-group><article-title>Моделирование компьютерных систем с FIFO-дисциплиной обработки прерываний</article-title><trans-title-group xml:lang="en"><trans-title>Simulation of computer systems with FIFO-discipline interrupt handling</trans-title></trans-title-group></title-group><contrib-group><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>Larkin</surname><given-names>Eugene Vasilyevich</given-names></name></name-alternatives><email xlink:type="simple">elarkin@mail.ru</email></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>Privalov</surname><given-names>Alexander Nikolaevich</given-names></name></name-alternatives><email xlink:type="simple">privalov.61@mail.ru</email></contrib></contrib-group><pub-date pub-type="collection"><year>2019</year></pub-date><pub-date pub-type="epub"><day>28</day><month>01</month><year>2020</year></pub-date><volume>20</volume><issue>2</issue><fpage>499</fpage><lpage>511</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Ларкин Е.В., Привалов А.Н., 2019</copyright-statement><copyright-year>2019</copyright-year><copyright-holder xml:lang="ru">Ларкин Е.В., Привалов А.Н.</copyright-holder><copyright-holder xml:lang="en">Larkin E.V., Privalov A.N.</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://www.chebsbornik.ru/jour/article/view/657">https://www.chebsbornik.ru/jour/article/view/657</self-uri><abstract><p>Дисциплина FIFO (First In First Out) обработки прерываний достаточно широко используется в ЭВМ Фон Неймановского типа, применяемых в информационных и цифровых управляющих системах. Цель реализации подобного режима работы — оптимизация времени доступа к данным — достижима только при наличии адекватной модели, описывающей систему. Аналитическая модель построена с использованием фундаментального математического аппарата сетей Петри-Маркова. Первичная Петри-Марковская модель разделена на иерархические уровни, соответствующие количеству заявок на обработку прерываний в очереди. Показано, что с текущего уровня возможно переключение, как на предыдущий, так и на последующий уровни прерываний. Получены зависимости для определения времени пребывания на текущем уровне и вероятностей переключения на сопряженные уровни. Предложен метод преобразования Петри-Марковской модели в полумарковский процесс. Показано, что структура подобного полумарковского процесса представляет собой бинарное дерево. Получены зависимости для определения временных и вероятностных характеристик блужданий по бинарному дереву.</p></abstract><trans-abstract xml:lang="en"><p>The FIFO (First In First Out) discipline of interrupt processing is widely used in Von Neumann type computers of informational and digital control systems. The goal of implementing such modes of operation - optimization time to data access - is achievable only when there is an adequate model, which describes data processing in the system. The analytical model is worked out with use the fundamental mathematical apparatus of Petri-Markov nets. The initial Petri-Markov model is divided into hierarchical levels in accordance with the number of interrupts in queue for processing. It is shown, that from the current level it is possible to switch both to the previous and to the next interrupt. Dependencies for determine the time of residence on the current level, and the probabilities of switching to conjugate levels are obtained. The method of Petri-Markov model transformation into the semi-Markov process is proposed. It is shown, that semi-Markov process obtained has the binary tree structure. Dependences for determining the time and probabilistic characteristics of wandering through a binary tree, are obtained.</p></trans-abstract></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Tzafestas S.G. Introduction to Mobile Robot Control. Elsevier, 2014. 750 p.</mixed-citation><mixed-citation xml:lang="en">Tzafestas S.G. Introduction to Mobile Robot Control. Elsevier, 2014. 750 p.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Landau I.D., Zito G. Digital Control Systems, Design, Identification and Implementation. Springer, 2006. 484 p.</mixed-citation><mixed-citation xml:lang="en">Landau I.D., Zito G. Digital Control Systems, Design, Identification and Implementation. Springer, 2006. 484 p.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Åström J., Wittenmark B., Computer Controlled Systems: Theory and Design. Tsinghua University Press. Prentice Hall, 2002. 557 p.</mixed-citation><mixed-citation xml:lang="en">Åström J., Wittenmark B., Computer Controlled Systems: Theory and Design. Tsinghua University Press. Prentice Hall, 2002. 557 p.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Regehr J. Duongsaa U. 2005. Preventing interrupt overload // Proceedings of the Conference on Languages, Compilers, and Tools for Embedded Systems. 2005. - Pp. 50 – 58.</mixed-citation><mixed-citation xml:lang="en">Regehr J. Duongsaa U. 2005. Preventing interrupt overload // Proceedings of the Conference on Languages, Compilers, and Tools for Embedded Systems. 2005. - Pp. 50 – 58.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Czerwinski, M., Cutrell, E., Horvitz, E. Instant messaging and interruption: Influence of task type on performance // Proceedings of OZCHI. Sydney, Australia - 2000, - https://interruptions.net/literature/Czerwinski-OZCHI00.pdf.</mixed-citation><mixed-citation xml:lang="en">Czerwinski, M., Cutrell, E., Horvitz, E. Instant messaging and interruption: Influence of task type on performance // Proceedings of OZCHI. Sydney, Australia - 2000, - https://interruptions.net/literature/Czerwinski-OZCHI00.pdf.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Bielecki T.R., Jakubowski J., Niewкgiowski M. Conditional Markov chains: Properties, construction and structured dependence // Stochastic Processes and their Applications. V. 127, N. 4. 2017. Pp. 1125–1170.</mixed-citation><mixed-citation xml:lang="en">Bielecki T.R., Jakubowski J., Niewкgiowski M. Conditional Markov chains: Properties, construction and structured dependence // Stochastic Processes and their Applications. V. 127, N. 4. 2017. Pp. 1125–1170.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Ching W.K., Huang X., Ng M.K., Siu T.K. Markov Chains: Models, Algorithms and Applications / International Series in Operations Research &amp; Management Science. V. 189. Springer Science + Business Media NY, 2013. 241 p.</mixed-citation><mixed-citation xml:lang="en">Ching W.K., Huang X., Ng M.K., Siu T.K. Markov Chains: Models, Algorithms and Applications / International Series in Operations Research &amp; Management Science. V. 189. Springer Science + Business Media NY, 2013. 241 p.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Markov A.A. Extension of the law of large numbers to dependent quantities // Izvestiia Fiz.- Matem. Obsch. Kazan Univ., (2-nd Ser.), - 1906, - Pp. 135–156.</mixed-citation><mixed-citation xml:lang="en">Markov A.A. Extension of the law of large numbers to dependent quantities // Izvestiia Fiz.- Matem. Obsch. Kazan Univ., (2-nd Ser.), - 1906, - Pp. 135–156.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Howard R. A. Dynamic Probabilistic Systems. Vol. 1: Markov Models. Vol. II: Semi-Markov and Decision Processes. Courier Corporation, 2012.</mixed-citation><mixed-citation xml:lang="en">Howard R. A. Dynamic Probabilistic Systems. Vol. 1: Markov Models. Vol. II: Semi-Markov and Decision Processes. Courier Corporation, 2012.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Janssen J., Manca R. Applied Semi-Markov processes. Springer US, 2006. 310 p.</mixed-citation><mixed-citation xml:lang="en">Janssen J., Manca R. Applied Semi-Markov processes. Springer US, 2006. 310 p.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Larkin E.V., Malikov A.A., Ivutin A.N. Petri-Markov model of fault-tolerant computer systems // 4th International Conference on Control, Decision and Information Technologies (CoDIT). – 5-7 April 2017, Barcelona, Spain – IEEE, 2017. – P. 416-420.</mixed-citation><mixed-citation xml:lang="en">Larkin E.V., Malikov A.A., Ivutin A.N. Petri-Markov model of fault-tolerant computer systems // 4th International Conference on Control, Decision and Information Technologies (CoDIT). – 5-7 April 2017, Barcelona, Spain – IEEE, 2017. – P. 416-420.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Heymann M. Concurrency and Discrete Event Control // IEEE Control Syst. Mag. 1990. Vol. 10. Pp. 103 – 112.</mixed-citation><mixed-citation xml:lang="en">Heymann M. Concurrency and Discrete Event Control // IEEE Control Syst. Mag. 1990. Vol. 10. Pp. 103 – 112.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Valk R. Concurrency in Communicating Object Petri Nets // Concurr. object-oriented Program. Petri nets. 2001. Pp. 164 – 195.</mixed-citation><mixed-citation xml:lang="en">Valk R. Concurrency in Communicating Object Petri Nets // Concurr. object-oriented Program. Petri nets. 2001. Pp. 164 – 195.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Ivutin A.N, Larkin E.V. Simulation of Concurrent Games // Bulletin of the South Ural State University. Series: Mathematical Modeling, Programming and Computer Software. – Chelyabinsk, 2015. – Vol. 8, № 2. – Pp. 43 – 54.</mixed-citation><mixed-citation xml:lang="en">Ivutin A.N, Larkin E.V. Simulation of Concurrent Games // Bulletin of the South Ural State University. Series: Mathematical Modeling, Programming and Computer Software. – Chelyabinsk, 2015. – Vol. 8, № 2. – Pp. 43 - 54.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Larkin E.V., Ivutin A.N., Kotov V.V., Privalov A.N. Simulation of Relay-races // Bulletin of the South Ural State University. Mathematical Modelling, Programming &amp; Computer Software. - 2016. - Vol. 9. - No 4. - Pp. 117 - 128.</mixed-citation><mixed-citation xml:lang="en">Larkin E.V., Ivutin A.N., Kotov V.V., Privalov A.N. Simulation of Relay-races // Bulletin of the South Ural State University. Mathematical Modelling, Programming &amp; Computer Software. - 2016. - Vol. 9. - No 4. - Pp. 117 – 128.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Larkin E.V., Ivutin A.N. Estimation of Latency in Embedded Real-Time Systems // 3-rd Meditteranean Conference on Embedded Computing (MECO-2014). - 2014. - Budva, Montenegro, 2014. - Pp. 236 - 239.</mixed-citation><mixed-citation xml:lang="en">Larkin E.V., Ivutin A.N. Estimation of Latency in Embedded Real-Time Systems // 3-rd Meditteranean Conference on Embedded Computing (MECO-2014). - 2014. - Budva, Montenegro, 2014. - Pp. 236 - 239.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Larkin E.V., Ivutin A.N., Troshina A. Model of interruptions in Swarm unit // Advances in swarm intelligence. Proceedings of 8-th Internati0onal conference ICSI 2017. Fukuoka, Japan. 2017. Part 1. Pp. 50–59.</mixed-citation><mixed-citation xml:lang="en">Larkin E.V., Ivutin A.N., Troshina A. Model of interruptions in Swarm unit // Advances in swarm intelligence. Proceedings of 8-th Internati0onal conference ICSI 2017. Fukuoka, Japan. 2017. Part 1. Pp. 50 - 59.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Bienstock D., Graph searching, path-width, tree-width and related problems (a survey) // Reliability of Computer and Communication Networks, New Brunswick, NJ, 1989, in: DIMACS Ser. Discrete Math. Theoret. Comput. Sci. Vol. 5, Amer. Math. Soc., Providence, RI, 1991. Pp. 33–49.</mixed-citation><mixed-citation xml:lang="en">Bienstock D., Graph searching, path-width, tree-width and related problems (a survey) // Reliability of Computer and Communication Networks, New Brunswick, NJ, 1989, in: DIMACS Ser. Discrete Math. Theoret. Comput. Sci. Vol. 5, Amer. Math. Soc., Providence, RI, 1991. Pp. 33–49.</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>
