{"id":"W2986344129","doi":"10.1109/fpl.2019.00057","title":"A Dynamic Memory Allocation Library for High-Level Synthesis","year":2019,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; C dynamic memory allocation; Allocator; High-level synthesis; Software portability; Suite; Benchmark (surveying); Memory management; Software; Embedded system; Register allocation; Computer architecture; Operating system; Overlay; Compiler; Field-programmable gate array","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.0001302527,0.00008526316,0.0001074936,0.00009549117,0.00005294308,0.0001106759,0.0005864805,0.00005099573,0.00005491858],"category_scores_gemma":[0.0000268808,0.0000764107,0.00004201639,0.0001739719,0.000008716674,0.0005356454,0.0001302323,0.00003611585,0.00008620403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001524208,"about_ca_system_score_gemma":0.0000510991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000703983,"about_ca_topic_score_gemma":6.600624e-7,"domain_scores_codex":[0.999316,0.00002812977,0.0001438365,0.000270825,0.00009739535,0.0001438316],"domain_scores_gemma":[0.9992698,0.000195745,0.00005718537,0.0004040708,0.00003791685,0.00003531862],"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.00003035346,0.0002110565,0.0003476363,0.0001422144,0.00006420504,0.000001734299,0.0003795511,0.01994631,0.002123406,0.6550293,0.05879916,0.2629251],"study_design_scores_gemma":[0.000137358,0.00004581744,0.0006357543,0.00002003255,0.000002819925,0.000001995484,0.000006483959,0.9719971,0.01791583,0.008001479,0.001070948,0.0001643392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002923975,0.0000227636,0.9875695,0.001745615,0.0001658261,0.0002798077,0.000003060279,0.001193553,0.006095887],"genre_scores_gemma":[0.3970047,0.000007753812,0.5963661,0.0004021968,0.00000910601,0.00003473007,0.000006461861,0.000008411431,0.006160534],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9520508,"threshold_uncertainty_score":0.3115938,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01395622118369668,"score_gpt":0.2331841329232962,"score_spread":0.2192279117395995,"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."}}