{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T07:55:47Z","timestamp":1649145347069},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[1999,12]]},"abstract":"<jats:p> We propose two modifications of the n-process mutual exclusion algorithm by Peterson for the asynchronous multi-writer\/reader shared memory model. By any of the modifications we can speed up the original n-process algorithm. The running times for the trying regions of the first modified algorithm and the second modified algorithm are (2n - 3)c + O(n<jats:sup>3<\/jats:sup> l) and (n - 1)c + O(n<jats:sup>3<\/jats:sup> l), respectively, where n is the number of processes, l is an upper bound on the time between two steps, and c is an upper bound on the time that any user spends in the critical region. These running times are improvements on the running time, O(n<jats:sup>2<\/jats:sup>c + n<jats:sup>4<\/jats:sup> l) of the original n-process algorithm for the same asynchronous shared memory model. <\/jats:p>","DOI":"10.1142\/s012962649900044x","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T13:10:49Z","timestamp":1051276249000},"page":"475-485","source":"Crossref","is-referenced-by-count":8,"title":["SPEEDUP OF THE n-PROCESS MUTUAL EXCLUSION ALGORITHM"],"prefix":"10.1142","volume":"09","author":[{"given":"YOSHIHIDE","family":"IGARASHI","sequence":"first","affiliation":[{"name":"Department of Computer Science, Gunma University, Kiryu 376-8515, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YASUAKI","family":"NISHITANI","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Gunma University, Kiryu 376-8515, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1145\/990524.990527"},{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1145\/322290.322302"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1993.1065"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-08860-1_13"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1145\/365559.365617"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1145\/361082.361093"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1145\/7351.7352"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(81)90109-2"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90106-X"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S012962649900044X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:20:04Z","timestamp":1565108404000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S012962649900044X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,12]]},"references-count":9,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1999,12]]}},"alternative-id":["10.1142\/S012962649900044X"],"URL":"https:\/\/doi.org\/10.1142\/s012962649900044x","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,12]]}}}