{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000366349,0.00008824521,0.0001550075,0.0001297896,0.00006807494,0.0001115337,0.000234237,0.000044131,0.00001323086],"category_scores_gemma":[0.00007695232,0.00008378145,0.00002495394,0.0001645897,0.00001314888,0.0002665601,0.000103192,0.00005052166,0.00001218754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003601934,"about_ca_system_score_gemma":0.00002720603,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003365353,"about_ca_topic_score_gemma":0.00001618357,"domain_scores_codex":[0.9992232,0.00004200611,0.0001975521,0.0002627154,0.0000891035,0.0001854447],"domain_scores_gemma":[0.9992824,0.0003648464,0.00005749005,0.0002300738,0.00003049387,0.00003475715],"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.00002306594,0.0003494317,0.01548557,0.0008267598,0.00008757152,0.00001369373,0.002899501,0.108993,0.002937285,0.1579302,0.001962494,0.7084914],"study_design_scores_gemma":[0.0001763219,0.00002932703,0.006504511,0.00008804488,0.000001976416,0.000003747808,0.00002016965,0.9877098,0.001413142,0.003893433,0.00003299543,0.0001265107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1164906,0.00006027529,0.8815067,0.0005208226,0.0000796587,0.0002301861,9.996787e-7,0.0004245014,0.0006862807],"genre_scores_gemma":[0.5907379,0.000006722679,0.4088809,0.00012208,0.000004057851,0.00002743528,8.795772e-7,0.000004663903,0.000215295],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8787168,"threshold_uncertainty_score":0.3416508,"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."}}