乐胖代购免代理版

{"id":"https://openalex.org/W2090230269","doi":"https://doi.org/10.1016/0304-3975(87)90084-3","title":"The parallel complexity of deadlock detection","display_name":"The parallel complexity of deadlock detection","publication_year":1987,"publication_date":"1987-01-01","ids":{"openalex":"https://openalex.org/W2090230269","doi":"https://doi.org/10.1016/0304-3975(87)90084-3","mag":"2090230269"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1016/0304-3975(87)90084-3","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true},"type":"article","type_crossref":"journal-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/0304-3975(87)90084-3","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011756177","display_name":"Paul G. Spirakis","orcid":"https://orcid.org/0000-0001-5396-3749"},"institutions":[{"id":"https://openalex.org/I36672615","display_name":"Courant Institute of Mathematical Sciences","ror":"https://ror.org/037tm7f56","country_code":"US","type":"education","lineage":["https://openalex.org/I36672615","https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Paul Spirakis","raw_affiliation_strings":["Courant Institute of Mathematical Science, New York, NY"],"affiliations":[{"raw_affiliation_string":"Courant Institute of Mathematical Science, New York, NY","institution_ids":["https://openalex.org/I36672615"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5011756177"],"corresponding_institution_ids":["https://openalex.org/I36672615"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690,"provenance":"doaj"},"apc_paid":{"value":2690,"currency":"USD","value_usd":2690,"provenance":"doaj"},"fwci":0.512,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":1,"citation_normalized_percentile":{"value":0.504026,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":53,"max":61},"biblio":{"volume":"52","issue":"1-2","first_page":"155","last_page":"163"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9992,"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/T12288","display_name":"Optimization and Search Problems","score":0.9992,"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.9984,"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"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9975,"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/deadlock-prevention-algorithms","display_name":"Deadlock prevention algorithms","score":0.6941466}],"concepts":[{"id":"https://openalex.org/C113429609","wikidata":"https://www.wikidata.org/wiki/Q4060699","display_name":"Deadlock prevention algorithms","level":3,"score":0.6941466},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6436802},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.58695596},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.54484254},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.49582633},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42999798},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34466055},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32806593},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.25606227}],"mesh":[],"locations_count":1,"locations":[{"is_oa":true,"landing_page_url":"https://doi.org/10.1016/0304-3975(87)90084-3","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1016/0304-3975(87)90084-3","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":30,"referenced_works":["https://openalex.org/W1487184349","https://openalex.org/W1489807436","https://openalex.org/W1504118709","https://openalex.org/W1766349993","https://openalex.org/W1964430979","https://openalex.org/W1964718922","https://openalex.org/W1977119258","https://openalex.org/W1999647826","https://openalex.org/W2002089154","https://openalex.org/W2006346148","https://openalex.org/W2009998184","https://openalex.org/W2020810308","https://openalex.org/W2021675155","https://openalex.org/W2038890481","https://openalex.org/W2041329792","https://openalex.org/W2044660684","https://openalex.org/W2059378738","https://openalex.org/W2086623476","https://openalex.org/W2088956149","https://openalex.org/W2090133546","https://openalex.org/W2102685956","https://openalex.org/W2104508180","https://openalex.org/W2109612684","https://openalex.org/W2159939299","https://openalex.org/W2170523074","https://openalex.org/W2751601659","https://openalex.org/W2797041136","https://openalex.org/W4206658214","https://openalex.org/W4294549613","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W4383684213","https://openalex.org/W4226119751","https://openalex.org/W2360686363","https://openalex.org/W2166954426","https://openalex.org/W2136552483","https://openalex.org/W2050076411","https://openalex.org/W2045082154","https://openalex.org/W2001478969","https://openalex.org/W1900787600","https://openalex.org/W1542183432"],"abstract_inverted_index":{"When":[0],"serially":[1],"re-usable":[2],"multi-unit":[3],"resources":[4],"are":[5],"shared":[6],"among":[7],"many":[8,60],"processes,":[9],"each":[10],"of":[11,29,35,50,52,77,121,140],"which":[12],"has":[13],"exclusive":[14],"control":[15],"over":[16],"some":[17],"resource":[18],"units,":[19],"it":[20,127],"is":[21,85,100,116],"possible":[22],"for":[23,56,89,136],"deadlocks":[24],"to":[25],"happen.":[26],"The":[27],"work":[28],"Holt":[30],"(1971)":[31],"stated":[32],"the":[33,48,87,90,98,114,137,141],"problem":[34,99,115],"deadlock":[36,57,92,142],"detection":[37,93,143],"as":[38],"a":[39,74],"directed":[40],"multigraph":[41],"problem.":[42,94,144],"In":[43],"this":[44,84],"paper":[45],"we":[46,79],"examine":[47],"possibility":[49],"existence":[51],"fast":[53],"parallel":[54,65,68,134],"algorithms":[55,135],"detection.":[58],"Although":[59],"graph":[61],"problems":[62],"have":[63],"efficient":[64,133],"solutions":[66],"(in":[67],"polylogarithmic":[69],"time,":[70],"by":[71],"using":[72],"only":[73],"polynomial":[75],"number":[76],"processors),":[78],"present":[80,132],"strong":[81],"evidence":[82],"that":[83,97],"not":[86,109],"case":[88],"general":[91],"We":[95,131],"show":[96],"complete":[101],"in":[102,129],"Punder":[103],"log-space":[104],"reductions":[105],"and":[106],"thus":[107],"probably":[108],"efficiently":[110],"parallelizable.":[111],"Fortunately,":[112],"when":[113],"restricted":[117,138],"(e.g.,":[118],"single-unit":[119,124],"requests":[120],"processes":[122],"or":[123],"resources),":[125],"then":[126],"falls":[128],"NC.":[130],"versions":[139]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2090230269","counts_by_year":[],"updated_date":"2024-12-17T13:55:18.555165","created_date":"2016-06-24"}