{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T18:35:15Z","timestamp":1648924515235},"reference-count":2,"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":[[2006,12]]},"abstract":"<jats:p> The asynchronous group mutual exclusion (GME) problem [5] is a generalization of the (ordinary) mutual exclusion problem. Each process requests a forum. When a process is in the critical section (CS), we say its forum is held. The GME problem (i) allows at most one forum to be held at any time and, (ii) when a forum is held, encourages any number of processes requesting that forum to participate in that forum, that is, to be in the CS simultaneously. An extension of this problem, called the group mutual l-exclusion with multiple forum requests (GMLE-M) problem [8], allows each process to request multiple forums and up to l forums to be held simultaneously. In this paper, we give a simple GMLE-M algorithm that facilitates a highly concurrent participation of processes in forums. The algorithm uses a new technique, called automatic joining, that enables processes to enter the CS directly when their forums are being held. This technique can be used in other extensions of the GME problem also, to increase concurrency. <\/jats:p>","DOI":"10.1142\/s0129626406002782","type":"journal-article","created":{"date-parts":[[2006,12,20]],"date-time":"2006-12-20T11:24:00Z","timestamp":1166613840000},"page":"467-483","source":"Crossref","is-referenced-by-count":1,"title":["A HIGHLY CONCURRENT GROUP MUTUAL l-EXCLUSION ALGORITHM"],"prefix":"10.1142","volume":"16","author":[{"given":"K.","family":"VIDYASANKAR","sequence":"first","affiliation":[{"name":"Department of Computer Science, Memorial University, St. John's, Newfoundland, Canada, A1B 3X5, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90106-X"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00355-1"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626406002782","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T13:29:16Z","timestamp":1565184556000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626406002782"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12]]},"references-count":2,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2006,12]]}},"alternative-id":["10.1142\/S0129626406002782"],"URL":"https:\/\/doi.org\/10.1142\/s0129626406002782","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12]]}}}