{"id":"W3004399614","doi":"10.1109/icfpt47387.2019.00046","title":"ASAP: Automatic Sizing and Partitioning for Dynamic Memory Heaps in High-Level Synthesis","year":2019,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Heap (data structure); Computer science; Parallel computing; C dynamic memory allocation; Dynamic random-access memory; Sizing; Suite; Embedded system; Memory management; Computer hardware; Overlay; Operating system; Algorithm; Semiconductor 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.0005134925,0.0007610215,0.0003497234,0.0006762275,0.0003200272,0.0007585107,0.0009463699,0.0003923437,0.003212071],"category_scores_gemma":[0.001123879,0.0004094853,0.0004927064,0.0004043579,0.0004862111,0.0007090883,0.0006624123,0.0006291826,0.0007934414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004781106,"about_ca_system_score_gemma":0.001334874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001137515,"about_ca_topic_score_gemma":0.002460021,"domain_scores_codex":[0.9996081,0.00008666774,0.0000261289,0.00005008649,0.0001690453,0.00006001913],"domain_scores_gemma":[0.9995202,0.0002105055,0.0000682107,0.000102241,0.00008089204,0.00001798317],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003146378,0.0001941287,0.003194214,0.0006700818,0.0001083445,0.0002951991,0.0002785291,0.3447859,0.2172389,0.03364883,0.01154501,0.3877262],"study_design_scores_gemma":[0.00008292447,0.0002394634,0.000764491,0.0000476614,0.00005602193,0.0001540135,0.00004981971,0.79953,0.1629313,0.01775582,0.01835072,0.00003787633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0402475,0.0003206366,0.9441023,0.0001021757,0.00006181803,0.0001070835,0.0002230016,0.00988402,0.004951525],"genre_scores_gemma":[0.3297766,0.0002394272,0.6657061,0.0001268249,0.00003095767,0.0002645044,0.000373034,0.001143149,0.002339405],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003212071,"threshold_uncertainty_score":0.01074541,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01564638500214893,"score_gpt":0.2515090246905054,"score_spread":0.2358626396883565,"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."}}