{"id":"W2166618039","doi":"10.48550/arxiv.1312.5764","title":"Heuristics for Routing and Spiral Run-time Task Mapping in NoC-based Heterogeneous MPSOCs","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Emera (Canada)","funders":"","keywords":"Heuristics; Computer science; Dijkstra's algorithm; MPSoC; Heuristic; Routing (electronic design automation); Task (project management); Overhead (engineering); Parallel computing; Distributed computing; Network on a chip; Context (archaeology); Embedded system; Shortest path problem; Multiprocessing; Graph; Theoretical computer science; Artificial intelligence; Engineering","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003613185,0.0002906304,0.0004045209,0.0002667576,0.0001592126,0.0002385349,0.0007690965,0.0002946248,0.000007737429],"category_scores_gemma":[0.00003670703,0.0003380255,0.0001694054,0.0002602954,0.00005324593,0.0001749022,0.0007240775,0.0003492154,0.00002776712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001950955,"about_ca_system_score_gemma":0.00009258597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002730204,"about_ca_topic_score_gemma":0.00004434317,"domain_scores_codex":[0.9981568,0.0001309616,0.0003176661,0.0009123863,0.0000657629,0.0004164634],"domain_scores_gemma":[0.9986516,0.0001955511,0.0002818514,0.0006029195,0.0001498565,0.0001182366],"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.00002728555,0.00009071018,0.00544911,0.0003070233,0.00009479999,0.0002639939,0.0005906872,0.9633446,0.000146206,0.0281957,0.000508681,0.0009812076],"study_design_scores_gemma":[0.0005258408,0.00005367163,0.0002449618,0.0002171492,0.00001433783,0.0000084153,0.00003278305,0.9940347,0.00003299836,0.003905804,0.0005647287,0.0003646262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.343335,0.00003540175,0.6552735,0.00004122331,0.0005832809,0.0004234146,0.00001000038,0.00009900577,0.0001991779],"genre_scores_gemma":[0.9965168,0.00001169348,0.002538411,0.0001390925,0.0001471247,0.00000422158,0.00001171649,0.00001967174,0.0006112942],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6531817,"threshold_uncertainty_score":0.9999072,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05802660082966534,"score_gpt":0.1790240074779009,"score_spread":0.1209974066482355,"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."}}