• DocumentCode
    1507748
  • Title

    A decomposition procedure for the analysis of a closed fork/join queueing system

  • Author

    Liu, Y.C. ; Perros, H.G.

  • Author_Institution
    Digital Equipment Corp. Littleton, MA, USA
  • Volume
    40
  • Issue
    3
  • fYear
    1991
  • fDate
    3/1/1991 12:00:00 AM
  • Firstpage
    365
  • Lastpage
    370
  • Abstract
    An iterative approximation algorithm for analyzing a closed queueing system with a K-sibling fork/join queue is presented. The iterative procedure is based on a combination of nearly complete decomposability and the Gauss-Seidel method. The approximation procedure gives good results for the mean response time and the system throughput. The iterative procedure converges to the exact solution in the case of the closed 3-sibling fork/join queue
  • Keywords
    approximation theory; iterative methods; queueing theory; Gauss-Seidel method; closed fork/join queueing system; decomposability; iterative approximation algorithm; mean response time; sibling; system throughput; Approximation algorithms; Computer networks; Delay; Distributed computing; Iterative algorithms; Multiprocessor interconnection networks; Queueing analysis; Routing; Testing; Winches;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.76416
  • Filename
    76416
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1507748