Bounds on the asymptotic buffer overflow probabilities of a parallel processing system
In queueing systems with heterogeneous processors and multiclass job flows, weighted queue length policies are known to achieve maximal throughput, that is, stabilize the system under the maximum possible arrival rates, when the buffers are of infinite capacity. However, very little is known regardi...
Uložené v:
| Vydané v: | 1998 Information Theory Workshop, Killarney, Ireland : Great Southern Hotel and Conference Centre, 22-26 June, 1998 s. 145 - 146 |
|---|---|
| Hlavní autori: | , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
1998
|
| Predmet: | |
| ISBN: | 9780780344082, 0780344081 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | In queueing systems with heterogeneous processors and multiclass job flows, weighted queue length policies are known to achieve maximal throughput, that is, stabilize the system under the maximum possible arrival rates, when the buffers are of infinite capacity. However, very little is known regarding the delay or buffer overflow performance of weighted queue length policies in such queueing systems when the buffers are of finite capacity. We consider a time-slotted "fluid" queueing system consisting of two heterogeneous processors in parallel and two queues with finite capacity buffers. There are two classes of job flows. We present some preliminary results that use techniques of large deviations to derive upper and lower bounds on the asymptotic buffer overflow probabilities under any stabilizing scheduling policy (including weighted queue length policies) as the capacities of the buffers tend to infinity. The queueing system has applications in a number of wired and wireless telecommunication networks, computer systems, and flexible manufacturing systems. |
|---|---|
| AbstractList | In queueing systems with heterogeneous processors and multiclass job flows, weighted queue length policies are known to achieve maximal throughput, that is, stabilize the system under the maximum possible arrival rates, when the buffers are of infinite capacity. However, very little is known regarding the delay or buffer overflow performance of weighted queue length policies in such queueing systems when the buffers are of finite capacity. We consider a time-slotted "fluid" queueing system consisting of two heterogeneous processors in parallel and two queues with finite capacity buffers. There are two classes of job flows. We present some preliminary results that use techniques of large deviations to derive upper and lower bounds on the asymptotic buffer overflow probabilities under any stabilizing scheduling policy (including weighted queue length policies) as the capacities of the buffers tend to infinity. The queueing system has applications in a number of wired and wireless telecommunication networks, computer systems, and flexible manufacturing systems. |
| Author | Akin, H.C. Wasserman, K.M. |
| Author_xml | – sequence: 1 givenname: H.C. surname: Akin fullname: Akin, H.C. organization: Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA – sequence: 2 givenname: K.M. surname: Wasserman fullname: Wasserman, K.M. |
| BookMark | eNotT01LxDAUDKigrj0LnvIHWvPZpEdd_FhY8LLqcUnTF420TUmySv-9lXUYmMPMe8xcotMxjIDQNSUVpaS53ezeK9o0ulKkFlqcoKJRmizkQhDNzlGR0hdZwBtJNbtAb_fhMHYJhxHnT8AmzcOUQ_YWtwfnIOLwDdH14QdPMbSm9b3PHpa8wwZPJpq-h_7Ps5CSHz9wmlOG4QqdOdMnKP51hV4fH3br53L78rRZ321LT5XIJTTSdlzWnHPZdVZRA9KqrnVLe1YLZ0lrGeEarJLMOFkr6YQT3DGuOrqcrtDN8a8HgP0U_WDivD-O578ZB1LQ |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/ITW.1998.706484 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EndPage | 146 |
| ExternalDocumentID | 706484 |
| GroupedDBID | 6IE 6IK 6IL AAJGR AAWTH ACGHX ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK OCL RIE RIL |
| ID | FETCH-LOGICAL-i174t-e95cd3563335ddc71ae5c7dbf064264fc0bc2038ec752af5675f4f43f237d1cd3 |
| IEDL.DBID | RIE |
| ISBN | 9780780344082 0780344081 |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000075926100071&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Tue Aug 26 17:34:12 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i174t-e95cd3563335ddc71ae5c7dbf064264fc0bc2038ec752af5675f4f43f237d1cd3 |
| PageCount | 2 |
| ParticipantIDs | ieee_primary_706484 |
| PublicationCentury | 1900 |
| PublicationDate | 19980000 |
| PublicationDateYYYYMMDD | 1998-01-01 |
| PublicationDate_xml | – year: 1998 text: 19980000 |
| PublicationDecade | 1990 |
| PublicationTitle | 1998 Information Theory Workshop, Killarney, Ireland : Great Southern Hotel and Conference Centre, 22-26 June, 1998 |
| PublicationTitleAbbrev | ITW |
| PublicationYear | 1998 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0000395182 |
| Score | 1.2590001 |
| Snippet | In queueing systems with heterogeneous processors and multiclass job flows, weighted queue length policies are known to achieve maximal throughput, that is,... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 145 |
| SubjectTerms | Application software Buffer overflow Capacity planning Computer aided manufacturing Computer networks Delay H infinity control Job shop scheduling Processor scheduling Throughput |
| Title | Bounds on the asymptotic buffer overflow probabilities of a parallel processing system |
| URI | https://ieeexplore.ieee.org/document/706484 |
| WOSCitedRecordID | wos000075926100071&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8MgGCVu8aAXdc74Oxy8dmsLFLhqXPSy7DB1t4XCR7KktsvWafzvhVKnJl68tU1KCJA83gfvPYRupEehXKqIa80iBwEqEkz5rBcglEMcOzbXhE3w8VjMZnLS-mw3WhgAaC6fwcA_Nmf5ptIbXyobcoefgnZQh3MepFrbckpM3FZBBGIuvI2dg7rWX-frPW2dfZJYDh-nL16nJwahyV_RKg2yjA7-1adD1P9W6OHJFnuO0A6UPbT_w1zwGD3f-sSkNa5K7DZ5WK0_Xpd15dYJzjc-FAX7y5u2qN6xD5UJdt2ONuPKYoW9I3hRQIGXQUjgWsTB9LmPnkb307uHqE1RiBaObdQRSKYNYRkhhBmjeaKAaW5y66lHRq2Oc53GRIDmLFWWOQZhqaXEpoSbxP16grplVcIpwpnJdGISbt30UgFKak0htzJLBaQZk2eo5wdovgxGGfMwNud_fr1Ae0He56sZl6hbrzZwhXb1W71Yr66byf0EmeyjrQ |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NS8MwHA06BfWizonf5uC1W9skTXJVHBvOscPU3UaaDxjUdmyd4n9v0tSp4MVbW2gISeDl_ZL3HgA33KFQykVApSSBhQARMCJc1otGmOowtGyuCpugwyGbTPio9tmutDBa6-rymW67x-osXxVy5UplHWrxk-FNsEUwjiMv1loXVEJkNwvMU3PmjOws2NUOO1_vce3tE4W80x-_OKUea_tGf4WrVNjS3f9Xrw5A61ujB0dr9DkEGzpvgr0f9oJH4PnWZSYtYZFDu82DYvnxOi8Lu1JgunKxKNBd3zRZ8Q5drIw37LbEGRYGCug8wbNMZ3DupQS2Rehtn1vgqXs_vusFdY5CMLN8oww0J1IhkiCEiFKSRkITSVVqHPlIsJFhKuMQMS0piYUhlkMYbDAyMaIqsr8eg0Ze5PoEwEQlMlIRNXaCMdOCS4l1angSMx0nhJ-Cphug6dxbZUz92Jz9-fUa7PTGj4PpoD98OAe7XuznahsXoFEuVvoSbMu3crZcXFUT_QlMhqb0 |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=1998+Information+Theory+Workshop%2C+Killarney%2C+Ireland+%3A+Great+Southern+Hotel+and+Conference+Centre%2C+22-26+June%2C+1998&rft.atitle=Bounds+on+the+asymptotic+buffer+overflow+probabilities+of+a+parallel+processing+system&rft.au=Akin%2C+H.C.&rft.au=Wasserman%2C+K.M.&rft.date=1998-01-01&rft.pub=IEEE&rft.isbn=9780780344082&rft.spage=145&rft.epage=146&rft_id=info:doi/10.1109%2FITW.1998.706484&rft.externalDocID=706484 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780344082/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780344082/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780344082/sc.gif&client=summon&freeimage=true |