{"id":"W2997008791","doi":"10.48550/arxiv.1312.5764","title":"Heuristics for Routing and Spiral Run-time Task Mapping in NoC-based\\n Heterogeneous MPSOCs","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Emera (Canada)","funders":"","keywords":"Heuristics; Computer science; MPSoC; Dijkstra's algorithm; Heuristic; Routing (electronic design automation); Task (project management); Overhead (engineering); Network on a chip; Distributed computing; Parallel computing; Context (archaeology); Embedded system; Multiprocessing; Shortest path problem; Graph; Theoretical computer science; Engineering; Artificial intelligence","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.0003714729,0.0003002477,0.0004108066,0.0002721271,0.0001654876,0.0002491145,0.0007997739,0.0003029531,0.00000810137],"category_scores_gemma":[0.0000362029,0.000349167,0.0001740741,0.0002635644,0.00005421173,0.000189438,0.0008140839,0.0003684206,0.00003154087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002016995,"about_ca_system_score_gemma":0.00009319078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002855863,"about_ca_topic_score_gemma":0.00004732194,"domain_scores_codex":[0.9981027,0.0001292331,0.0003252786,0.0009423041,0.00006810643,0.0004324208],"domain_scores_gemma":[0.9986231,0.0001945486,0.0002851249,0.0006217742,0.0001522454,0.0001232238],"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.00002442032,0.00009071042,0.005846085,0.00031591,0.00009508325,0.0002810044,0.0005971759,0.956575,0.0001118482,0.03434533,0.0005984665,0.001118986],"study_design_scores_gemma":[0.0004721669,0.00005587797,0.0002330282,0.0002281419,0.00001470604,0.0000103955,0.00003493848,0.9933759,0.00002906204,0.004450526,0.0007179844,0.0003772519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3336754,0.00004393385,0.6648273,0.00004468592,0.0006352782,0.0004259408,0.000010716,0.000101805,0.0002349748],"genre_scores_gemma":[0.9964507,0.00001486303,0.002514038,0.0001442505,0.0001642253,0.000004304361,0.00001115014,0.00002049828,0.0006760047],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6627753,"threshold_uncertainty_score":0.999896,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05749991163793157,"score_gpt":0.1792497328622055,"score_spread":0.1217498212242739,"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."}}