An approximation to the response time for shortest queue routing

In this paper we derive an approximation for the mean response time of a multiple queue system in which shortest queue routing is used. We assume there are Κ identical queues with infinite capacity and service times that are exponentially distributed. Arrivals of jobs to this system are Poisson and...

Full description

Saved in:
Bibliographic Details
Main Authors: Nelson, R. D., Philips, T. K.
Format: Conference Proceeding
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c146t-73f7f2c3aa55bf99e927c3439a55f3d9e4de351d8b801d70ed32703e862d25c53
cites cdi_FETCH-LOGICAL-c146t-73f7f2c3aa55bf99e927c3439a55f3d9e4de351d8b801d70ed32703e862d25c53
container_end_page 189
container_issue 1
container_start_page 181
container_title
container_volume 17
creator Nelson, R. D.
Philips, T. K.
description In this paper we derive an approximation for the mean response time of a multiple queue system in which shortest queue routing is used. We assume there are Κ identical queues with infinite capacity and service times that are exponentially distributed. Arrivals of jobs to this system are Poisson and are routed to a queue of minimal length. We develop an approximation which is based on both theoretical and experimental considerations and, for Κ ≤ 8, has an relative error of less than one half of one percent when compared to simulation. For Κ = 16, the relative error is still acceptable, being less than 2 percent. An application to a model of parallel processing and a comparison of static and dynamic load balancing schemes are presented.
doi_str_mv 10.1145/75372.75392
format conference_proceeding
fullrecord <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_1145_75372_75392</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1145_75372_75392</sourcerecordid><originalsourceid>FETCH-LOGICAL-c146t-73f7f2c3aa55bf99e927c3439a55f3d9e4de351d8b801d70ed32703e862d25c53</originalsourceid><addsrcrecordid>eNotj09LxDAUxHNQcF09-QVyl655eU3T3FwW_8GCFz2HbPPiVtymJinot7euXmYYGIb5MXYFYgVQqxutUMvVrEaesIWABitljDlj5zm_CwFaQrtgt-uBu3FM8as_uNLHgZfIy554ojzGIRMv_YF4iInnfUyFcuGfE01zIU6lH94u2GlwH5ku_33JXu_vXjaP1fb54Wmz3lYd1E2pNAYdZIfOKbULxpCRusMazZwDekO1J1Tg210rwGtBHqUWSG0jvVSdwiW7_tvtUsw5UbBjmi-nbwvC_gLbI7A9AuMPg5VKbw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>An approximation to the response time for shortest queue routing</title><source>Association for Computing Machinery:Jisc Collections:ACM OPEN Journals 2023-2025 (reading list)</source><creator>Nelson, R. D. ; Philips, T. K.</creator><creatorcontrib>Nelson, R. D. ; Philips, T. K.</creatorcontrib><description>In this paper we derive an approximation for the mean response time of a multiple queue system in which shortest queue routing is used. We assume there are Κ identical queues with infinite capacity and service times that are exponentially distributed. Arrivals of jobs to this system are Poisson and are routed to a queue of minimal length. We develop an approximation which is based on both theoretical and experimental considerations and, for Κ ≤ 8, has an relative error of less than one half of one percent when compared to simulation. For Κ = 16, the relative error is still acceptable, being less than 2 percent. An application to a model of parallel processing and a comparison of static and dynamic load balancing schemes are presented.</description><identifier>ISSN: 0163-5999</identifier><identifier>DOI: 10.1145/75372.75392</identifier><language>eng</language><ispartof>Performance evaluation review, 1989, Vol.17 (1), p.181-189</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c146t-73f7f2c3aa55bf99e927c3439a55f3d9e4de351d8b801d70ed32703e862d25c53</citedby><cites>FETCH-LOGICAL-c146t-73f7f2c3aa55bf99e927c3439a55f3d9e4de351d8b801d70ed32703e862d25c53</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Nelson, R. D.</creatorcontrib><creatorcontrib>Philips, T. K.</creatorcontrib><title>An approximation to the response time for shortest queue routing</title><title>Performance evaluation review</title><description>In this paper we derive an approximation for the mean response time of a multiple queue system in which shortest queue routing is used. We assume there are Κ identical queues with infinite capacity and service times that are exponentially distributed. Arrivals of jobs to this system are Poisson and are routed to a queue of minimal length. We develop an approximation which is based on both theoretical and experimental considerations and, for Κ ≤ 8, has an relative error of less than one half of one percent when compared to simulation. For Κ = 16, the relative error is still acceptable, being less than 2 percent. An application to a model of parallel processing and a comparison of static and dynamic load balancing schemes are presented.</description><issn>0163-5999</issn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1989</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNotj09LxDAUxHNQcF09-QVyl655eU3T3FwW_8GCFz2HbPPiVtymJinot7euXmYYGIb5MXYFYgVQqxutUMvVrEaesIWABitljDlj5zm_CwFaQrtgt-uBu3FM8as_uNLHgZfIy554ojzGIRMv_YF4iInnfUyFcuGfE01zIU6lH94u2GlwH5ku_33JXu_vXjaP1fb54Wmz3lYd1E2pNAYdZIfOKbULxpCRusMazZwDekO1J1Tg210rwGtBHqUWSG0jvVSdwiW7_tvtUsw5UbBjmi-nbwvC_gLbI7A9AuMPg5VKbw</recordid><startdate>198904</startdate><enddate>198904</enddate><creator>Nelson, R. D.</creator><creator>Philips, T. K.</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>198904</creationdate><title>An approximation to the response time for shortest queue routing</title><author>Nelson, R. D. ; Philips, T. K.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c146t-73f7f2c3aa55bf99e927c3439a55f3d9e4de351d8b801d70ed32703e862d25c53</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1989</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Nelson, R. D.</creatorcontrib><creatorcontrib>Philips, T. K.</creatorcontrib><collection>CrossRef</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Nelson, R. D.</au><au>Philips, T. K.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>An approximation to the response time for shortest queue routing</atitle><btitle>Performance evaluation review</btitle><date>1989-04</date><risdate>1989</risdate><volume>17</volume><issue>1</issue><spage>181</spage><epage>189</epage><pages>181-189</pages><issn>0163-5999</issn><abstract>In this paper we derive an approximation for the mean response time of a multiple queue system in which shortest queue routing is used. We assume there are Κ identical queues with infinite capacity and service times that are exponentially distributed. Arrivals of jobs to this system are Poisson and are routed to a queue of minimal length. We develop an approximation which is based on both theoretical and experimental considerations and, for Κ ≤ 8, has an relative error of less than one half of one percent when compared to simulation. For Κ = 16, the relative error is still acceptable, being less than 2 percent. An application to a model of parallel processing and a comparison of static and dynamic load balancing schemes are presented.</abstract><doi>10.1145/75372.75392</doi><tpages>9</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0163-5999
ispartof Performance evaluation review, 1989, Vol.17 (1), p.181-189
issn 0163-5999
language eng
recordid cdi_crossref_primary_10_1145_75372_75392
source Association for Computing Machinery:Jisc Collections:ACM OPEN Journals 2023-2025 (reading list)
title An approximation to the response time for shortest queue routing
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-06T13%3A12%3A05IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=An%20approximation%20to%20the%20response%20time%20for%20shortest%20queue%20routing&rft.btitle=Performance%20evaluation%20review&rft.au=Nelson,%20R.%20D.&rft.date=1989-04&rft.volume=17&rft.issue=1&rft.spage=181&rft.epage=189&rft.pages=181-189&rft.issn=0163-5999&rft_id=info:doi/10.1145/75372.75392&rft_dat=%3Ccrossref%3E10_1145_75372_75392%3C/crossref%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c146t-73f7f2c3aa55bf99e927c3439a55f3d9e4de351d8b801d70ed32703e862d25c53%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true