{"id":"https://openalex.org/W4241902928","doi":"https://doi.org/10.1109/ipdps.2006.1639370","title":"On efficient distributed deadlock avoidance for real-time and embedded systems","display_name":"On efficient distributed deadlock avoidance for real-time and embedded systems","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W4241902928","doi":"https://doi.org/10.1109/ipdps.2006.1639370"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2006.1639370","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2006.1639370","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 20th IEEE International Parallel & Distributed Processing Symposium","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/A5015623381","display_name":"C\u00e9sar S\u00e1nchez","orcid":"https://orcid.org/0000-0003-3927-4773"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"C. Sanchez","raw_affiliation_strings":["Computer Science Dept, Stanford University, Stanford, CA, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Dept, Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058348937","display_name":"Henny B. Sipma","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"H.B. Sipma","raw_affiliation_strings":["Computer Science Dept, Stanford University, Stanford, CA, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Dept, Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034436241","display_name":"Zohar Manna","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Z. Manna","raw_affiliation_strings":["Computer Science Dept, Stanford University, Stanford, CA, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Dept, Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108612200","display_name":"V. Subramonian","orcid":null},"institutions":[{"id":"https://openalex.org/I204465549","display_name":"Washington University in St. Louis","ror":"https://ror.org/01yc7t268","country_code":"US","type":"education","lineage":["https://openalex.org/I204465549"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"V. Subramonian","raw_affiliation_strings":["Dept. of Computer Science and Engineering St. Louis, Washington University, Saint Louis, MO, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Engineering St. Louis, Washington University, Saint Louis, MO, USA","institution_ids":["https://openalex.org/I204465549"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076029698","display_name":"Christopher Gill","orcid":"https://orcid.org/0000-0003-0366-8586"},"institutions":[{"id":"https://openalex.org/I204465549","display_name":"Washington University in St. Louis","ror":"https://ror.org/01yc7t268","country_code":"US","type":"education","lineage":["https://openalex.org/I204465549"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C. Gill","raw_affiliation_strings":["Dept. of Computer Science and Engineering St. Louis, Washington University, Saint Louis, MO, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Engineering St. Louis, Washington University, Saint Louis, MO, USA","institution_ids":["https://openalex.org/I204465549"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5015623381"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":1.34250102,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.81750279,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"41","issue":null,"first_page":"10 pp.","last_page":"10 pp."},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9998000264167786,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9998000264167786,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9995999932289124,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.8459138870239258},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.7433461546897888},{"id":"https://openalex.org/keywords/deadlock-prevention-algorithms","display_name":"Deadlock prevention algorithms","score":0.7343817353248596},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6773946285247803},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.6173792481422424},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5494208335876465},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5480620265007019},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.4388803243637085},{"id":"https://openalex.org/keywords/wait-for-graph","display_name":"Wait-for graph","score":0.42105820775032043},{"id":"https://openalex.org/keywords/concurrency-control","display_name":"Concurrency control","score":0.41887009143829346},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39603191614151},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3942148685455322},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19132867455482483},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1271844506263733},{"id":"https://openalex.org/keywords/graph-database","display_name":"Graph database","score":0.0740860104560852}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8459138870239258},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.7433461546897888},{"id":"https://openalex.org/C113429609","wikidata":"https://www.wikidata.org/wiki/Q4060699","display_name":"Deadlock prevention algorithms","level":3,"score":0.7343817353248596},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6773946285247803},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.6173792481422424},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5494208335876465},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5480620265007019},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.4388803243637085},{"id":"https://openalex.org/C106891557","wikidata":"https://www.wikidata.org/wiki/Q4148051","display_name":"Wait-for graph","level":4,"score":0.42105820775032043},{"id":"https://openalex.org/C84511453","wikidata":"https://www.wikidata.org/wiki/Q2914952","display_name":"Concurrency control","level":3,"score":0.41887009143829346},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39603191614151},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3942148685455322},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19132867455482483},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1271844506263733},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.0740860104560852},{"id":"https://openalex.org/C75949130","wikidata":"https://www.wikidata.org/wiki/Q848010","display_name":"Database transaction","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ipdps.2006.1639370","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2006.1639370","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 20th IEEE International Parallel & Distributed Processing Symposium","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1498456863","https://openalex.org/W1533287682","https://openalex.org/W1592740644","https://openalex.org/W1964718922","https://openalex.org/W2059881462","https://openalex.org/W2061368918","https://openalex.org/W2104508180","https://openalex.org/W2116873772","https://openalex.org/W2141563078","https://openalex.org/W2150974097","https://openalex.org/W2155372793","https://openalex.org/W2164687688","https://openalex.org/W2170809192","https://openalex.org/W3152703111"],"related_works":["https://openalex.org/W2386884462","https://openalex.org/W2560925019","https://openalex.org/W3140720071","https://openalex.org/W2358822739","https://openalex.org/W1596298878","https://openalex.org/W2038880851","https://openalex.org/W2088433124","https://openalex.org/W2008483896","https://openalex.org/W2340131066","https://openalex.org/W4231261802"],"abstract_inverted_index":{"Thread":[0],"allocation":[1,15,69],"is":[2,18,28,127,146,160,176,179],"an":[3,85,120,200],"important":[4],"problem":[5],"in":[6,50,82,108,147,162,182,199],"distributed":[7,51],"real-time":[8],"and":[9,150,169],"embedded":[10],"(DRE)":[11],"systems.":[12],"A":[13],"thread":[14,41,68],"policy":[16,26],"that":[17,27,65,103,126,129,141],"too":[19,29,55],"liberal":[20],"may":[21,193],"cause":[22],"deadlock,":[23,45],"while":[24,43,132],"a":[25,152,157,170],"conservative":[30],"limits":[31],"potential":[32],"parallelism,":[33],"thus":[34],"wasting":[35],"resources.":[36],"However,":[37],"achieving":[38],"(globally)":[39],"optimal":[40,124],"utilization,":[42],"avoiding":[44],"has":[46],"been":[47],"proven":[48],"impractical":[49],"systems:":[52],"it":[53],"requires":[54],"much":[56],"communication":[57],"between":[58],"components.":[59],"In":[60,115],"previous":[61],"work":[62],"we":[63,118,139],"showed":[64],"efficient":[66],"local":[67],"protocols":[70,75],"are":[71,76],"possible":[72],"if":[73,156],"the":[74,88,99,134,142,163,166,183,189,195],"parameterized":[77],"by":[78,84,98],"global":[79,89],"static":[80],"data,":[81],"particular":[83],"annotation":[86,110,164],"of":[87,92,105,113,136,144,165,174,185,191,197],"call":[90,167],"graph":[91,168],"all":[93],"tasks":[94],"to":[95,122],"be":[96],"performed":[97],"system.":[100,204],"We":[101],"proved":[102],"absence":[104,112],"cyclic":[106,158,186],"dependencies":[107],"this":[109,116],"guarantees":[111],"deadlock.":[114],"paper":[117],"present":[119,161],"algorithm":[121],"compute":[123],"annotations,":[125],"annotations":[128],"maximize":[130],"parallelism":[131],"satisfying":[133],"condition":[135,143],"acyclicity.":[137],"Moreover,":[138],"show":[140],"acyclicity":[145],"fact":[148],"tight":[149],"exhibits":[151],"rather":[153],"surprising":[154],"anomaly:":[155],"dependency":[159],"certain":[171],"minimum":[172],"number":[173,190],"threads":[175,192],"provided,":[177],"deadlock":[178,198,202],"reachable.":[180],"Thus,":[181],"presence":[184],"dependencies,":[187],"increasing":[188],"introduce":[194],"possibility":[196],"originally":[201],"free":[203]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}