{"id":"W2119476394","doi":"10.1109/tpds.2013.166","title":"Novel Flow Control for Fully Adaptive Routing in Cache-Coherent NoCs","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"National High-tech Research and Development Program; University of Toronto; Natural Sciences and Engineering Research Council of Canada; National University of Defense Technology; National Natural Science Foundation of China","keywords":"Computer science; Static routing; Equal-cost multi-path routing; Distributed computing; Deadlock; Computer network; Dynamic Source Routing; Routing (electronic design automation); Link-state routing protocol; Policy-based routing; Multipath routing; Destination-Sequenced Distance Vector routing; Network packet; Routing table; Cache; Routing protocol","routes":{"ca_aff":true,"ca_fund":true,"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.0003473712,0.000249347,0.0004086766,0.0001181865,0.0002555026,0.0003155702,0.0002661376,0.0001631209,0.00001048023],"category_scores_gemma":[0.000006770976,0.0002151253,0.0001338585,0.0002591186,0.00003086814,0.0003902529,0.000002470636,0.0002136152,0.00002841083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001287754,"about_ca_system_score_gemma":0.00004427982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001610792,"about_ca_topic_score_gemma":0.0002609011,"domain_scores_codex":[0.9981883,0.0001128068,0.0005809857,0.000479545,0.0001989436,0.0004394414],"domain_scores_gemma":[0.9989253,0.0002736757,0.0001473658,0.0003066595,0.000193952,0.0001530869],"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.00008835743,0.0002423948,0.0000541681,0.0000492689,0.0001005964,0.000003277529,0.000439568,0.9887361,0.0005862266,0.004612186,0.0008670756,0.004220761],"study_design_scores_gemma":[0.002380813,0.00023472,0.0002827784,0.0001177832,0.00001296398,0.00004717791,0.0004712188,0.9957672,0.00002614275,0.00007394095,0.000327527,0.0002576821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002578926,0.00009392483,0.9935165,0.0002797426,0.001588631,0.001449298,0.0002378439,0.0001179285,0.0001372198],"genre_scores_gemma":[0.9966445,0.000005569292,0.001756897,0.0000802077,0.0001018197,0.001116575,0.00001154809,0.00001375608,0.000269101],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9940656,"threshold_uncertainty_score":0.8772556,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02305488258008939,"score_gpt":0.2251257754657305,"score_spread":0.2020708928856411,"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."}}