Vestnik TVGU. Seriya: Prikladnaya Matematika [Herald of Tver State University. Series: Applied Mathematics]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.]:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Vestnik TVGU. Seriya: Prikladnaya Matematika [Herald of Tver State University. Series: Applied Mathematics], 2017, Issue 4, Pages 43–58
DOI: https://doi.org/10.26456/vtpmk188 (Mi vtpmk188) 		 
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
Full-text PDF (393 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.26456/vtpmk188
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
Bibliographic databases:
Document Type: Article
UDC: 519.872, 519.21
Language: Russian
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
Citation in format AMSBIB
\Bibitem{OsiTan17}
\by O.~Osipov, I.~E.~Tananko
\paper Analysis of fork/join and related queueing systems
\jour Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.]
\yr 2017
\issue 4
\pages 43--58
\mathnet{http://mi.mathnet.ru/vtpmk188}
\crossref{https://doi.org/10.26456/vtpmk188}
\elib{https://elibrary.ru/item.asp?id=30785129}
Linking options:
  • https://www.mathnet.ru/eng/vtpmk188
  • https://www.mathnet.ru/eng/vtpmk/y2017/i4/p43
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Vestnik TVGU. Seriya: Prikladnaya Matematika [Herald of Tver State University. Series: Applied Mathematics]
    Statistics & downloads:
    Abstract page:435
    Full-text PDF :226
    References:30
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024