{"id":"https://openalex.org/W4284899742","doi":"https://doi.org/10.1145/3543543","title":"Multi-Interval DomLock: Toward Improving Concurrency in Hierarchies","display_name":"Multi-Interval DomLock: Toward Improving Concurrency in Hierarchies","publication_year":2022,"publication_date":"2022-07-08","ids":{"openalex":"https://openalex.org/W4284899742","doi":"https://doi.org/10.1145/3543543"},"language":"en","primary_location":{"id":"doi:10.1145/3543543","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3543543","pdf_url":null,"source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","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/A5045045445","display_name":"M. A. Anju","orcid":null},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"facility","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"M. A. Anju","raw_affiliation_strings":["IIT Madras, Chennai, India"],"raw_orcid":"https://orcid.org/0000-0002-5116-1109","affiliations":[{"raw_affiliation_string":"IIT Madras, Chennai, India","institution_ids":["https://openalex.org/I24676775"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018046405","display_name":"Rupesh Nasre","orcid":"https://orcid.org/0000-0001-7490-625X"},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"facility","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Rupesh Nasre","raw_affiliation_strings":["IIT Madras, Chennai, India"],"raw_orcid":"https://orcid.org/0000-0001-7490-625X","affiliations":[{"raw_affiliation_string":"IIT Madras, Chennai, India","institution_ids":["https://openalex.org/I24676775"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5045045445"],"corresponding_institution_ids":["https://openalex.org/I24676775"],"apc_list":null,"apc_paid":null,"fwci":0.4273,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.6279658,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"9","issue":"3","first_page":"1","last_page":"27"},"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T12127","display_name":"Software System Performance and Reliability","score":0.9961000084877014,"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/computer-science","display_name":"Computer science","score":0.8265066146850586},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.6593445539474487},{"id":"https://openalex.org/keywords/lock","display_name":"Lock (firearm)","score":0.6495469212532043},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.5058891177177429},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.49384433031082153},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4793623089790344},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.47846174240112305},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4760284721851349},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.47578561305999756},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.44891342520713806},{"id":"https://openalex.org/keywords/concurrency-control","display_name":"Concurrency control","score":0.433064341545105},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33678165078163147},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2243945300579071},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16687819361686707},{"id":"https://openalex.org/keywords/database-transaction","display_name":"Database transaction","score":0.1514398157596588},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.14869755506515503}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8265066146850586},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.6593445539474487},{"id":"https://openalex.org/C174839445","wikidata":"https://www.wikidata.org/wiki/Q1134386","display_name":"Lock (firearm)","level":2,"score":0.6495469212532043},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.5058891177177429},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.49384433031082153},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4793623089790344},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.47846174240112305},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4760284721851349},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.47578561305999756},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.44891342520713806},{"id":"https://openalex.org/C84511453","wikidata":"https://www.wikidata.org/wiki/Q2914952","display_name":"Concurrency control","level":3,"score":0.433064341545105},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33678165078163147},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2243945300579071},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16687819361686707},{"id":"https://openalex.org/C75949130","wikidata":"https://www.wikidata.org/wiki/Q848010","display_name":"Database transaction","level":2,"score":0.1514398157596588},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14869755506515503},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3543543","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3543543","pdf_url":null,"source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1493875369","https://openalex.org/W1916593361","https://openalex.org/W1969249776","https://openalex.org/W1970827137","https://openalex.org/W1991199257","https://openalex.org/W2038234040","https://openalex.org/W2040195490","https://openalex.org/W2103933790","https://openalex.org/W2138567239","https://openalex.org/W2148998558","https://openalex.org/W2160017790","https://openalex.org/W2547318546","https://openalex.org/W2754186652","https://openalex.org/W2795101690","https://openalex.org/W2886614606","https://openalex.org/W2887272665","https://openalex.org/W2914999481","https://openalex.org/W2936158678","https://openalex.org/W2968278263","https://openalex.org/W2974069814","https://openalex.org/W3043816384","https://openalex.org/W3047937553","https://openalex.org/W3086717878","https://openalex.org/W3138153268","https://openalex.org/W4212941901","https://openalex.org/W4241463104","https://openalex.org/W4249631976"],"related_works":["https://openalex.org/W170547082","https://openalex.org/W2136735429","https://openalex.org/W2587876411","https://openalex.org/W2358332176","https://openalex.org/W4301044568","https://openalex.org/W2128075414","https://openalex.org/W1576194075","https://openalex.org/W2521020842","https://openalex.org/W2170147831","https://openalex.org/W4242696047"],"abstract_inverted_index":{"Locking":[0],"has":[1,19],"been":[2,20],"a":[3,61,138],"predominant":[4],"technique":[5,50,140],"depended":[6],"upon":[7,96],"for":[8,64,88,155],"achieving":[9],"thread":[10],"synchronization":[11],"and":[12,82,84,100,221,236],"ensuring":[13],"correctness":[14],"in":[15,52,112,125,160],"multi-threaded":[16],"applications.":[17],"It":[18,238],"established":[21],"that":[22,94,198,264],"the":[23,79,97,101,119,143,162,174,182,208,245,252],"concurrent":[24],"applications":[25],"working":[26],"with":[27,199,241,259],"hierarchical":[28,53,65,149,246],"data":[29],"witness":[30],"significant":[31,268],"benefits":[32],"due":[33,166,211],"to":[34,40,77,108,141,167,177,185,191,212,225,267,272],"multi-granularity":[35],"locking":[36,72,80],"(MGL)":[37],"techniques":[38],"compared":[39],"either":[41],"fine-":[42],"or":[43],"coarse-grained":[44],"locking.":[45,66,150],"The":[46],"de":[47],"facto":[48],"MGL":[49,69],"used":[51],"databases":[54],"is":[55,219],"intention":[56,86],"locks":[57,87,123],",":[58,235],"which":[59],"uses":[60],"traversal-based":[62],"protocol":[63],"A":[67],"recent":[68],"implementation,":[70],"dominator-based":[71],"(DomLock),":[73],"exploits":[74],"interval":[75,102],"numbering":[76],"balance":[78],"cost":[81],"concurrency":[83,146,180],"outperforms":[85],"non-tree-structured":[89],"hierarchies.":[90],"We":[91,195,250],"observe,":[92],"however,":[93],"depending":[95],"hierarchy":[98,228],"structure":[99,247],"numbering,":[103],"DomLock":[104,136],"pessimistically":[105],"declares":[106],"subhierarchies":[107],"be":[109,223],"locked":[110],"when":[111],"reality":[113],"they":[114],"are":[115],"not.":[116],"This":[117],"increases":[118],"waiting":[120],"time":[121],"of":[122,145,147,171,202,216,229,254],"and,":[124,258],"turn,":[126],"reduces":[127],"concurrency.":[128],"To":[129],"address":[130],"this":[131],"issue,":[132],"we":[133],"present":[134],"Multi-Interval":[135],"(MID),":[137],"new":[139],"improve":[142],"degree":[144],"interval-based":[148],"By":[151],"adding":[152],"additional":[153],"intervals":[154],"each":[156],"node,":[157],"MID":[158,204,218,255],"helps":[159],"reducing":[161],"unnecessary":[163],"lock":[164,169,209,214],"rejections":[165,210],"false-positive":[168,213],"status":[170,215],"sub-hierarchies.":[172],"Unleashing":[173],"hidden":[175],"opportunities":[176],"exploit":[178],"more":[179],"allows":[181],"parallel":[183],"threads":[184],"finish":[186],"their":[187],"operations":[188],"quickly,":[189],"leading":[190],"notable":[192],"performance":[193],"improvement.":[194],"also":[196,239],"show":[197,263],"sufficient":[200],"number":[201],"intervals,":[203],"can":[205,222],"avoid":[206],"all":[207],"nodes.":[217],"general":[220],"applied":[224],"any":[226],"arbitrary":[227],"trees,":[230],"Directed":[231],"Acyclic":[232],"Graphs":[233],"(DAGs)":[234],"cycles.":[237],"works":[240],"dynamic":[242],"hierarchies":[243],"wherein":[244],"undergoes":[248],"updates.":[249],"illustrate":[251],"effectiveness":[253],"using":[256],"STMBench7":[257],"extensive":[260],"experimental":[261],"evaluation,":[262],"it":[265],"leads":[266],"throughput":[269],"improvement":[270],"(up":[271],"141%,":[273],"average":[274],"106%)":[275],"over":[276],"DomLock.":[277]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}