|
This article is cited in 1 scientific paper (total in 1 paper)
System Analysis, Control and Data Processing
Analysis of fork/join and related queueing systems
O. Osipov, I. E. Tananko Saratov State University, Saratov
Abstract:
This article introduces a generalization of the classical parallel-server fork-join queueing networks.
We consider open fork-join queueing networks with an arbitrary topology. There are three types of nodes in the queueing networks (service-nodes, fork-nodes, join-nodes). We focus on the infinite server case, in which each service-node is a queueing system with infinite servers. An arriving job is split (at fork-nodes) into a number of independent tasks that are serviced in parallel (at multiple service-nodes). Each task can be split at fork-nodes repetitively. These tasks synchronize (at join-nodes) before they leave the network.
A method, which allows to obtain the sojourn time distribution, was developed.
Keywords:
fork-join networks, queueing network, sojourn time distribution, performance evaluation, synchronization, parallel processing, PH-distribution.
Received: 29.06.2017 Revised: 11.12.2017
Citation:
O. Osipov, I. E. Tananko, “Analysis of fork/join and related queueing systems”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2017, no. 4, 43–58
Linking options:
https://www.mathnet.ru/eng/vtpmk188 https://www.mathnet.ru/eng/vtpmk/y2017/i4/p43
|
Statistics & downloads: |
Abstract page: | 435 | Full-text PDF : | 226 | References: | 30 |
|