{"id":"W1994618033","doi":"10.1109/tc.2015.2425887","title":"A Deadlock-Free and Connectivity-Guaranteed Methodology for Achieving Fault-Tolerance in On-Chip Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Chinese Academy of Engineering; China Postdoctoral Science Foundation; University of British Columbia; National Natural Science Foundation of China","keywords":"Computer science; Router; Fault tolerance; Distributed computing; Robustness (evolution); Network on a chip; Deadlock; Parallel computing; Computer network","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007089894,0.0005446365,0.0003380452,0.0009064024,0.0005640709,0.0005200491,0.001367573,0.0004650534,0.000862558],"category_scores_gemma":[0.001364248,0.0002465232,0.0004776432,0.0004783237,0.0006988239,0.0009367549,0.0006796871,0.000545734,0.0001290038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006532276,"about_ca_system_score_gemma":0.0009899404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00150961,"about_ca_topic_score_gemma":0.001900209,"domain_scores_codex":[0.9994311,0.0001645063,0.00003946503,0.00006841588,0.000229684,0.00006687426],"domain_scores_gemma":[0.9993579,0.0002016799,0.00009873381,0.000185764,0.000124705,0.0000311984],"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.0001197395,0.0001527461,0.001604486,0.000450996,0.0001124761,0.0002911821,0.0002159846,0.5095989,0.1286678,0.06354599,0.002513888,0.2927257],"study_design_scores_gemma":[0.00005081475,0.000403637,0.0006000411,0.00003085593,0.00006721487,0.000327688,0.00003740746,0.9169739,0.0505456,0.0233557,0.007561633,0.00004544478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01881693,0.0003324798,0.9788033,0.00007862609,0.00003351237,0.00005729129,0.00001899749,0.0009773467,0.0008815238],"genre_scores_gemma":[0.4018412,0.000403626,0.5960824,0.0001262897,0.00002924353,0.000159545,0.00009386128,0.0001122386,0.001151582],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00150961,"threshold_uncertainty_score":0.004739463,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07252094743277537,"score_gpt":0.2913596271412051,"score_spread":0.2188386797084297,"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."}}