Sojourn times in G/M/1 fork-join networks
We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of...
Gespeichert in:
| Veröffentlicht in: | Naval research logistics 2008-08, Vol.55 (5), p.432-443 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 443 |
|---|---|
| container_issue | 5 |
| container_start_page | 432 |
| container_title | Naval research logistics |
| container_volume | 55 |
| creator | Ko, Sung-Seok Serfozo, Richard F. |
| description | We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 |
| doi_str_mv | 10.1002/nav.20294 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_33591497</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>33591497</sourcerecordid><originalsourceid>FETCH-LOGICAL-c3924-65b335383575eb8818c4bd7c6210c7a374fd873f3c354e1be1124d8c27cfe5243</originalsourceid><addsrcrecordid>eNp1kM9LwzAYhoMoOKcH_4OehB2y5nfS4xw6hTkVdXoLbZZCt67RpHPuvzda9ebp44Xnefl4ATjFaIgRImmTvw8JIhnbAz3MCYJCcrQPekhlDCKRvRyCoxCWCCHBEO-BwYNbuo1vkrZa25BUTTJJb1KclM6v4NLF3Nh2G0M4BgdlXgd78nP74Ony4nF8Bae3k-vxaAoNzQiDgheUcqool9wWSmFlWLGQRhCMjMypZOVCSVpSQzmzuLAYE7ZQhkhTWk4Y7YOzrvfVu7eNDa1eV8HYus4b6zZBx_YMs0xGcNCBxrsQvC31q6_Wud9pjPTXGDqOob_HiGzasduqtrv_QT0bzX8N2BlVaO3Hn5H7lRaSSq6fZxM9G5_f34k5jk99Ah7ubTs</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>33591497</pqid></control><display><type>article</type><title>Sojourn times in G/M/1 fork-join networks</title><source>Wiley Online Library Journals Frontfile Complete</source><creator>Ko, Sung-Seok ; Serfozo, Richard F.</creator><creatorcontrib>Ko, Sung-Seok ; Serfozo, Richard F.</creatorcontrib><description>We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008</description><identifier>ISSN: 0894-069X</identifier><identifier>EISSN: 1520-6750</identifier><identifier>DOI: 10.1002/nav.20294</identifier><language>eng</language><publisher>Hoboken: Wiley Subscription Services, Inc., A Wiley Company</publisher><subject>assembly network ; communications network ; fork-join network ; parallel processing ; queueing ; supply chains ; synchronization</subject><ispartof>Naval research logistics, 2008-08, Vol.55 (5), p.432-443</ispartof><rights>Copyright © 2008 Wiley Periodicals, Inc.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c3924-65b335383575eb8818c4bd7c6210c7a374fd873f3c354e1be1124d8c27cfe5243</citedby><cites>FETCH-LOGICAL-c3924-65b335383575eb8818c4bd7c6210c7a374fd873f3c354e1be1124d8c27cfe5243</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1002%2Fnav.20294$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1002%2Fnav.20294$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,776,780,1411,27901,27902,45550,45551</link.rule.ids></links><search><creatorcontrib>Ko, Sung-Seok</creatorcontrib><creatorcontrib>Serfozo, Richard F.</creatorcontrib><title>Sojourn times in G/M/1 fork-join networks</title><title>Naval research logistics</title><addtitle>Naval Research Logistics</addtitle><description>We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008</description><subject>assembly network</subject><subject>communications network</subject><subject>fork-join network</subject><subject>parallel processing</subject><subject>queueing</subject><subject>supply chains</subject><subject>synchronization</subject><issn>0894-069X</issn><issn>1520-6750</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2008</creationdate><recordtype>article</recordtype><recordid>eNp1kM9LwzAYhoMoOKcH_4OehB2y5nfS4xw6hTkVdXoLbZZCt67RpHPuvzda9ebp44Xnefl4ATjFaIgRImmTvw8JIhnbAz3MCYJCcrQPekhlDCKRvRyCoxCWCCHBEO-BwYNbuo1vkrZa25BUTTJJb1KclM6v4NLF3Nh2G0M4BgdlXgd78nP74Ony4nF8Bae3k-vxaAoNzQiDgheUcqool9wWSmFlWLGQRhCMjMypZOVCSVpSQzmzuLAYE7ZQhkhTWk4Y7YOzrvfVu7eNDa1eV8HYus4b6zZBx_YMs0xGcNCBxrsQvC31q6_Wud9pjPTXGDqOob_HiGzasduqtrv_QT0bzX8N2BlVaO3Hn5H7lRaSSq6fZxM9G5_f34k5jk99Ah7ubTs</recordid><startdate>200808</startdate><enddate>200808</enddate><creator>Ko, Sung-Seok</creator><creator>Serfozo, Richard F.</creator><general>Wiley Subscription Services, Inc., A Wiley Company</general><scope>BSCLL</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>KR7</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>200808</creationdate><title>Sojourn times in G/M/1 fork-join networks</title><author>Ko, Sung-Seok ; Serfozo, Richard F.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c3924-65b335383575eb8818c4bd7c6210c7a374fd873f3c354e1be1124d8c27cfe5243</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2008</creationdate><topic>assembly network</topic><topic>communications network</topic><topic>fork-join network</topic><topic>parallel processing</topic><topic>queueing</topic><topic>supply chains</topic><topic>synchronization</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ko, Sung-Seok</creatorcontrib><creatorcontrib>Serfozo, Richard F.</creatorcontrib><collection>Istex</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Civil Engineering Abstracts</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>Naval research logistics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ko, Sung-Seok</au><au>Serfozo, Richard F.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Sojourn times in G/M/1 fork-join networks</atitle><jtitle>Naval research logistics</jtitle><addtitle>Naval Research Logistics</addtitle><date>2008-08</date><risdate>2008</risdate><volume>55</volume><issue>5</issue><spage>432</spage><epage>443</epage><pages>432-443</pages><issn>0894-069X</issn><eissn>1520-6750</eissn><abstract>We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008</abstract><cop>Hoboken</cop><pub>Wiley Subscription Services, Inc., A Wiley Company</pub><doi>10.1002/nav.20294</doi><tpages>12</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0894-069X |
| ispartof | Naval research logistics, 2008-08, Vol.55 (5), p.432-443 |
| issn | 0894-069X 1520-6750 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_33591497 |
| source | Wiley Online Library Journals Frontfile Complete |
| subjects | assembly network communications network fork-join network parallel processing queueing supply chains synchronization |
| title | Sojourn times in G/M/1 fork-join networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T07%3A53%3A06IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Sojourn%20times%20in%20G/M/1%20fork-join%20networks&rft.jtitle=Naval%20research%20logistics&rft.au=Ko,%20Sung-Seok&rft.date=2008-08&rft.volume=55&rft.issue=5&rft.spage=432&rft.epage=443&rft.pages=432-443&rft.issn=0894-069X&rft.eissn=1520-6750&rft_id=info:doi/10.1002/nav.20294&rft_dat=%3Cproquest_cross%3E33591497%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=33591497&rft_id=info:pmid/&rfr_iscdi=true |