{"id":"W2136168913","doi":"10.1109/cmpsac.1978.810401","title":"An effective \"on-line\" deadlock detection technique for distributed data base management systems","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Deadlock prevention algorithms; Deadlock; Computer science; Distributed computing; Concurrency control; Wait-for graph; Resource allocation; Graph; Process (computing); Theoretical computer science; Computer network; Database; Graph rewriting; Programming language","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005223685,0.0001711387,0.0001707759,0.00009006767,0.0001833903,0.00008750411,0.0007152899,0.00005142629,0.000001647575],"category_scores_gemma":[0.00002889747,0.0001385389,0.00003022947,0.0002349618,0.00001868744,0.001304856,0.0002965488,0.00007203612,0.0000189351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001147452,"about_ca_system_score_gemma":0.00000975067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006371614,"about_ca_topic_score_gemma":0.00007968477,"domain_scores_codex":[0.9985672,0.00007958073,0.0002447076,0.0006701873,0.0001822569,0.000256069],"domain_scores_gemma":[0.9977732,0.0001018113,0.00009127853,0.001859736,0.00007824723,0.00009570138],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001205473,0.0003985239,0.00001919285,0.000363303,0.00009814377,0.00002403267,0.00005836469,0.0241218,0.009456462,0.5557741,0.003380172,0.4061854],"study_design_scores_gemma":[0.0006216854,0.0005319116,0.00006701786,0.00009007609,0.00001476217,0.00003014931,0.0001154752,0.7874662,0.05869596,0.0001887158,0.1518305,0.0003475846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002089843,0.00003574423,0.9959451,0.0000915073,0.0002818237,0.002244204,0.0005190982,0.0003952704,0.000278262],"genre_scores_gemma":[0.6065294,0.000006490558,0.3910275,0.0001075776,0.0002624753,0.00138718,0.0004919811,0.0000171978,0.0001702143],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7633443,"threshold_uncertainty_score":0.5649451,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02830126109074597,"score_gpt":0.3023681533039255,"score_spread":0.2740668922131795,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}