{"id":"https://openalex.org/W3125334465","doi":"https://doi.org/10.1145/3324884.3416588","title":"A predictive analysis for detecting deadlock in MPI programs","display_name":"A predictive analysis for detecting deadlock in MPI programs","publication_year":2020,"publication_date":"2020-12-21","ids":{"openalex":"https://openalex.org/W3125334465","doi":"https://doi.org/10.1145/3324884.3416588","mag":"3125334465"},"language":"en","primary_location":{"id":"doi:10.1145/3324884.3416588","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3324884.3416588","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th IEEE/ACM International Conference on Automated Software Engineering","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/A5025978852","display_name":"Yu Huang","orcid":"https://orcid.org/0000-0001-5602-1378"},"institutions":[{"id":"https://openalex.org/I204831749","display_name":"Southwestern University of Finance and Economics","ror":"https://ror.org/04ewct822","country_code":"CN","type":"education","lineage":["https://openalex.org/I204831749"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yu Huang","raw_affiliation_strings":["Southwestern University of Finance and Economics"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Southwestern University of Finance and Economics","institution_ids":["https://openalex.org/I204831749"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045281710","display_name":"Benjamin M. Ogles","orcid":"https://orcid.org/0000-0003-4955-332X"},"institutions":[{"id":"https://openalex.org/I100005738","display_name":"Brigham Young University","ror":"https://ror.org/047rhhm47","country_code":"US","type":"education","lineage":["https://openalex.org/I100005738"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Benjamin Ogles","raw_affiliation_strings":["Brigham Young University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Brigham Young University","institution_ids":["https://openalex.org/I100005738"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005072374","display_name":"Eric Mercer","orcid":"https://orcid.org/0000-0002-2264-2958"},"institutions":[{"id":"https://openalex.org/I100005738","display_name":"Brigham Young University","ror":"https://ror.org/047rhhm47","country_code":"US","type":"education","lineage":["https://openalex.org/I100005738"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eric Mercer","raw_affiliation_strings":["Brigham Young University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Brigham Young University","institution_ids":["https://openalex.org/I100005738"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4549,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.62822974,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"18","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.8613146543502808},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.8135112524032593},{"id":"https://openalex.org/keywords/deadlock-prevention-algorithms","display_name":"Deadlock prevention algorithms","score":0.7644487023353577},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.7033785581588745},{"id":"https://openalex.org/keywords/dependency-graph","display_name":"Dependency graph","score":0.6654623746871948},{"id":"https://openalex.org/keywords/dependency","display_name":"Dependency (UML)","score":0.5807953476905823},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5673767328262329},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5340598821640015},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5231251120567322},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5189954042434692},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47866806387901306},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.4695967435836792},{"id":"https://openalex.org/keywords/wait-for-graph","display_name":"Wait-for graph","score":0.454962819814682},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.45252859592437744},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4004725217819214},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39718785881996155},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.29791557788848877},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10160109400749207},{"id":"https://openalex.org/keywords/graph-rewriting","display_name":"Graph rewriting","score":0.0880858302116394},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.0760028064250946}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8613146543502808},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.8135112524032593},{"id":"https://openalex.org/C113429609","wikidata":"https://www.wikidata.org/wiki/Q4060699","display_name":"Deadlock prevention algorithms","level":3,"score":0.7644487023353577},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7033785581588745},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.6654623746871948},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.5807953476905823},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5673767328262329},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5340598821640015},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5231251120567322},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5189954042434692},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47866806387901306},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.4695967435836792},{"id":"https://openalex.org/C106891557","wikidata":"https://www.wikidata.org/wiki/Q4148051","display_name":"Wait-for graph","level":4,"score":0.454962819814682},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.45252859592437744},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4004725217819214},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39718785881996155},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.29791557788848877},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10160109400749207},{"id":"https://openalex.org/C558772884","wikidata":"https://www.wikidata.org/wiki/Q1508564","display_name":"Graph rewriting","level":3,"score":0.0880858302116394},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0760028064250946}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3324884.3416588","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3324884.3416588","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th IEEE/ACM International Conference on Automated Software Engineering","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.5}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W186123808","https://openalex.org/W818779475","https://openalex.org/W1480909796","https://openalex.org/W1559665648","https://openalex.org/W1565978235","https://openalex.org/W1761923495","https://openalex.org/W1872471105","https://openalex.org/W1978562726","https://openalex.org/W1980044088","https://openalex.org/W1990128020","https://openalex.org/W2023489866","https://openalex.org/W2063362342","https://openalex.org/W2083342911","https://openalex.org/W2103772961","https://openalex.org/W2112121929","https://openalex.org/W2115309705","https://openalex.org/W2119494620","https://openalex.org/W2132613390","https://openalex.org/W2153675200","https://openalex.org/W2161957670","https://openalex.org/W2169870841","https://openalex.org/W2245258423","https://openalex.org/W2273799252","https://openalex.org/W2556273741","https://openalex.org/W2749582297","https://openalex.org/W2898242299","https://openalex.org/W2988063199","https://openalex.org/W4232707757","https://openalex.org/W4242852064","https://openalex.org/W4253460352","https://openalex.org/W6698255013"],"related_works":["https://openalex.org/W2386884462","https://openalex.org/W2560925019","https://openalex.org/W3140720071","https://openalex.org/W1596298878","https://openalex.org/W2038880851","https://openalex.org/W2088433124","https://openalex.org/W2008483896","https://openalex.org/W2120098047","https://openalex.org/W2035968706","https://openalex.org/W4383684213"],"abstract_inverted_index":{"A":[0],"common":[1],"problem":[2],"in":[3,72,129],"MPI":[4,40,145],"programs":[5,41,146],"is":[6,25,139],"deadlock:":[7],"when":[8],"two":[9],"or":[10],"more":[11],"processes":[12],"are":[13,86],"blocked":[14],"indefinitely":[15],"due":[16,27],"to":[17,28,61,76,133],"a":[18,35,44,62,73,78,111,148],"circular":[19],"communication":[20,70],"dependency.":[21],"Automatically":[22],"detecting":[23],"deadlock":[24,81,84,116],"difficult":[26],"its":[29],"schedule-dependent":[30],"nature.":[31],"This":[32,107],"paper":[33],"presents":[34],"predictive":[36],"analysis":[37,65,138],"for":[38,95,105,119,143],"single-path":[39,144],"that":[42],"observes":[43],"single":[45],"program":[46,58],"execution":[47],"and":[48,92,124,141],"then":[49],"determines":[50],"whether":[51],"any":[52],"other":[53,134],"feasible":[54],"schedule":[55],"of":[56,80,113],"the":[57],"can":[59],"lead":[60],"deadlock.":[63,106],"The":[64,83,137],"works":[66],"by":[67,88,97],"identifying":[68],"problematic":[69],"patterns":[71],"dependency":[74],"graph":[75],"form":[77],"set":[79,112],"candidates.":[82],"candidates":[85,117],"filtered":[87],"an":[89,98,102],"abstract":[90],"machine":[91],"ultimately":[93],"tested":[94],"reachability":[96],"SMT":[99],"solver":[100],"with":[101],"efficient":[103],"encoding":[104],"approach":[108],"quickly":[109],"yields":[110,125],"high":[114],"probability":[115],"useful":[118],"reasoning":[120],"about":[121],"complex":[122],"codes":[123],"higher":[126],"performance":[127],"overall":[128],"many":[130],"cases":[131],"compared":[132],"state-of-the-art":[135],"analyses.":[136],"sound":[140],"complete":[142],"on":[147],"given":[149],"input.":[150]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}