{"id":"https://openalex.org/W2020165959","doi":"https://doi.org/10.1142/s0129626406002782","title":"A HIGHLY CONCURRENT GROUP MUTUAL l-EXCLUSION ALGORITHM","display_name":"A HIGHLY CONCURRENT GROUP MUTUAL l-EXCLUSION ALGORITHM","publication_year":2006,"publication_date":"2006-12-01","ids":{"openalex":"https://openalex.org/W2020165959","doi":"https://doi.org/10.1142/s0129626406002782","mag":"2020165959"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626406002782","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626406002782","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016628348","display_name":"K. Vidyasankar","orcid":null},"institutions":[{"id":"https://openalex.org/I130438778","display_name":"Memorial University of Newfoundland","ror":"https://ror.org/04haebc03","country_code":"CA","type":"education","lineage":["https://openalex.org/I130438778"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"K. VIDYASANKAR","raw_affiliation_strings":["Department of Computer Science, Memorial University, St. John's, Newfoundland, Canada, A1B 3X5, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Memorial University, St. John's, Newfoundland, Canada, A1B 3X5, Canada","institution_ids":["https://openalex.org/I130438778"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5016628348"],"corresponding_institution_ids":["https://openalex.org/I130438778"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.13876162,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"16","issue":"04","first_page":"467","last_page":"483"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","score":0.9293000102043152,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mutual-exclusion","display_name":"Mutual exclusion","score":0.9596830010414124},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.7625982761383057},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7247494459152222},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.7002648115158081},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5263166427612305},{"id":"https://openalex.org/keywords/critical-section","display_name":"Critical section","score":0.5089051723480225},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47575896978378296},{"id":"https://openalex.org/keywords/group","display_name":"Group (periodic table)","score":0.47027307748794556},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.46615609526634216},{"id":"https://openalex.org/keywords/suzuki-kasami-algorithm","display_name":"Suzuki-Kasami algorithm","score":0.43639615178108215},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.42739975452423096},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3306695818901062},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.23511764407157898},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19735002517700195},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.15161898732185364},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.13141143321990967}],"concepts":[{"id":"https://openalex.org/C56348326","wikidata":"https://www.wikidata.org/wiki/Q1047554","display_name":"Mutual exclusion","level":2,"score":0.9596830010414124},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.7625982761383057},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7247494459152222},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.7002648115158081},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5263166427612305},{"id":"https://openalex.org/C124343487","wikidata":"https://www.wikidata.org/wiki/Q1046373","display_name":"Critical section","level":2,"score":0.5089051723480225},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47575896978378296},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.47027307748794556},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.46615609526634216},{"id":"https://openalex.org/C18664526","wikidata":"https://www.wikidata.org/wiki/Q7651187","display_name":"Suzuki-Kasami algorithm","level":3,"score":0.43639615178108215},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.42739975452423096},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3306695818901062},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.23511764407157898},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19735002517700195},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.15161898732185364},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.13141143321990967},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129626406002782","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626406002782","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.800000011920929}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W2036267700","https://openalex.org/W2056266125"],"related_works":["https://openalex.org/W2056266125","https://openalex.org/W1947458937","https://openalex.org/W134702770","https://openalex.org/W2916670647","https://openalex.org/W2095088029","https://openalex.org/W2151474620","https://openalex.org/W160293442","https://openalex.org/W2116578239","https://openalex.org/W126751236","https://openalex.org/W2525006791"],"abstract_inverted_index":{"The":[0,37,132],"asynchronous":[1],"group":[2,87],"mutual":[3,14,88],"exclusion":[4,15],"(GME)":[5],"problem":[6,39,95,166],"[5]":[7],"is":[8,25,35,57],"a":[9,20,23,55,118,124,135],"generalization":[10],"of":[11,62,82,128,163],"the":[12,27,77,86,146,164],"(ordinary)":[13],"problem.":[16],"Each":[17],"process":[18,24,99],"requests":[19,93],"forum.":[21],"When":[22],"in":[26,69,76,130,160],"critical":[28],"section":[29],"(CS),":[30],"we":[31,116],"say":[32],"its":[33],"forum":[34,45,56,66,92],"held.":[36,154],"GME":[38,165],"(i)":[40],"allows":[41,97],"at":[42,49],"most":[43],"one":[44],"to":[46,67,74,100,106,109,144,168],"be":[47,75,110,158],"held":[48,111],"any":[50,60],"time":[51],"and,":[52],"(ii)":[53],"when":[54,149],"held,":[58],"encourages":[59],"number":[61],"processes":[63,129,143],"requesting":[64],"that":[65,70,72,122,141],"participate":[68],"forum,":[71],"is,":[73],"CS":[78,147],"simultaneously.":[79,112],"An":[80],"extension":[81],"this":[83,114],"problem,":[84],"called":[85,138],"l-exclusion":[89],"with":[90],"multiple":[91,102],"(GMLE-M)":[94],"[8],":[96],"each":[98],"request":[101],"forums":[103,108,151],"and":[104],"up":[105],"l":[107],"In":[113],"paper,":[115],"give":[117],"simple":[119],"GMLE-M":[120],"algorithm":[121,133],"facilitates":[123],"highly":[125],"concurrent":[126],"participation":[127],"forums.":[131],"uses":[134],"new":[136],"technique,":[137],"automatic":[139],"joining,":[140],"enables":[142],"enter":[145],"directly":[148],"their":[150],"are":[152],"being":[153],"This":[155],"technique":[156],"can":[157],"used":[159],"other":[161],"extensions":[162],"also,":[167],"increase":[169],"concurrency.":[170]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}