{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005843718,0.0004696257,0.0008289928,0.0003313731,0.0003757854,0.0004534369,0.0006678227,0.0003547043,0.000008912332],"category_scores_gemma":[0.00003442758,0.0004135771,0.0002748095,0.001173645,0.00004710498,0.0003352857,0.000005344195,0.0004516258,0.00001900156],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000166189,"about_ca_system_score_gemma":0.0002396195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004565072,"about_ca_topic_score_gemma":0.00001566741,"domain_scores_codex":[0.9966511,0.000460364,0.001023117,0.0009723381,0.0004091888,0.0004839061],"domain_scores_gemma":[0.9967977,0.001285308,0.0003253681,0.0005778849,0.000656963,0.0003567154],"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.0002933248,0.0001856089,0.000004838965,0.0001895958,0.0002427831,0.000008102583,0.000945551,0.9457718,0.003361372,0.004901822,0.002110429,0.04198484],"study_design_scores_gemma":[0.0008977829,0.004752781,0.000008992454,0.0006830652,0.00004233115,0.00004330794,0.000138756,0.9867395,0.004726929,0.0005835557,0.0008920916,0.0004909221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003738452,0.00008981334,0.9883355,0.000724207,0.004851768,0.0017756,0.00009133893,0.0003583342,0.00003492114],"genre_scores_gemma":[0.946425,0.00001561628,0.05140649,0.001405188,0.0003408026,0.0002930931,0.000004847553,0.00004566412,0.00006335122],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9426865,"threshold_uncertainty_score":0.9998316,"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."}}