{"id":"W4360764597","doi":"10.1109/ispa-bdcloud-socialcom-sustaincom57177.2022.00065","title":"Reuse-Aware Partitioning of Dataflow Graphs on a Tightly-Coupled CGRA","year":2022,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Dataflow; Computer science; Parallel computing; Cache; Partition (number theory); Limit (mathematics); Reuse; CPU cache; Distributed computing; Mathematics","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.0003671377,0.00007771145,0.0001350115,0.0001113044,0.0002513721,0.00005717342,0.0008493891,0.00001946764,0.000519477],"category_scores_gemma":[0.00001636465,0.00006765664,0.0000755672,0.0004364232,0.00001406643,0.0001760983,0.0003948411,0.0001288317,0.00002462289],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002966473,"about_ca_system_score_gemma":0.00002510733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000132198,"about_ca_topic_score_gemma":0.00004571523,"domain_scores_codex":[0.9989262,0.0001003116,0.0002489882,0.000262991,0.0002983324,0.0001632075],"domain_scores_gemma":[0.9989439,0.00007565021,0.00009577454,0.0007915306,0.00005108811,0.00004205908],"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.00003027581,0.0002243414,0.00131966,0.00002383164,0.00005687569,0.0000274165,0.001240579,0.02040734,0.0007418065,0.8480696,0.1261726,0.001685724],"study_design_scores_gemma":[0.0004891074,0.0005637502,0.0005554159,0.00003931632,0.000005047685,0.00003628037,0.0003102909,0.9547072,0.0009745604,0.008105011,0.03396998,0.0002440436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.183917,0.00009807391,0.782414,0.003010811,0.004729869,0.0005240097,0.00002773086,0.0006242892,0.02465416],"genre_scores_gemma":[0.9971277,0.000002079104,0.001194453,0.0004510653,0.0000421477,0.00004470167,0.000009410768,0.000005681814,0.001122817],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9342998,"threshold_uncertainty_score":0.5687909,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01848065368098811,"score_gpt":0.2261158250322508,"score_spread":0.2076351713512627,"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."}}