{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00104658,0.001207751,0.0005121864,0.001349385,0.000597392,0.001259944,0.001927621,0.0007147133,0.01488023],"category_scores_gemma":[0.002271854,0.0007911349,0.0009987125,0.001095453,0.0004668125,0.001232797,0.0009327244,0.001340554,0.005026134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009201452,"about_ca_system_score_gemma":0.002016492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002254832,"about_ca_topic_score_gemma":0.003878218,"domain_scores_codex":[0.9992388,0.0001505013,0.00008006108,0.00009645465,0.0003457918,0.0000883276],"domain_scores_gemma":[0.9990551,0.0003523542,0.00009755973,0.0002208092,0.0002389308,0.0000352713],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004155366,0.0002836008,0.001704166,0.00149174,0.0001145483,0.000395581,0.0002920466,0.1735351,0.08815955,0.05678026,0.05937033,0.6174576],"study_design_scores_gemma":[0.000231303,0.0003249403,0.00105163,0.0002827976,0.0001276239,0.0005571981,0.00005373841,0.5902304,0.1505575,0.03333139,0.2231068,0.0001446345],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.004238029,0.0004001617,0.9335054,0.00008306172,0.00004679522,0.0001261427,0.0008563626,0.05116921,0.009574936],"genre_scores_gemma":[0.07891004,0.0006365358,0.8989878,0.0002891387,0.0000495748,0.0007864093,0.002683284,0.00692986,0.0107274],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.01488023,"threshold_uncertainty_score":0.04977936,"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."}}