Another distributed algorithm for multiple entries to a critical section
A new algorithm is proposed to allow K simultaneous entries into a critical section in a distributed system. The proposed algorithm needs in the worst case half as many message exchanges as in a recently published algorithm (K. Raymond, Inform. Process. Lett. 30 (1989) 189–193). A simplistic average...
Gespeichert in:
| Veröffentlicht in: | Information processing letters 1992-01, Vol.41 (1), p.51-57 |
|---|---|
| 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 | 57 |
|---|---|
| container_issue | 1 |
| container_start_page | 51 |
| container_title | Information processing letters |
| container_volume | 41 |
| creator | Srimani, Pradip K. Reddy, Rachamallu L.N. |
| description | A new algorithm is proposed to allow
K simultaneous entries into a critical section in a distributed system. The proposed algorithm needs in the worst case half as many message exchanges as in a recently published algorithm (K. Raymond,
Inform. Process. Lett. 30 (1989) 189–193). A simplistic average case analysis of the proposed algorithm is presented which shows that we get almost 50% savings in number of messages in the average case also. |
| doi_str_mv | 10.1016/0020-0190(92)90079-B |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_25775972</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>002001909290079B</els_id><sourcerecordid>25775972</sourcerecordid><originalsourceid>FETCH-LOGICAL-c457t-bfc94bb5913d42039ff5b3a948c4a0ac116f21aa506146b18b4ff1cee8f196533</originalsourceid><addsrcrecordid>eNp90EFLHDEUwPEgFdyq38BDKKW0h9G8TGYyuRRWsV1B8KLnkMm8aJbZyTbJCH77Zt3FQw895fJ774U_IRfALoFBe8UYZxUDxb4r_kMxJlV1fUQW0EletQDqE1l8kBPyOaU1Y6wVtVyQ1XIK-QUjHXzK0fdzxoGa8TlEn1821IVIN_OY_XZEilMRmGgO1FBbgLdmpAlt9mE6I8fOjAnPD-8pefp1-3izqu4fft_dLO8rKxqZq95ZJfq-UVAPgrNaOdf0tVGis8IwYwFax8GYhrUg2h66XjgHFrFzoNqmrk_Jt_3ebQx_ZkxZb3yyOI5mwjAnzRspGyV5gV_-geswx6n8TfNacslVpwoSe2RjSCmi09voNya-aWB611bvwuldOK24fm-rr8vY18Nuk0oDF81kffqYbUQtoIXCfu4ZliCvHqNO1uNkcfCxVNND8P-_8xf0yIyl</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>237272989</pqid></control><display><type>article</type><title>Another distributed algorithm for multiple entries to a critical section</title><source>Elsevier ScienceDirect Journals</source><creator>Srimani, Pradip K. ; Reddy, Rachamallu L.N.</creator><creatorcontrib>Srimani, Pradip K. ; Reddy, Rachamallu L.N.</creatorcontrib><description>A new algorithm is proposed to allow
K simultaneous entries into a critical section in a distributed system. The proposed algorithm needs in the worst case half as many message exchanges as in a recently published algorithm (K. Raymond,
Inform. Process. Lett. 30 (1989) 189–193). A simplistic average case analysis of the proposed algorithm is presented which shows that we get almost 50% savings in number of messages in the average case also.</description><identifier>ISSN: 0020-0190</identifier><identifier>EISSN: 1872-6119</identifier><identifier>DOI: 10.1016/0020-0190(92)90079-B</identifier><identifier>CODEN: IFPLAT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithms ; Applied sciences ; Computer programming ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Distributed systems ; Exact sciences and technology ; Information processing ; Mathematical models ; mutual exclusion ; Procedures ; Software</subject><ispartof>Information processing letters, 1992-01, Vol.41 (1), p.51-57</ispartof><rights>1992</rights><rights>1992 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Jan 21, 1992</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c457t-bfc94bb5913d42039ff5b3a948c4a0ac116f21aa506146b18b4ff1cee8f196533</citedby><cites>FETCH-LOGICAL-c457t-bfc94bb5913d42039ff5b3a948c4a0ac116f21aa506146b18b4ff1cee8f196533</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/002001909290079B$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27901,27902,65306</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=5434161$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Srimani, Pradip K.</creatorcontrib><creatorcontrib>Reddy, Rachamallu L.N.</creatorcontrib><title>Another distributed algorithm for multiple entries to a critical section</title><title>Information processing letters</title><description>A new algorithm is proposed to allow
K simultaneous entries into a critical section in a distributed system. The proposed algorithm needs in the worst case half as many message exchanges as in a recently published algorithm (K. Raymond,
Inform. Process. Lett. 30 (1989) 189–193). A simplistic average case analysis of the proposed algorithm is presented which shows that we get almost 50% savings in number of messages in the average case also.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Computer programming</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Distributed systems</subject><subject>Exact sciences and technology</subject><subject>Information processing</subject><subject>Mathematical models</subject><subject>mutual exclusion</subject><subject>Procedures</subject><subject>Software</subject><issn>0020-0190</issn><issn>1872-6119</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1992</creationdate><recordtype>article</recordtype><recordid>eNp90EFLHDEUwPEgFdyq38BDKKW0h9G8TGYyuRRWsV1B8KLnkMm8aJbZyTbJCH77Zt3FQw895fJ774U_IRfALoFBe8UYZxUDxb4r_kMxJlV1fUQW0EletQDqE1l8kBPyOaU1Y6wVtVyQ1XIK-QUjHXzK0fdzxoGa8TlEn1821IVIN_OY_XZEilMRmGgO1FBbgLdmpAlt9mE6I8fOjAnPD-8pefp1-3izqu4fft_dLO8rKxqZq95ZJfq-UVAPgrNaOdf0tVGis8IwYwFax8GYhrUg2h66XjgHFrFzoNqmrk_Jt_3ebQx_ZkxZb3yyOI5mwjAnzRspGyV5gV_-geswx6n8TfNacslVpwoSe2RjSCmi09voNya-aWB611bvwuldOK24fm-rr8vY18Nuk0oDF81kffqYbUQtoIXCfu4ZliCvHqNO1uNkcfCxVNND8P-_8xf0yIyl</recordid><startdate>19920101</startdate><enddate>19920101</enddate><creator>Srimani, Pradip K.</creator><creator>Reddy, Rachamallu L.N.</creator><general>Elsevier B.V</general><general>Elsevier Science</general><general>Elsevier Sequoia S.A</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>19920101</creationdate><title>Another distributed algorithm for multiple entries to a critical section</title><author>Srimani, Pradip K. ; Reddy, Rachamallu L.N.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c457t-bfc94bb5913d42039ff5b3a948c4a0ac116f21aa506146b18b4ff1cee8f196533</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1992</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Computer programming</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Distributed systems</topic><topic>Exact sciences and technology</topic><topic>Information processing</topic><topic>Mathematical models</topic><topic>mutual exclusion</topic><topic>Procedures</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Srimani, Pradip K.</creatorcontrib><creatorcontrib>Reddy, Rachamallu L.N.</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>Information processing letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Srimani, Pradip K.</au><au>Reddy, Rachamallu L.N.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Another distributed algorithm for multiple entries to a critical section</atitle><jtitle>Information processing letters</jtitle><date>1992-01-01</date><risdate>1992</risdate><volume>41</volume><issue>1</issue><spage>51</spage><epage>57</epage><pages>51-57</pages><issn>0020-0190</issn><eissn>1872-6119</eissn><coden>IFPLAT</coden><abstract>A new algorithm is proposed to allow
K simultaneous entries into a critical section in a distributed system. The proposed algorithm needs in the worst case half as many message exchanges as in a recently published algorithm (K. Raymond,
Inform. Process. Lett. 30 (1989) 189–193). A simplistic average case analysis of the proposed algorithm is presented which shows that we get almost 50% savings in number of messages in the average case also.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/0020-0190(92)90079-B</doi><tpages>7</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0020-0190 |
| ispartof | Information processing letters, 1992-01, Vol.41 (1), p.51-57 |
| issn | 0020-0190 1872-6119 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_25775972 |
| source | Elsevier ScienceDirect Journals |
| subjects | Algorithms Applied sciences Computer programming Computer science control theory systems Computer systems and distributed systems. User interface Distributed systems Exact sciences and technology Information processing Mathematical models mutual exclusion Procedures Software |
| title | Another distributed algorithm for multiple entries to a critical section |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-30T14%3A26%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=Another%20distributed%20algorithm%20for%20multiple%20entries%20to%20a%20critical%20section&rft.jtitle=Information%20processing%20letters&rft.au=Srimani,%20Pradip%20K.&rft.date=1992-01-01&rft.volume=41&rft.issue=1&rft.spage=51&rft.epage=57&rft.pages=51-57&rft.issn=0020-0190&rft.eissn=1872-6119&rft.coden=IFPLAT&rft_id=info:doi/10.1016/0020-0190(92)90079-B&rft_dat=%3Cproquest_cross%3E25775972%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=237272989&rft_id=info:pmid/&rft_els_id=002001909290079B&rfr_iscdi=true |