{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001284403,0.0006348541,0.0004843146,0.0007733514,0.000391157,0.001132729,0.001017523,0.0004738367,0.002856019],"category_scores_gemma":[0.002773509,0.0005089423,0.0009763584,0.0003679885,0.0008011948,0.0009926391,0.0006992099,0.0007970147,0.000553237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009239286,"about_ca_system_score_gemma":0.002193554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002369983,"about_ca_topic_score_gemma":0.003476996,"domain_scores_codex":[0.9989427,0.0002473095,0.00007503785,0.0001237972,0.0004541667,0.0001570044],"domain_scores_gemma":[0.9987592,0.0006762477,0.000129325,0.0002144037,0.0001905066,0.00003045276],"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.000343811,0.0001393755,0.003331744,0.0008772495,0.00009536416,0.0005382454,0.0003816624,0.5639799,0.1001908,0.05996113,0.003200047,0.2669607],"study_design_scores_gemma":[0.0000758727,0.000195717,0.0003977101,0.0001050727,0.00005668752,0.0001069783,0.00004209241,0.8978132,0.07393846,0.01879234,0.008446807,0.00002912699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04498891,0.0003795771,0.9447342,0.0001535165,0.00006333565,0.0001261358,0.0001338623,0.005604663,0.003815862],"genre_scores_gemma":[0.428841,0.0002955966,0.5671833,0.0001307864,0.00002659186,0.0002529719,0.000389021,0.0008908628,0.001989803],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002856019,"threshold_uncertainty_score":0.009554327,"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."}}