{"id":"W2050926039","doi":"10.1109/nocs.2014.7008785","title":"A novel non-minimal/minimal turn model for highly adaptive routing in 2D NoCs","year":2014,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Bottleneck; Computer science; Dependency (UML); Deadlock; Routing (electronic design automation); Network on a chip; Dependency graph; Distributed computing; Directed acyclic graph; Computer network; Parallel computing; Graph; Theoretical computer science; Embedded system; Algorithm","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.0001124392,0.0004097909,0.0003147019,0.0003186873,0.0003284365,0.0006209926,0.0006004975,0.0005460302,0.001330774],"category_scores_gemma":[0.0003374979,0.0002112241,0.0004337342,0.0001872949,0.0005629318,0.0006441867,0.000607095,0.0004416003,0.0001510059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004671603,"about_ca_system_score_gemma":0.0003948748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001631557,"about_ca_topic_score_gemma":0.002250319,"domain_scores_codex":[0.9998662,0.00003111118,0.000005212753,0.00003374414,0.0000345299,0.00002902736],"domain_scores_gemma":[0.9998668,0.0000470939,0.00002336902,0.00001817967,0.00002084846,0.00002369873],"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.00008875757,0.00004222617,0.0006610465,0.00006808071,0.0000183548,0.0003963095,0.0001031272,0.8507566,0.01782854,0.1176907,0.0008021098,0.01154417],"study_design_scores_gemma":[0.00001172309,0.00007142469,0.0001589474,0.000007929592,0.00001281749,0.00009433923,0.00002353511,0.967623,0.00130831,0.02849142,0.00218576,0.00001075726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1640961,0.0005964882,0.8161684,0.0002912546,0.00009146964,0.00005031303,0.000157464,0.0002529067,0.01829558],"genre_scores_gemma":[0.9454067,0.0004258232,0.04885325,0.00009657526,0.00004085672,0.00008123514,0.0001382224,0.00004909768,0.004908144],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001631557,"threshold_uncertainty_score":0.004451871,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03259003822288714,"score_gpt":0.2484385627084164,"score_spread":0.2158485244855292,"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."}}