Performance analysis of a token-based distributed mutual exclusion protocol
The authors develop a methodology by which an approximation to a polling system model is used to analyze the performance of a simple circulating token mutual exclusion protocol. This protocol is chosen for a first attempt to apply performance measurement to mutual exclusion algorithms primarily beca...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | 8 p. |
| container_title | |
| container_volume | |
| creator | Kearns, P. Peterson, S. |
| description | The authors develop a methodology by which an approximation to a polling system model is used to analyze the performance of a simple circulating token mutual exclusion protocol. This protocol is chosen for a first attempt to apply performance measurement to mutual exclusion algorithms primarily because of its simplicity. A simple queueing model for a distributed protocol with a circulating token is presented. The analysis is tractable for arbitrarily large networks, and the results produced seem to be reasonably accurate.< > |
| doi_str_mv | 10.1109/SECON.1993.465769 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_465769</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>465769</ieee_id><sourcerecordid>465769</sourcerecordid><originalsourceid>FETCH-LOGICAL-i87t-db31d180ffcd5f627a96d8c8f7f84916a585b47c4156dd6c089afa56df5541a93</originalsourceid><addsrcrecordid>eNotj8tqwzAURAWlkJL6A9KVfsCuFFmvZTHpg4am0OzDtR6g1raCJEPz9zWkw4E5q4FBaENJQynRj1-77vDRUK1Z0wouhb5BlZaKLDC65VKvUJXzN1nCuVKS3aH3T5d8TCNMxmGYYLjkkHH0GHCJP26qe8jOYhtySaGfy-LjXGYYsPs1w5xDnPA5xRJNHO7RrYchu-q_1-j4vDt2r_X-8PLWPe3roGSpbc-opYp4byz3YitBC6uM8tKrVlMBXPG-laalXFgrDFEaPCzuOW8paLZGD9fZ4Jw7nVMYIV1O18PsD5AZTVc</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Performance analysis of a token-based distributed mutual exclusion protocol</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Kearns, P. ; Peterson, S.</creator><creatorcontrib>Kearns, P. ; Peterson, S.</creatorcontrib><description>The authors develop a methodology by which an approximation to a polling system model is used to analyze the performance of a simple circulating token mutual exclusion protocol. This protocol is chosen for a first attempt to apply performance measurement to mutual exclusion algorithms primarily because of its simplicity. A simple queueing model for a distributed protocol with a circulating token is presented. The analysis is tractable for arbitrarily large networks, and the results produced seem to be reasonably accurate.< ></description><identifier>ISBN: 9780780312579</identifier><identifier>ISBN: 0780312570</identifier><identifier>DOI: 10.1109/SECON.1993.465769</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; Bandwidth ; Broadcasting ; Computer science ; Delay effects ; Distributed algorithms ; Inference algorithms ; Measurement ; Performance analysis ; Protocols</subject><ispartof>Proceedings of Southeastcon '93, 1993, p.8 p.</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/465769$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,4036,4037,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/465769$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Kearns, P.</creatorcontrib><creatorcontrib>Peterson, S.</creatorcontrib><title>Performance analysis of a token-based distributed mutual exclusion protocol</title><title>Proceedings of Southeastcon '93</title><addtitle>SECON</addtitle><description>The authors develop a methodology by which an approximation to a polling system model is used to analyze the performance of a simple circulating token mutual exclusion protocol. This protocol is chosen for a first attempt to apply performance measurement to mutual exclusion algorithms primarily because of its simplicity. A simple queueing model for a distributed protocol with a circulating token is presented. The analysis is tractable for arbitrarily large networks, and the results produced seem to be reasonably accurate.< ></description><subject>Algorithm design and analysis</subject><subject>Bandwidth</subject><subject>Broadcasting</subject><subject>Computer science</subject><subject>Delay effects</subject><subject>Distributed algorithms</subject><subject>Inference algorithms</subject><subject>Measurement</subject><subject>Performance analysis</subject><subject>Protocols</subject><isbn>9780780312579</isbn><isbn>0780312570</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1993</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj8tqwzAURAWlkJL6A9KVfsCuFFmvZTHpg4am0OzDtR6g1raCJEPz9zWkw4E5q4FBaENJQynRj1-77vDRUK1Z0wouhb5BlZaKLDC65VKvUJXzN1nCuVKS3aH3T5d8TCNMxmGYYLjkkHH0GHCJP26qe8jOYhtySaGfy-LjXGYYsPs1w5xDnPA5xRJNHO7RrYchu-q_1-j4vDt2r_X-8PLWPe3roGSpbc-opYp4byz3YitBC6uM8tKrVlMBXPG-laalXFgrDFEaPCzuOW8paLZGD9fZ4Jw7nVMYIV1O18PsD5AZTVc</recordid><startdate>1993</startdate><enddate>1993</enddate><creator>Kearns, P.</creator><creator>Peterson, S.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>1993</creationdate><title>Performance analysis of a token-based distributed mutual exclusion protocol</title><author>Kearns, P. ; Peterson, S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i87t-db31d180ffcd5f627a96d8c8f7f84916a585b47c4156dd6c089afa56df5541a93</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1993</creationdate><topic>Algorithm design and analysis</topic><topic>Bandwidth</topic><topic>Broadcasting</topic><topic>Computer science</topic><topic>Delay effects</topic><topic>Distributed algorithms</topic><topic>Inference algorithms</topic><topic>Measurement</topic><topic>Performance analysis</topic><topic>Protocols</topic><toplevel>online_resources</toplevel><creatorcontrib>Kearns, P.</creatorcontrib><creatorcontrib>Peterson, S.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Kearns, P.</au><au>Peterson, S.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Performance analysis of a token-based distributed mutual exclusion protocol</atitle><btitle>Proceedings of Southeastcon '93</btitle><stitle>SECON</stitle><date>1993</date><risdate>1993</risdate><spage>8 p.</spage><pages>8 p.-</pages><isbn>9780780312579</isbn><isbn>0780312570</isbn><abstract>The authors develop a methodology by which an approximation to a polling system model is used to analyze the performance of a simple circulating token mutual exclusion protocol. This protocol is chosen for a first attempt to apply performance measurement to mutual exclusion algorithms primarily because of its simplicity. A simple queueing model for a distributed protocol with a circulating token is presented. The analysis is tractable for arbitrarily large networks, and the results produced seem to be reasonably accurate.< ></abstract><pub>IEEE</pub><doi>10.1109/SECON.1993.465769</doi></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 9780780312579 |
| ispartof | Proceedings of Southeastcon '93, 1993, p.8 p. |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_465769 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Algorithm design and analysis Bandwidth Broadcasting Computer science Delay effects Distributed algorithms Inference algorithms Measurement Performance analysis Protocols |
| title | Performance analysis of a token-based distributed mutual exclusion protocol |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-06T06%3A00%3A14IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Performance%20analysis%20of%20a%20token-based%20distributed%20mutual%20exclusion%20protocol&rft.btitle=Proceedings%20of%20Southeastcon%20'93&rft.au=Kearns,%20P.&rft.date=1993&rft.spage=8%20p.&rft.pages=8%20p.-&rft.isbn=9780780312579&rft.isbn_list=0780312570&rft_id=info:doi/10.1109/SECON.1993.465769&rft_dat=%3Cieee_6IE%3E465769%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=465769&rfr_iscdi=true |