A decomposition procedure for the analysis of a closed fork/join queueing system
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 res...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on computers 1991-03, Vol.40 (3), p.365-370 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 370 |
|---|---|
| container_issue | 3 |
| container_start_page | 365 |
| container_title | IEEE transactions on computers |
| container_volume | 40 |
| creator | Liu, Y.C. Perros, H.G. |
| description | 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.< > |
| doi_str_mv | 10.1109/12.76416 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_miscellaneous_28263506</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>76416</ieee_id><sourcerecordid>28263506</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2536-835eeb42d7d061a6d32321c77251bf96c6f7d4ef7ee443b49aceb854f292d7f23</originalsourceid><addsrcrecordid>eNpFkDtPwzAUhS0EEqUgsbJ5AbGk9TvxWCFeUiUYYI4c5xpckrjYydB_T0oqmO5wvvvp6CB0ScmCUqKXlC1yJag6QjMqZZ5pLdUxmhFCi0xzQU7RWUobQohiRM_Q6wrXYEO7Dcn3PnR4G4OFeoiAXYi4_wRsOtPskk84OGywbUKCeh9-LTfBd_h7gAF894HTLvXQnqMTZ5oEF4c7R-8P9293T9n65fH5brXOLJNcZQWXAJVgdV4TRY2qOeOM2jxnklZOK6tcXgtwOYAQvBLaWKgKKRzT449jfI5uJu9YeKyQ-rL1yULTmA7CkEpWMMUlUSN4O4E2hpQiuHIbfWvirqSk3E9WUlb-Tjai1wenSdY0LprO-vTPa6WoKOTIXU2cB4C_eHL8AFWccww</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>28263506</pqid></control><display><type>article</type><title>A decomposition procedure for the analysis of a closed fork/join queueing system</title><source>IEEE Electronic Library (IEL)</source><creator>Liu, Y.C. ; Perros, H.G.</creator><creatorcontrib>Liu, Y.C. ; Perros, H.G.</creatorcontrib><description>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.< ></description><identifier>ISSN: 0018-9340</identifier><identifier>EISSN: 1557-9956</identifier><identifier>DOI: 10.1109/12.76416</identifier><identifier>CODEN: ITCOB4</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Applied sciences ; Approximation algorithms ; Computer networks ; Delay ; Distributed computing ; Exact sciences and technology ; Iterative algorithms ; Multiprocessor interconnection networks ; Operational research and scientific management ; Operational research. Management science ; Queueing analysis ; Queuing theory. Traffic theory ; Routing ; Testing ; Winches</subject><ispartof>IEEE transactions on computers, 1991-03, Vol.40 (3), p.365-370</ispartof><rights>1991 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2536-835eeb42d7d061a6d32321c77251bf96c6f7d4ef7ee443b49aceb854f292d7f23</citedby><cites>FETCH-LOGICAL-c2536-835eeb42d7d061a6d32321c77251bf96c6f7d4ef7ee443b49aceb854f292d7f23</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/76416$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/76416$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19661485$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Liu, Y.C.</creatorcontrib><creatorcontrib>Perros, H.G.</creatorcontrib><title>A decomposition procedure for the analysis of a closed fork/join queueing system</title><title>IEEE transactions on computers</title><addtitle>TC</addtitle><description>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.< ></description><subject>Applied sciences</subject><subject>Approximation algorithms</subject><subject>Computer networks</subject><subject>Delay</subject><subject>Distributed computing</subject><subject>Exact sciences and technology</subject><subject>Iterative algorithms</subject><subject>Multiprocessor interconnection networks</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Queueing analysis</subject><subject>Queuing theory. Traffic theory</subject><subject>Routing</subject><subject>Testing</subject><subject>Winches</subject><issn>0018-9340</issn><issn>1557-9956</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1991</creationdate><recordtype>article</recordtype><recordid>eNpFkDtPwzAUhS0EEqUgsbJ5AbGk9TvxWCFeUiUYYI4c5xpckrjYydB_T0oqmO5wvvvp6CB0ScmCUqKXlC1yJag6QjMqZZ5pLdUxmhFCi0xzQU7RWUobQohiRM_Q6wrXYEO7Dcn3PnR4G4OFeoiAXYi4_wRsOtPskk84OGywbUKCeh9-LTfBd_h7gAF894HTLvXQnqMTZ5oEF4c7R-8P9293T9n65fH5brXOLJNcZQWXAJVgdV4TRY2qOeOM2jxnklZOK6tcXgtwOYAQvBLaWKgKKRzT449jfI5uJu9YeKyQ-rL1yULTmA7CkEpWMMUlUSN4O4E2hpQiuHIbfWvirqSk3E9WUlb-Tjai1wenSdY0LprO-vTPa6WoKOTIXU2cB4C_eHL8AFWccww</recordid><startdate>19910301</startdate><enddate>19910301</enddate><creator>Liu, Y.C.</creator><creator>Perros, H.G.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19910301</creationdate><title>A decomposition procedure for the analysis of a closed fork/join queueing system</title><author>Liu, Y.C. ; Perros, H.G.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2536-835eeb42d7d061a6d32321c77251bf96c6f7d4ef7ee443b49aceb854f292d7f23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1991</creationdate><topic>Applied sciences</topic><topic>Approximation algorithms</topic><topic>Computer networks</topic><topic>Delay</topic><topic>Distributed computing</topic><topic>Exact sciences and technology</topic><topic>Iterative algorithms</topic><topic>Multiprocessor interconnection networks</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Queueing analysis</topic><topic>Queuing theory. Traffic theory</topic><topic>Routing</topic><topic>Testing</topic><topic>Winches</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Liu, Y.C.</creatorcontrib><creatorcontrib>Perros, H.G.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on computers</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Liu, Y.C.</au><au>Perros, H.G.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A decomposition procedure for the analysis of a closed fork/join queueing system</atitle><jtitle>IEEE transactions on computers</jtitle><stitle>TC</stitle><date>1991-03-01</date><risdate>1991</risdate><volume>40</volume><issue>3</issue><spage>365</spage><epage>370</epage><pages>365-370</pages><issn>0018-9340</issn><eissn>1557-9956</eissn><coden>ITCOB4</coden><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.< ></abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/12.76416</doi><tpages>6</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9340 |
| ispartof | IEEE transactions on computers, 1991-03, Vol.40 (3), p.365-370 |
| issn | 0018-9340 1557-9956 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_28263506 |
| source | IEEE Electronic Library (IEL) |
| subjects | Applied sciences Approximation algorithms Computer networks Delay Distributed computing Exact sciences and technology Iterative algorithms Multiprocessor interconnection networks Operational research and scientific management Operational research. Management science Queueing analysis Queuing theory. Traffic theory Routing Testing Winches |
| title | A decomposition procedure for the analysis of a closed fork/join queueing system |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-09T01%3A57%3A56IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20decomposition%20procedure%20for%20the%20analysis%20of%20a%20closed%20fork/join%20queueing%20system&rft.jtitle=IEEE%20transactions%20on%20computers&rft.au=Liu,%20Y.C.&rft.date=1991-03-01&rft.volume=40&rft.issue=3&rft.spage=365&rft.epage=370&rft.pages=365-370&rft.issn=0018-9340&rft.eissn=1557-9956&rft.coden=ITCOB4&rft_id=info:doi/10.1109/12.76416&rft_dat=%3Cproquest_RIE%3E28263506%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=28263506&rft_id=info:pmid/&rft_ieee_id=76416&rfr_iscdi=true |