{"id":"W3137662336","doi":"10.1109/tc.2021.3066466","title":"Efficient Memory Arbitration in High-Level Synthesis From Multi-Threaded Code","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council; Royal Academy of Engineering","keywords":"Computer science; Satisfiability modulo theories; Parallel computing; Programming language; Correctness; Memory model; High-level synthesis; Memory bandwidth; Embedded system; Field-programmable gate array; Shared memory","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.000301532,0.0002664473,0.0003563293,0.0003336058,0.0001371236,0.0001668821,0.0006697046,0.0001671091,0.00002361513],"category_scores_gemma":[0.00001135991,0.0002929504,0.0001471612,0.0006961446,0.000046521,0.000199295,0.000007661477,0.0003496055,0.00006136752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002706237,"about_ca_system_score_gemma":0.0001948745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005141532,"about_ca_topic_score_gemma":0.0005144685,"domain_scores_codex":[0.9976008,0.0003687871,0.0005023656,0.0007806463,0.0004135296,0.0003338732],"domain_scores_gemma":[0.9980724,0.0006681372,0.0001108638,0.000919408,0.0001119026,0.000117216],"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.00005046866,0.002255762,0.00003946456,0.00005549314,0.0001961426,0.0004987419,0.003474528,0.789913,0.06310721,0.001637644,0.0007268886,0.1380446],"study_design_scores_gemma":[0.0004853634,0.00003562033,0.0003617536,0.0001946224,0.00001283042,0.00001781937,0.00004691026,0.590558,0.407839,0.0001493862,0.00001958995,0.0002791462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02884999,0.00003928499,0.9680443,0.0004361966,0.001576293,0.0003135435,0.00004778109,0.0005861159,0.0001065154],"genre_scores_gemma":[0.7015867,0.000006628801,0.2978929,0.0003217159,0.00003038173,0.00009134701,0.000002479003,0.00001781032,0.00005004275],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6727366,"threshold_uncertainty_score":0.9999523,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04658614280639239,"score_gpt":0.2610563181172016,"score_spread":0.2144701753108093,"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."}}