{"id":"https://openalex.org/W2165081055","doi":"https://doi.org/10.1142/s012962649900044x","title":"SPEEDUP OF THE n-PROCESS MUTUAL EXCLUSION ALGORITHM","display_name":"SPEEDUP OF THE n-PROCESS MUTUAL EXCLUSION ALGORITHM","publication_year":1999,"publication_date":"1999-12-01","ids":{"openalex":"https://openalex.org/W2165081055","doi":"https://doi.org/10.1142/s012962649900044x","mag":"2165081055"},"language":"en","primary_location":{"id":"doi:10.1142/s012962649900044x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012962649900044x","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/A5112166865","display_name":"Yoshihide Igarashi","orcid":null},"institutions":[{"id":"https://openalex.org/I165735259","display_name":"Gunma University","ror":"https://ror.org/046fm7598","country_code":"JP","type":"education","lineage":["https://openalex.org/I165735259"]},{"id":"https://openalex.org/I258063972","display_name":"Kiryu University","ror":"https://ror.org/02snehe53","country_code":"JP","type":"education","lineage":["https://openalex.org/I258063972"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"YOSHIHIDE IGARASHI","raw_affiliation_strings":["Department of Computer Science, Gunma University, Kiryu 376-8515, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Gunma University, Kiryu 376-8515, Japan","institution_ids":["https://openalex.org/I165735259","https://openalex.org/I258063972"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113973373","display_name":"Yasuaki Nishitani","orcid":null},"institutions":[{"id":"https://openalex.org/I165735259","display_name":"Gunma University","ror":"https://ror.org/046fm7598","country_code":"JP","type":"education","lineage":["https://openalex.org/I165735259"]},{"id":"https://openalex.org/I258063972","display_name":"Kiryu University","ror":"https://ror.org/02snehe53","country_code":"JP","type":"education","lineage":["https://openalex.org/I258063972"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"YASUAKI NISHITANI","raw_affiliation_strings":["Department of Computer Science, Gunma University, Kiryu 376-8515, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Gunma University, Kiryu 376-8515, Japan","institution_ids":["https://openalex.org/I165735259","https://openalex.org/I258063972"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3252,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.86233221,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"09","issue":"04","first_page":"475","last_page":"485"},"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.9998000264167786,"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.9998000264167786,"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/T11478","display_name":"Caching and Content Delivery","score":0.9991999864578247,"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.9990000128746033,"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/speedup","display_name":"Speedup","score":0.8093845844268799},{"id":"https://openalex.org/keywords/mutual-exclusion","display_name":"Mutual exclusion","score":0.800439715385437},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.7374952435493469},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6905013918876648},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6561582088470459},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.6120237112045288},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.60307377576828},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5490352511405945},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.518990695476532},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4844972789287567},{"id":"https://openalex.org/keywords/suzuki-kasami-algorithm","display_name":"Suzuki-Kasami algorithm","score":0.4175950288772583},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.332882821559906},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2764436602592468},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24754074215888977},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.06348827481269836}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.8093845844268799},{"id":"https://openalex.org/C56348326","wikidata":"https://www.wikidata.org/wiki/Q1047554","display_name":"Mutual exclusion","level":2,"score":0.800439715385437},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.7374952435493469},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6905013918876648},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6561582088470459},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.6120237112045288},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.60307377576828},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5490352511405945},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.518990695476532},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4844972789287567},{"id":"https://openalex.org/C18664526","wikidata":"https://www.wikidata.org/wiki/Q7651187","display_name":"Suzuki-Kasami algorithm","level":3,"score":0.4175950288772583},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.332882821559906},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2764436602592468},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24754074215888977},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.06348827481269836},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s012962649900044x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012962649900044x","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":[{"score":0.8299999833106995,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1558385039","https://openalex.org/W1590859087","https://openalex.org/W1983421343","https://openalex.org/W1990090334","https://openalex.org/W2015956262","https://openalex.org/W2022907112","https://openalex.org/W2036267700","https://openalex.org/W2036522398","https://openalex.org/W2070908350","https://openalex.org/W2090612021","https://openalex.org/W2095244541","https://openalex.org/W2166071597","https://openalex.org/W2176413683","https://openalex.org/W2611515161","https://openalex.org/W3021769854","https://openalex.org/W4294549613"],"related_works":["https://openalex.org/W1884016487","https://openalex.org/W2003589681","https://openalex.org/W2525006791","https://openalex.org/W2159234309","https://openalex.org/W2095088029","https://openalex.org/W160293442","https://openalex.org/W1947458937","https://openalex.org/W2056266125","https://openalex.org/W2080520651","https://openalex.org/W2371865667"],"abstract_inverted_index":{"We":[0],"propose":[1],"two":[2,82],"modifications":[3,23],"of":[4,21,39,71,117],"the":[5,13,22,28,36,40,45,69,79,91,98,107,118,123],"n-process":[6,30,120],"mutual":[7],"exclusion":[8],"algorithm":[9,43,48,121],"by":[10],"Peterson":[11],"for":[12,35,122],"asynchronous":[14,125],"multi-writer/reader":[15],"shared":[16,126],"memory":[17,127],"model.":[18,128],"By":[19],"any":[20,94],"we":[24],"can":[25],"speed":[26],"up":[27],"original":[29,119],"algorithm.":[31],"The":[32],"running":[33,102,108],"times":[34,103],"trying":[37],"regions":[38],"first":[41],"modified":[42,47],"and":[44,57,84],"second":[46],"are":[49,104],"(2n":[50],"-":[51,59],"3)c":[52],"+":[53,61,113],"O(n":[54,62,110],"3":[55,63],"l)":[56,116],"(n":[58],"1)c":[60],"l),":[64],"respectively,":[65],"where":[66],"n":[67,114],"is":[68,74,86],"number":[70],"processes,":[72],"l":[73],"an":[75,87],"upper":[76,88],"bound":[77,89],"on":[78,90,106],"time":[80,92],"between":[81],"steps,":[83],"c":[85,112],"that":[93],"user":[95],"spends":[96],"in":[97],"critical":[99],"region.":[100],"These":[101],"improvements":[105],"time,":[109],"2":[111],"4":[115],"same":[124]},"counts_by_year":[],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}