{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003977062,0.0003074589,0.0002087411,0.0004506767,0.0003361362,0.0005248754,0.0009595485,0.0002771634,0.0007620574],"category_scores_gemma":[0.0008644126,0.0001947073,0.0001936217,0.0003205876,0.0003933833,0.0007822753,0.0003702175,0.0003631295,0.0001086258],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005248665,"about_ca_system_score_gemma":0.0005659277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001204347,"about_ca_topic_score_gemma":0.002404671,"domain_scores_codex":[0.9997286,0.00005163702,0.00002797385,0.00006198947,0.00009537301,0.00003436744],"domain_scores_gemma":[0.9993881,0.0001617793,0.00009242554,0.0001298015,0.0001984955,0.00002934479],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003022676,0.000167551,0.002599914,0.0002272834,0.0000690021,0.000221391,0.000243051,0.210987,0.3001561,0.05033197,0.003902981,0.4307916],"study_design_scores_gemma":[0.00003985806,0.0002307431,0.0006089144,0.00001859968,0.00003033384,0.0001663241,0.00001796146,0.9440061,0.0402531,0.008836153,0.005754573,0.00003730304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0985622,0.0005958108,0.8958082,0.0001645518,0.00008831149,0.00005687335,0.00006450497,0.001178706,0.003480773],"genre_scores_gemma":[0.7695806,0.0002325302,0.227582,0.0001754552,0.00006419424,0.00009337322,0.0001091652,0.00005948695,0.002103164],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001204347,"threshold_uncertainty_score":0.003808141,"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."}}