{"id":"https://openalex.org/W2104085721","doi":"https://doi.org/10.1109/tridnt.2006.1649198","title":"A reliable optimization on distributed mutual exclusion algorithm","display_name":"A reliable optimization on distributed mutual exclusion algorithm","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2104085721","doi":"https://doi.org/10.1109/tridnt.2006.1649198","mag":"2104085721"},"language":"en","primary_location":{"id":"doi:10.1109/tridnt.2006.1649198","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tridnt.2006.1649198","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2nd International Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities, 2006. TRIDENTCOM 2006.","raw_type":"proceedings-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/A5006565100","display_name":"Moharram Challenger","orcid":"https://orcid.org/0000-0002-5436-6070"},"institutions":[{"id":"https://openalex.org/I4210130889","display_name":"Islamic Azad University Shabestar","ror":"https://ror.org/03b49d241","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433","https://openalex.org/I4210130889"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"M. Challenger","raw_affiliation_strings":["Department of computer Engineering, IAU of Shabestar-Iran, Iran"],"affiliations":[{"raw_affiliation_string":"Department of computer Engineering, IAU of Shabestar-Iran, Iran","institution_ids":["https://openalex.org/I4210130889"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066314516","display_name":"Peyman Bayat","orcid":"https://orcid.org/0000-0003-2291-1369"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"P. Bayat","raw_affiliation_strings":["Department of computer Engineering, IAU of Tafresh-Iran"],"affiliations":[{"raw_affiliation_string":"Department of computer Engineering, IAU of Tafresh-Iran","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008824437","display_name":"Mohammad Reza Meybodi","orcid":"https://orcid.org/0000-0003-3775-5565"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M.R. Meybodi","raw_affiliation_strings":["Department of computer science, AUT-Iran, Iran"],"affiliations":[{"raw_affiliation_string":"Department of computer science, AUT-Iran, Iran","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5006565100"],"corresponding_institution_ids":["https://openalex.org/I4210130889"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.1785837,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"8 pp.","last_page":"566"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":1.0,"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":1.0,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9970999956130981,"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.9914000034332275,"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.8950760364532471},{"id":"https://openalex.org/keywords/critical-section","display_name":"Critical section","score":0.8928052186965942},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.816085696220398},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.7077959775924683},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.6473226547241211},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.6300027370452881},{"id":"https://openalex.org/keywords/suzuki-kasami-algorithm","display_name":"Suzuki-Kasami algorithm","score":0.628266453742981},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6236432790756226},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5939902067184448},{"id":"https://openalex.org/keywords/crash","display_name":"Crash","score":0.5921517014503479},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5022683143615723},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4401475191116333},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.348679780960083},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3270009756088257},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2865678071975708},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.07753345370292664}],"concepts":[{"id":"https://openalex.org/C56348326","wikidata":"https://www.wikidata.org/wiki/Q1047554","display_name":"Mutual exclusion","level":2,"score":0.8950760364532471},{"id":"https://openalex.org/C124343487","wikidata":"https://www.wikidata.org/wiki/Q1046373","display_name":"Critical section","level":2,"score":0.8928052186965942},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.816085696220398},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.7077959775924683},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.6473226547241211},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.6300027370452881},{"id":"https://openalex.org/C18664526","wikidata":"https://www.wikidata.org/wiki/Q7651187","display_name":"Suzuki-Kasami algorithm","level":3,"score":0.628266453742981},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6236432790756226},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5939902067184448},{"id":"https://openalex.org/C183469790","wikidata":"https://www.wikidata.org/wiki/Q333501","display_name":"Crash","level":2,"score":0.5921517014503479},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5022683143615723},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4401475191116333},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.348679780960083},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3270009756088257},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2865678071975708},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.07753345370292664}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tridnt.2006.1649198","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tridnt.2006.1649198","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2nd International Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities, 2006. TRIDENTCOM 2006.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.421.3054","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.421.3054","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ceit.aut.ac.ir/~meybodi/paper/Chalagar-82.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.8199999928474426,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1492426515","https://openalex.org/W1508143344","https://openalex.org/W1511969828","https://openalex.org/W1972105154","https://openalex.org/W1973747673","https://openalex.org/W1979885075","https://openalex.org/W1980152580","https://openalex.org/W2014806070","https://openalex.org/W2039179345","https://openalex.org/W2042913560","https://openalex.org/W2100198355","https://openalex.org/W2102243575","https://openalex.org/W2127663058","https://openalex.org/W2132780832","https://openalex.org/W2136255388","https://openalex.org/W2140187958","https://openalex.org/W2140606557","https://openalex.org/W2144884804","https://openalex.org/W2162248954","https://openalex.org/W2169115714","https://openalex.org/W2491873545","https://openalex.org/W3137220996"],"related_works":["https://openalex.org/W2151474620","https://openalex.org/W2916670647","https://openalex.org/W134702770","https://openalex.org/W2525006791","https://openalex.org/W2116578239","https://openalex.org/W2891811345","https://openalex.org/W2798294881","https://openalex.org/W2096055178","https://openalex.org/W2950943763","https://openalex.org/W2104085721"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,75],"reliable":[4],"decentralized":[5],"mutual":[6],"exclusion":[7],"algorithm":[8,27,83],"for":[9],"distributed":[10,30],"systems":[11],"in":[12,24,44,64,80],"which":[13,95],"processes":[14,63],"communicate":[15],"by":[16],"asynchronous":[17],"message":[18,69],"passing.":[19],"When":[20],"any":[21,33,87],"failure":[22],"happens":[23],"system,":[25],"the":[26,29,39,60,65],"protects":[28],"system":[31],"against":[32],"crash.":[34],"It":[35,46],"also":[36],"makes":[37],"possible":[38],"recovery":[40],"of":[41,62,78],"lost":[42],"data":[43],"system.":[45,66],"requires":[47],"between":[48],"(N-1)":[49],"and":[50,92,98],"2(N-1)":[51,99],"messages":[52,100],"per":[53,101],"critical":[54,102],"section":[55,103],"access,":[56,104],"where":[57],"N":[58],"is":[59],"number":[61],"The":[67,82],"exact":[68],"complexity":[70],"can":[71],"be":[72],"expressed":[73],"as":[74],"order":[76],"function":[77],"clients":[79],"computation.":[81],"does":[84],"not":[85],"introduce":[86],"other":[88],"overhead":[89],"over":[90],"Lamport's":[91],"Ricart-Agrawala's":[93],"algorithms,":[94],"require":[96],"3(N-1)":[97],"respectively.":[105]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}