Nonlinear approximation of characteristics of a fork-join queueing system with Pareto service as a model of parallel structure of data processing

被引:1
作者
Gorbunova, A. V. [1 ]
Lebedev, A. V. [2 ]
机构
[1] Russian Acad Sci, VA Trapeznikov Inst Control Sci, Moscow, Russia
[2] Lomonosov Moscow State Univ, Fac Mech & Math, Dept Probabil Theory, Moscow, Russia
关键词
Parallel computations; Queueing system; System with parallel task processing; Mean response time; Linear regression; OPTIMIZATION;
D O I
10.1016/j.matcom.2023.07.029
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
A fork-join system with Pareto service time distribution is considered as a model of a parallel structure of data processing. For an approximation of the mean response time of the system and its standard deviation, we apply the approach based on a combination of simulation with linear regression and the method of nonlinear Nelder-Mead optimization. Previously, no analysis of fork-join queueing systems with M|G|1 subsystems was carried out due to the complexity of its implementation. Nevertheless, the approach proposed here is capable of delivering approximations of various types of the correlation coefficients of the sojourn times of subtasks in a given system. The analytic expressions derived below are shown to deliver good approximations to these characteristics, as evidenced by numerical experiments. Application of the proposed approach can be extended to systems with more involved architecture, and, in particular, to systems with non-Poisson input flow and various options of distributing of service times of tasks.& COPY; 2023 International Association for Mathematics and Computers in Simulation (IMACS). Published by Elsevier B.V. All rights reserved.
引用
收藏
页码:409 / 428
页数:20
相关论文
共 44 条
[11]  
Gorbunova A. V., 2022, Distributed Computer and Communication Networks: 24th International Conference, DCCN 2021, Revised Selected Papers. Communications in Computer and Information Science (1552), P318, DOI 10.1007/978-3-030-97110-6_25
[12]   Bivariate Distributions of Maximum Remaining Service Times in Fork-Join Infinite-Server Queues [J].
Gorbunova, A. V. ;
Lebedev, A. V. .
PROBLEMS OF INFORMATION TRANSMISSION, 2020, 56 (01) :73-90
[13]  
Gorbunova A.V., 2020, Adv. Syst. Sci. Appl., V20, P105, DOI [10.25728/assa.2020.20.3.926, DOI 10.25728/ASSA.2020.20.3.926]
[14]  
Gorbunova A.V., 2023, Advanc. Syst. Sci. Appl, V23, P99
[15]   The Estimation of Probability Characteristics of Cloud Computing Systems with Splitting of Requests [J].
Gorbunova, Anastasia ;
Zaryadov, Ivan ;
Matyushenko, Sergey ;
Sopin, Eduard .
DISTRIBUTED COMPUTER AND COMMUNICATION NETWORKS, DCCN 2016, 2016, 678 :418-429
[16]   PARETO DISTRIBUTION AS A QUEUE SERVICE DISCIPLINE [J].
HARRIS, CM .
OPERATIONS RESEARCH, 1968, 16 (02) :307-&
[17]  
Jian Tan, 2012, Performance Evaluation Review, V40, P5, DOI 10.1145/2318857.2254761
[18]  
Kochenderfer MJ, 2019, ALGORITHMS FOR OPTIMIZATION
[19]   Cost Optimization of an Unreliable server queue with two stage service process under hybrid vacation policy [J].
Kumar, Anshul ;
Jain, Madhu .
MATHEMATICS AND COMPUTERS IN SIMULATION, 2023, 204 :259-281
[20]   Maximum Remaining Service Time in Infinite-Server Queues [J].
Lebedev, A. V. .
PROBLEMS OF INFORMATION TRANSMISSION, 2018, 54 (02) :176-190