<?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="en"><front><journal-meta><journal-id journal-id-type="publisher-id">Discrete and Continuous Models and Applied Computational Science</journal-id><journal-title-group><journal-title xml:lang="en">Discrete and Continuous Models and Applied Computational Science</journal-title><trans-title-group xml:lang="ru"><trans-title>Discrete and Continuous Models and Applied Computational Science</trans-title></trans-title-group></journal-title-group><issn publication-format="print">2658-4670</issn><issn publication-format="electronic">2658-7149</issn><publisher><publisher-name xml:lang="en">Peoples' Friendship University of Russia named after Patrice Lumumba (RUDN University)</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">17890</article-id><article-id pub-id-type="doi">10.22363/2312-9735-2018-26-1-13-27</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Mathematics</subject></subj-group><subj-group subj-group-type="toc-heading" xml:lang="ru"><subject>Математика</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">A Survey on Queuing Systems with Parallel Servingof Customers. Part II</article-title><trans-title-group xml:lang="ru"><trans-title>Обзор систем параллельной обработки заявок. Часть II</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Gorbunova</surname><given-names>A V</given-names></name><name xml:lang="ru"><surname>Горбунова</surname><given-names>А В</given-names></name></name-alternatives><bio xml:lang="en"><p>Gorbunova A. V. - Candidate of Physical and Mathematical Sciences, assistant of Department of Applied Probability and Informatics of Peoples’ Friendship University of Russia (RUDN University)</p></bio><bio xml:lang="ru"><p>Горбунова Анастасия Владимировна - кандидат физико математических наук, ассистент кафедры прикладной информатики и теории вероятностей РУДН</p></bio><email>gorbunova_av@rudn.university</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Zaryadov</surname><given-names>I S</given-names></name><name xml:lang="ru"><surname>Зарядов</surname><given-names>И С</given-names></name></name-alternatives><bio xml:lang="en"><p>Zaryadov I. S. - Candidate of Physical and Mathematical Sciences, assistant professor of Department of Applied Probability and Informatics of Peoples’ Friendship University of Russia (RUDN University); Senior Researcher of Institute of Informatics Problems of Federal Research Center “Computer Science and Control” Russian Academy of Sciences</p></bio><bio xml:lang="ru"><p>Зарядов Иван Сергеевич - кандидат физико математических наук, доцент кафедры прикладной информатики и теории вероятностей РУДН, старший научный сотрудник ИПИ ФИЦ ИУ РАН</p></bio><email>zaryadov_is@rudn.university</email><xref ref-type="aff" rid="aff1"/><xref ref-type="aff" rid="aff2"/></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Samouylov</surname><given-names>K E</given-names></name><name xml:lang="ru"><surname>Самуйлов</surname><given-names>К Е</given-names></name></name-alternatives><bio xml:lang="en"><p>Samouylov K. E. - professor, Doctor of Engineering Science, head of Department of Applied Probability and Informatics of Peoples’ Friendship University of Russia (RUDN University)</p></bio><bio xml:lang="ru"><p>Самуйлов Константин Евгеньевич - профессор, доктор технических наук, заведующий кафедрой прикладной информатики и теории вероятностей РУДН</p></bio><email>samuylov_ke@rudn.university</email><xref ref-type="aff" rid="aff1"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">Peoples’ Friendship University of Russia (RUDN University)</institution></aff><aff><institution xml:lang="ru">Российский университет дружбы народов</institution></aff></aff-alternatives><aff-alternatives id="aff2"><aff><institution xml:lang="en">Institute of Informatics Problems Federal Research Center “Computer Science and Control” Russian Academy of Sciences</institution></aff><aff><institution xml:lang="ru">Институт проблем информатики Федеральный исследовательский центр «Информатика и управление» РАН</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2018-12-15" publication-format="electronic"><day>15</day><month>12</month><year>2018</year></pub-date><volume>26</volume><issue>1</issue><issue-title xml:lang="en">VOL 26, NO1 (2018)</issue-title><issue-title xml:lang="ru">ТОМ 26, №1 (2018)</issue-title><fpage>13</fpage><lpage>27</lpage><history><date date-type="received" iso-8601-date="2018-02-28"><day>28</day><month>02</month><year>2018</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2018, Gorbunova A.V., Zaryadov I.S., Samouylov K.E.</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2018, Горбунова А.В., Зарядов И.С., Самуйлов К.Е.</copyright-statement><copyright-year>2018</copyright-year><copyright-holder xml:lang="en">Gorbunova A.V., Zaryadov I.S., Samouylov K.E.</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/">http://creativecommons.org/licenses/by/4.0</ali:license_ref></license></permissions><self-uri xlink:href="https://journals.rudn.ru/miph/article/view/17890">https://journals.rudn.ru/miph/article/view/17890</self-uri><abstract xml:lang="en"><p>This paper is a continuation of the survey of the “fork-join” queuing systems (in the westernclassiﬁcation) or the systems with splitting of queries. Interest in such systems is explainedby a wide range of problems that can be solved with their help, since in fact it is a matter ofparallel processing of data and their applications. For example, this may concern the analysis ofdisk arrays, cloud computing, high-performance services and even the process of picking ordersin a warehouse. In the ﬁrst part of the survey, the main features of the described model (andrelated systems) and its construction were introduced. Also the detailed description of theapproach to obtaining an accurate expression of the average response time in the case of twodevices was presented as well as several methods of approximate analysis of this characteristic(the case when the number of devices is more than two). This part of the survey is devotedto the description of other existing methods for approximating the average response time. Inparticular, the approaches of the approximate analysis of the response time are as follows: thematrix-geometric method, the analysis with the help of order statistics for various types ofdistribution of the service time of subqueries.</p></abstract><trans-abstract xml:lang="ru"><p>Данная работа является продолжением обзора методов исследования системы массовогообслуживания вида «fork-join» (в западной классификации) или системы с расщеплениемзапросов. Интерес к рассматриваемой системе объясняется широким спектром задач, которые могут быть решены с её помощью, поскольку фактически речь идёт о параллельнойобработке данных и их приложениях. К примеру, это может касаться анализа работы дисковых массивов, облачных вычислений, высокопроизводительных сервисов и даже процессакомплектации заказов на складе. Если в первой части обзора были описаны особенностипостроения данной модели и родственных ей систем, а также приведено подробное описание подхода к получению точного выражения среднего времени отклика в случае двухприборов и представлено несколько методов приближенного анализа данной характеристики в случае, когда число приборов больше двух, то во второй части обзора представленоописание других существующих методов аппроксимации среднего времени отклика. В частности, к рассматриваемым подходам приближенного анализа времени отклика относятся:матрично-геометрический метод, анализ с помощью порядковых статистик для различныхтипов распределения времени пребывания подзапросов.</p></trans-abstract><kwd-group xml:lang="en"><kwd>queuing system</kwd><kwd>splitting of requests</kwd><kwd>parallel service of requests</kwd><kwd>parallel processing</kwd><kwd>response time</kwd><kwd>synchronization delay</kwd><kwd>matrix geometric method</kwd><kwd>orderstatistics</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>система массового обслуживания</kwd><kwd>расщепление заявок</kwd><kwd>парал-лельное обслуживание</kwd><kwd>параллельная обработка</kwd><kwd>время отклика</kwd><kwd>время синхронизации</kwd><kwd>матрично-геометрический метод</kwd><kwd>порядковые статистики</kwd></kwd-group><funding-group/></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><citation-alternatives><mixed-citation xml:lang="en">A. V. Gorbunova, I. S. Zaryadov, K. E. Samouylov, E. S. Sopin, A Survey on Queuing Systems with Parallel Serving of Customers, RUDN Journal of Mathematics, Information Sciences and Physics 25 (4) (2017) 350–362, in Russian.</mixed-citation><mixed-citation xml:lang="ru">Обзор систем параллельной обработки заявок / А. В. Горбунова, И. С. Зарядов, К. Е. Самуйлов, Э. С. Сопин // Вестник РУДН. Серия: Математика, информатика, физика. - 2017. - Т. 25, № 4. - С. 350--362.</mixed-citation></citation-alternatives></ref><ref id="B2"><label>2.</label><citation-alternatives><mixed-citation xml:lang="en">I. Tsimashenka, W. J. Knottenbelt, Reduction of Subtask Dispersion in Fork-Join Systems, in: Computer Performance Engineering, Springer Berlin Heidelberg, 2013, pp. 325–336.</mixed-citation><mixed-citation xml:lang="ru">Tsimashenka I., Knottenbelt W. J. Reduction of Subtask Dispersion in Fork-Join Systems // Computer Performance Engineering. - Springer Berlin Heidelberg, 2013. - Pp. 325-336.</mixed-citation></citation-alternatives></ref><ref id="B3"><label>3.</label><citation-alternatives><mixed-citation xml:lang="en">G. P. Basharin, Lectures on the Mathematical Theory of Teletraﬃc, PFUR, Moscow, 2009, in Russian.</mixed-citation><mixed-citation xml:lang="ru">Башарин Г. П. Лекции по математической теории телетрафика. - Москва: РУДН, 2009. - 342 с.</mixed-citation></citation-alternatives></ref><ref id="B4"><label>4.</label><citation-alternatives><mixed-citation xml:lang="en">P. P. Bocharov, A. V. Pechinkin, Queueing Theory, PFUR, Moscow, 1995, in Russian.</mixed-citation><mixed-citation xml:lang="ru">Бочаров П. П., Печинкин А. В. Теория массового обслуживания. - Москва: Изд-во РУДН, 1995. - 529 с.</mixed-citation></citation-alternatives></ref><ref id="B5"><label>5.</label><citation-alternatives><mixed-citation xml:lang="en">P. Bocharov, C. D’Apice, A. Pechinkin, S. Salerno, Queueing theory, Brill Academic Publishers, 2004.</mixed-citation><mixed-citation xml:lang="ru">Queueing Theory / P. P. Bocharov, C. D’Apice, A. V. Pechinkin, S. Salerno. - Brill Academic Publishers, 2004. - 457 p.</mixed-citation></citation-alternatives></ref><ref id="B6"><label>6.</label><citation-alternatives><mixed-citation xml:lang="en">E. V. Mokrov, K. E. Samouylov, Modeling of Cloud Computing as a Queuing System with Batch Arrivals, T-Comm — Telecommunications and transport 11 (7) (2013) 139–141, in Russian.</mixed-citation><mixed-citation xml:lang="ru">Мокров Е. В., Самуйлов К. Е. Модель системы облачных вычислений в виде системы массового обслуживания с несколькими очередями и с групповым поступлением заявок // T-Comm - Телекоммуникации и Транспорт. - 2013. - Т. 11, № 7. - С. 139-141.</mixed-citation></citation-alternatives></ref><ref id="B7"><label>7.</label><citation-alternatives><mixed-citation xml:lang="en">E. V. Mokrov, A. V. Chukarin, Performance Analysis of Cloud Computing System with Live Migration, T-Comm — Telecommunications and transport 8 (8) (2014) 64–67, in Russian.</mixed-citation><mixed-citation xml:lang="ru">Мокров Е. В., Чукарин А. В. Анализ показателей эффективности системы облачных вычислений с миграцией серверов // T-Comm - Телекоммуникации и Транспорт. - 2014. - Т. 8, № 8. - С. 64-67.</mixed-citation></citation-alternatives></ref><ref id="B8"><label>8.</label><citation-alternatives><mixed-citation xml:lang="en">S. Balsamo, I. Mura, Approximate Response Time Distribution in Fork and Join Systems, SIGMETRICS Performance Evaluation Review 23 (1) (1995) 305–306.</mixed-citation><mixed-citation xml:lang="ru">Balsamo S., Mura I. Approximate Response Time Distribution in Fork and Join Systems // SIGMETRICS Performance Evaluation Review. - 1995. - Vol. 23, No 1. - Pp. 305-306.</mixed-citation></citation-alternatives></ref><ref id="B9"><label>9.</label><citation-alternatives><mixed-citation xml:lang="en">S. Balsamo, I. Mura, On Queue Length Moments in Fork and Join Queuing Networks with General Service Times, Computer Performance Evaluation Modelling Techniques and Tools. LNCS 1245 (1997) 218–231.</mixed-citation><mixed-citation xml:lang="ru">Balsamo S., Mura I. On Queue Length Moments in Fork and Join Queuing Networks with General Service Times // Computer Performance Evaluation Modelling Techniques and Tools. LNCS. - 1997. - Vol. 1245. - Pp. 218-231.</mixed-citation></citation-alternatives></ref><ref id="B10"><label>10.</label><citation-alternatives><mixed-citation xml:lang="en">S. Balsamo, L. Donatiello, N. M. Van Dijk, Bound Performance Models of Heterogeneous Parallel Processing Systems, IEEE Transactions on Parallel and Distributed Systems 9 (10) (1998) 1041—-1056.</mixed-citation><mixed-citation xml:lang="ru">Balsamo S., Donatiello L., Van Dijk N. M. Bound Performance Models of Heterogeneous Parallel Processing Systems // IEEE Transactions on Parallel and Distributed Systems. - 1998. - Vol. 9, No 10. - Pp. 1041--1056.</mixed-citation></citation-alternatives></ref><ref id="B11"><label>11.</label><citation-alternatives><mixed-citation xml:lang="en">H. G. Perros, On the</mixed-citation><mixed-citation xml:lang="ru">Perros H. G. On the /  / Queue // Performance Evaluation. - 1983. - Vol. 3, No 2. - Pp. 83-93.</mixed-citation></citation-alternatives></ref><ref id="B12"><label>12.</label><mixed-citation>Neuts M. F. Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. - Courier Corporation, 1981. - 332 p.</mixed-citation></ref><ref id="B13"><label>13.</label><mixed-citation>Rao B. M., Posner M. J. M. Algorithmic and Approximation Analyses of the Split and Match Queue // Stochastic Models. - 1985. - Vol. 1, No 3. - Pp. 433-456.</mixed-citation></ref><ref id="B14"><label>14.</label><mixed-citation>Takahashi M., ¯ Osawa H., Fujisawa T. On a Synchronization Queue with Two Finite Buﬀers // Queueing Systems. - 2000. - Vol. 36. - Pp. 107-123.</mixed-citation></ref><ref id="B15"><label>15.</label><mixed-citation>Takahashi M., Takahashi Y. Synchronization Queue with Two MAP Inputs and Finite Buﬀers // Proc. of the Third International Conference on Matrix Analytical Methods in Stochastic Models. - 2000. - Pp. 375-390.</mixed-citation></ref><ref id="B16"><label>16.</label><mixed-citation>Generalized Parallel-Server Fork-Join Queues with Dynamic Task Scheduling / M. S. Squillante, Y. Zhang, A. Sivasubramaniam, N. Gautam // Annals of Operations Research. - 2008. - Vol. 160, No 1. - Pp. 227-255.</mixed-citation></ref><ref id="B17"><label>17.</label><mixed-citation>Joshi G., Soljanin E., Wornell G. Eﬃcient Redundancy Techniques for Latency Reduction in Cloud Systems // arXiv preprint arXiv:1508.03599. - 2015.</mixed-citation></ref><ref id="B18"><label>18.</label><mixed-citation>David H. A. Order Statistics. - Wiley, New York, 1981.</mixed-citation></ref><ref id="B19"><label>19.</label><mixed-citation>David H. A., Nagaraja H. N. Order Statistics. - John Wiley &amp; Sons, 2003. - 458 p.</mixed-citation></ref><ref id="B20"><label>20.</label><mixed-citation>Gumbel E. J. Statistics of Extremes. - New York: Columbia University Press, 1958. - 375 p.</mixed-citation></ref><ref id="B21"><label>21.</label><mixed-citation>Allen A. O. Probability, Statistics, and Queueing Theory: With Computer Science Applications. - Gulf Professional Publishing, 1990. - 740 p.</mixed-citation></ref><ref id="B22"><label>22.</label><mixed-citation>Kleinrock L. Queueing Systems, Volume I: Theory. - Wiley Interscience, 1975. - 448 p.</mixed-citation></ref><ref id="B23"><label>23.</label><mixed-citation>Trivedi K. S. Probability and Statistics with Reliability, Queueing, and Computer Science Applications (2nd ed.). - John Wiley &amp; Sons, 2002. - 830 p.</mixed-citation></ref><ref id="B24"><label>24.</label><mixed-citation>Gravey A. A Simple Construction of an Upper Bound for the Mean of the Maximum of  Identically Distributed Random Variables // Journal of Applied Probability. - 1985. - Vol. 22. - Pp. 844--851.</mixed-citation></ref><ref id="B25"><label>25.</label><mixed-citation>The Estimation of Probability Characteristics of Cloud Computing Systems with Splitting of Requests / A. V. Gorbunova, I. S. Zaryadov, S. I. Matushenko, E. S. Sopin // Distributed Computer and Communication Networks. DCCN 2016. Communications in Computer and Information Science. - 2016. - Vol. 678. - Pp. 418-429.</mixed-citation></ref><ref id="B26"><label>26.</label><mixed-citation>Самуйлов К. Е., Зарядов И. С., Горбунова А. В. Анализ времени отклика системы облачных вычислений // T-Comm: Телекоммуникации и транспорт. - 2015. - Т. 9, № 11. - С. 57-61.</mixed-citation></ref><ref id="B27"><label>27.</label><mixed-citation>Thomasian A. Analysis of Fork/Join and Related Queueing Systems // ACM Computing Surveys (CSUR). - 2014. - Vol. 47, No 2. - Pp. 17:1-17:71.</mixed-citation></ref><ref id="B28"><label>28.</label><mixed-citation>Harrison P., S. Z. Queueing Models with Maxima of Service Times // Computer Performance Evaluation. Modelling Techniques and Tools. - Springer Berlin Heidelberg, 2003. - Pp. 152-168.</mixed-citation></ref><ref id="B29"><label>29.</label><mixed-citation>Thomasian A., Menon J. RAID5 Performance with Distributed Sparing // IEEE Transactions on Parallel and Distributed Systems. - 1997. - Vol. 8, No 6. - Pp. 640-657.</mixed-citation></ref><ref id="B30"><label>30.</label><mixed-citation>Johnson N. L., Kotz S., Balakrishnan N. Continuous Univariate Distributions. - Wiley Series in Probability and Statistics, 1995. - Vol. 1, 752 p.</mixed-citation></ref><ref id="B31"><label>31.</label><mixed-citation>Lebrecht A. S., Knottenbelt W. J. Response Time Approximations in Fork-Join Queues // In Proceedings of the 23rd Annual UK Performance Engineering Workshop (UKPEW’07). - 2007.</mixed-citation></ref><ref id="B32"><label>32.</label><mixed-citation>Arnold B. C. Distribution-Free Bounds on the Mean of the Maximum of a Dependent Sample // SIAM Journal on Applied Mathematics. - 1985. - Vol. 38, No 1. - Pp. 163-167.</mixed-citation></ref><ref id="B33"><label>33.</label><mixed-citation>Petzold M. A Note on the First Moment of Extreme Order Statistics from the Normal Distribution // rapport nr.: Seminar Papers. - 2000.</mixed-citation></ref><ref id="B34"><label>34.</label><mixed-citation>Thomasian A., Tantawi A. N. Approximate Solutions for // Fork/Join Synchronization // Proceedings of the 26th conference on Winter simulation (WSC’94) / Society for Computer Simulation International. - 1994. - Pp. 361-368.</mixed-citation></ref></ref-list></back></article>
