{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007233456,0.0001660447,0.0002587262,0.0001147163,0.0001000612,0.0001489742,0.000532961,0.0001041387,0.000003261444],"category_scores_gemma":[0.00004231805,0.0001409043,0.000106269,0.0002159095,0.00001795215,0.0003994788,0.0001560995,0.0001333192,0.00001963125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006443802,"about_ca_system_score_gemma":0.00005457091,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001940818,"about_ca_topic_score_gemma":0.0003997254,"domain_scores_codex":[0.9985168,0.00003055774,0.0004096578,0.0004611943,0.0001698977,0.000411877],"domain_scores_gemma":[0.9991412,0.0002038267,0.0001235832,0.0003236595,0.0001312092,0.00007648928],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001091917,0.0002162541,0.0003749871,0.00002821955,0.0000356425,0.000002942417,0.006715132,0.07914523,0.003866909,0.8900495,0.005271846,0.01418416],"study_design_scores_gemma":[0.0007153733,0.0002040087,0.0002260714,0.00003889438,0.000002331489,0.00001030933,0.0001271385,0.9970804,0.0002657568,0.0007187947,0.0004087659,0.0002021537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01389317,0.000003838497,0.975325,0.0003330272,0.0005582494,0.0002837165,0.000002627022,0.00009667661,0.009503706],"genre_scores_gemma":[0.8839602,2.71744e-7,0.1135581,0.0004861621,0.0002491122,0.00005565606,0.000001123483,0.00001263735,0.001676694],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9179352,"threshold_uncertainty_score":0.574591,"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."}}