{"id":"W3099119422","doi":"10.1109/tcad.2020.3037310","title":"A Deflection-Based Deadlock Recovery Framework to Achieve High Throughput for Faulty NoCs","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; Natural Science Foundation of Guangdong Province; Nova; Ministry of Science and Technology of the People's Republic of China; Chinese Academy of Sciences; National Natural Science Foundation of China","keywords":"Deadlock prevention algorithms; Deadlock; Computer science; Throughput; Distributed computing; Computer network; Network packet; Latency (audio); Concurrency control; Wireless; Database transaction","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008400993,0.0006189027,0.0004725715,0.0006628894,0.0007601826,0.0006164091,0.001537712,0.0005662282,0.00201532],"category_scores_gemma":[0.001200204,0.000228089,0.0004626728,0.0003813714,0.000656152,0.0009307815,0.001380895,0.0008922793,0.0003559223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008590275,"about_ca_system_score_gemma":0.001604125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002156812,"about_ca_topic_score_gemma":0.003128842,"domain_scores_codex":[0.9995679,0.00007062262,0.00002972029,0.00007692113,0.0001584565,0.00009633086],"domain_scores_gemma":[0.9994906,0.0001233676,0.00005074372,0.0001044283,0.0001853918,0.00004535223],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003580647,0.0001828183,0.001725494,0.0003926435,0.00008025904,0.000477477,0.0003649983,0.4759688,0.1966749,0.07365089,0.006787767,0.2433359],"study_design_scores_gemma":[0.00003896868,0.0001896233,0.0002960356,0.00002352089,0.00004101665,0.0001647585,0.00005144739,0.946295,0.02899056,0.01566329,0.008198103,0.0000476141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02185993,0.0005451081,0.9729571,0.0001637281,0.00008779981,0.00008127374,0.00004604162,0.002212597,0.002046328],"genre_scores_gemma":[0.6517349,0.0006547016,0.342634,0.000202201,0.00007502623,0.0002199185,0.0002012365,0.0002373305,0.004040563],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002156812,"threshold_uncertainty_score":0.006741941,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05258363901333988,"score_gpt":0.2568730001466262,"score_spread":0.2042893611332863,"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."}}