Markovian queueing network models for performance analysis of a single-bus multiprocessor system
An exact solution for the performance analysis of a typical single-bus multiprocessor system is presented. The multiprocessor system is modeled by a Markovian queueing network. An r-stage hypoexponential distribution or an r-stage hyperexponential distribution is used to represent the nonexponential...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on computers 1990-07, Vol.39 (7), p.975-980 |
|---|---|
| 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 | 980 |
|---|---|
| container_issue | 7 |
| container_start_page | 975 |
| container_title | IEEE transactions on computers |
| container_volume | 39 |
| creator | Onyuksel, I.H. Irani, K.B. |
| description | An exact solution for the performance analysis of a typical single-bus multiprocessor system is presented. The multiprocessor system is modeled by a Markovian queueing network. An r-stage hypoexponential distribution or an r-stage hyperexponential distribution is used to represent the nonexponential service times. Consequently, the equilibrium probabilities of two-dimensional Markov chains are expressed by simple recurrence relations. Processing efficiency is used as the primary measure of performance. To investigate the effects of different service time distributions on system performance, comparative results are obtained for a large set of input parameters. The numerical results illustrate that processing efficiency attains its maximum value for a constant (deterministic) service time; if service time of common memory is hypoexponentially distributed, then approximating the service time by an exponential distribution produces less than 6% error on the system performance.< > |
| doi_str_mv | 10.1109/12.55702 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_miscellaneous_28397840</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>55702</ieee_id><sourcerecordid>28397840</sourcerecordid><originalsourceid>FETCH-LOGICAL-c219t-5ee8ce2e8d4c1032bb9c447e9a8aa7f266dcb69816bdf0b4729bb54f1f014f2e3</originalsourceid><addsrcrecordid>eNpFkM1LxDAQxYMouK6CV2-5KF66Jmn6kaMsfsGKFz3XJJ1I3bRdM62y_73RLnp6A_N7j5lHyClnC86ZuuJikWUFE3tkxuOQKJXl-2TGGC8TlUp2SI4Q3xljuWBqRl4fdVj3n43u6McIIzTdG-1g-OrDmrZ9DR6p6wPdQIjS6s4C1Z32W2yQ9o5qitHhITEj0nb0Q7MJvQXE6MEtDtAekwOnPcLJTufk5fbmeXmfrJ7uHpbXq8QKroYkAygtCChraTlLhTHKSlmA0qXWhRN5XluTq5LnpnbMyEIoYzLpuGNcOgHpnFxMufGA-AkOVdugBe91B_2IlShTVZSSRfByAm3oEQO4ahOaVodtxVn1U2HFRfVbYUTPd5karfYuxP8b_OeVKIpCppE7m7gGAP7WU8Y36qd61A</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>28397840</pqid></control><display><type>article</type><title>Markovian queueing network models for performance analysis of a single-bus multiprocessor system</title><source>IEEE Electronic Library (IEL)</source><creator>Onyuksel, I.H. ; Irani, K.B.</creator><creatorcontrib>Onyuksel, I.H. ; Irani, K.B.</creatorcontrib><description>An exact solution for the performance analysis of a typical single-bus multiprocessor system is presented. The multiprocessor system is modeled by a Markovian queueing network. An r-stage hypoexponential distribution or an r-stage hyperexponential distribution is used to represent the nonexponential service times. Consequently, the equilibrium probabilities of two-dimensional Markov chains are expressed by simple recurrence relations. Processing efficiency is used as the primary measure of performance. To investigate the effects of different service time distributions on system performance, comparative results are obtained for a large set of input parameters. The numerical results illustrate that processing efficiency attains its maximum value for a constant (deterministic) service time; if service time of common memory is hypoexponentially distributed, then approximating the service time by an exponential distribution produces less than 6% error on the system performance.< ></description><identifier>ISSN: 0018-9340</identifier><identifier>EISSN: 1557-9956</identifier><identifier>DOI: 10.1109/12.55702</identifier><identifier>CODEN: ITCOB4</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Applied sciences ; Exact sciences and technology ; Exponential distribution ; Multiprocessing systems ; Performance analysis ; Queueing analysis ; System performance ; Systems, networks and services of telecommunications ; Telecommunications ; Telecommunications and information theory ; Teletraffic</subject><ispartof>IEEE transactions on computers, 1990-07, Vol.39 (7), p.975-980</ispartof><rights>1991 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c219t-5ee8ce2e8d4c1032bb9c447e9a8aa7f266dcb69816bdf0b4729bb54f1f014f2e3</citedby><cites>FETCH-LOGICAL-c219t-5ee8ce2e8d4c1032bb9c447e9a8aa7f266dcb69816bdf0b4729bb54f1f014f2e3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/55702$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,778,782,794,27907,27908,54741</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/55702$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19277743$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Onyuksel, I.H.</creatorcontrib><creatorcontrib>Irani, K.B.</creatorcontrib><title>Markovian queueing network models for performance analysis of a single-bus multiprocessor system</title><title>IEEE transactions on computers</title><addtitle>TC</addtitle><description>An exact solution for the performance analysis of a typical single-bus multiprocessor system is presented. The multiprocessor system is modeled by a Markovian queueing network. An r-stage hypoexponential distribution or an r-stage hyperexponential distribution is used to represent the nonexponential service times. Consequently, the equilibrium probabilities of two-dimensional Markov chains are expressed by simple recurrence relations. Processing efficiency is used as the primary measure of performance. To investigate the effects of different service time distributions on system performance, comparative results are obtained for a large set of input parameters. The numerical results illustrate that processing efficiency attains its maximum value for a constant (deterministic) service time; if service time of common memory is hypoexponentially distributed, then approximating the service time by an exponential distribution produces less than 6% error on the system performance.< ></description><subject>Applied sciences</subject><subject>Exact sciences and technology</subject><subject>Exponential distribution</subject><subject>Multiprocessing systems</subject><subject>Performance analysis</subject><subject>Queueing analysis</subject><subject>System performance</subject><subject>Systems, networks and services of telecommunications</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Teletraffic</subject><issn>0018-9340</issn><issn>1557-9956</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1990</creationdate><recordtype>article</recordtype><recordid>eNpFkM1LxDAQxYMouK6CV2-5KF66Jmn6kaMsfsGKFz3XJJ1I3bRdM62y_73RLnp6A_N7j5lHyClnC86ZuuJikWUFE3tkxuOQKJXl-2TGGC8TlUp2SI4Q3xljuWBqRl4fdVj3n43u6McIIzTdG-1g-OrDmrZ9DR6p6wPdQIjS6s4C1Z32W2yQ9o5qitHhITEj0nb0Q7MJvQXE6MEtDtAekwOnPcLJTufk5fbmeXmfrJ7uHpbXq8QKroYkAygtCChraTlLhTHKSlmA0qXWhRN5XluTq5LnpnbMyEIoYzLpuGNcOgHpnFxMufGA-AkOVdugBe91B_2IlShTVZSSRfByAm3oEQO4ahOaVodtxVn1U2HFRfVbYUTPd5karfYuxP8b_OeVKIpCppE7m7gGAP7WU8Y36qd61A</recordid><startdate>19900701</startdate><enddate>19900701</enddate><creator>Onyuksel, I.H.</creator><creator>Irani, K.B.</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>19900701</creationdate><title>Markovian queueing network models for performance analysis of a single-bus multiprocessor system</title><author>Onyuksel, I.H. ; Irani, K.B.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c219t-5ee8ce2e8d4c1032bb9c447e9a8aa7f266dcb69816bdf0b4729bb54f1f014f2e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1990</creationdate><topic>Applied sciences</topic><topic>Exact sciences and technology</topic><topic>Exponential distribution</topic><topic>Multiprocessing systems</topic><topic>Performance analysis</topic><topic>Queueing analysis</topic><topic>System performance</topic><topic>Systems, networks and services of telecommunications</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Teletraffic</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Onyuksel, I.H.</creatorcontrib><creatorcontrib>Irani, K.B.</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>Onyuksel, I.H.</au><au>Irani, K.B.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Markovian queueing network models for performance analysis of a single-bus multiprocessor system</atitle><jtitle>IEEE transactions on computers</jtitle><stitle>TC</stitle><date>1990-07-01</date><risdate>1990</risdate><volume>39</volume><issue>7</issue><spage>975</spage><epage>980</epage><pages>975-980</pages><issn>0018-9340</issn><eissn>1557-9956</eissn><coden>ITCOB4</coden><abstract>An exact solution for the performance analysis of a typical single-bus multiprocessor system is presented. The multiprocessor system is modeled by a Markovian queueing network. An r-stage hypoexponential distribution or an r-stage hyperexponential distribution is used to represent the nonexponential service times. Consequently, the equilibrium probabilities of two-dimensional Markov chains are expressed by simple recurrence relations. Processing efficiency is used as the primary measure of performance. To investigate the effects of different service time distributions on system performance, comparative results are obtained for a large set of input parameters. The numerical results illustrate that processing efficiency attains its maximum value for a constant (deterministic) service time; if service time of common memory is hypoexponentially distributed, then approximating the service time by an exponential distribution produces less than 6% error on the system performance.< ></abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/12.55702</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9340 |
| ispartof | IEEE transactions on computers, 1990-07, Vol.39 (7), p.975-980 |
| issn | 0018-9340 1557-9956 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_28397840 |
| source | IEEE Electronic Library (IEL) |
| subjects | Applied sciences Exact sciences and technology Exponential distribution Multiprocessing systems Performance analysis Queueing analysis System performance Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Teletraffic |
| title | Markovian queueing network models for performance analysis of a single-bus multiprocessor system |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T09%3A33%3A01IST&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=Markovian%20queueing%20network%20models%20for%20performance%20analysis%20of%20a%20single-bus%20multiprocessor%20system&rft.jtitle=IEEE%20transactions%20on%20computers&rft.au=Onyuksel,%20I.H.&rft.date=1990-07-01&rft.volume=39&rft.issue=7&rft.spage=975&rft.epage=980&rft.pages=975-980&rft.issn=0018-9340&rft.eissn=1557-9956&rft.coden=ITCOB4&rft_id=info:doi/10.1109/12.55702&rft_dat=%3Cproquest_RIE%3E28397840%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=28397840&rft_id=info:pmid/&rft_ieee_id=55702&rfr_iscdi=true |