{"id":"W2071237670","doi":"10.2298/fuee1402235s","title":"Execution time - area tradeoff in gausing residual load decoder: Integrated exploration of chaining based schedule and allocation in HLS for hardware accelerators","year":2014,"lang":"en","type":"article","venue":"Facta universitatis - series Electronics and Energetics","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"Science and Engineering Research Board; Natural Sciences and Engineering Research Council of Canada; CMC Microsystems; Ontario Innovation Trust","keywords":"Chaining; Design space exploration; Computer science; High-level synthesis; Schedule; Heuristics; Multiplexer; Scheduling (production processes); Residual; Latency (audio); Execution time; Genetic algorithm; Parallel computing; Field-programmable gate array; Embedded system; Computer engineering; Real-time computing; Multiplexing; Mathematical optimization; Algorithm; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.000605578,0.000410617,0.0002928799,0.0004880264,0.0002064103,0.0004495811,0.0005061564,0.0003376411,0.0009926959],"category_scores_gemma":[0.001175454,0.0001696026,0.0002393806,0.0004318912,0.0002743592,0.0004817903,0.0003438595,0.0003041316,0.0001348574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005433959,"about_ca_system_score_gemma":0.001087544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001821761,"about_ca_topic_score_gemma":0.003166438,"domain_scores_codex":[0.9996887,0.0001068444,0.00001208228,0.00003799205,0.00009836746,0.00005603638],"domain_scores_gemma":[0.9995723,0.0002319845,0.00005969754,0.00004820955,0.00006925234,0.0000185045],"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.0003099545,0.0001235276,0.002121202,0.00009259537,0.0000323455,0.00007149016,0.0001313499,0.7376036,0.0540962,0.004515149,0.0004645279,0.200438],"study_design_scores_gemma":[0.00002917795,0.000319781,0.0006995135,0.000009416308,0.00001953061,0.0000506189,0.00003969778,0.9717723,0.02460124,0.00153627,0.0009144321,0.000007985835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.420093,0.0004404969,0.5730684,0.0001348916,0.00002173517,0.00008100016,0.00005324719,0.0009813744,0.005125841],"genre_scores_gemma":[0.8291477,0.0001014116,0.1689007,0.00004007408,0.000006910936,0.00004963679,0.00005839153,0.00008712725,0.00160809],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001821761,"threshold_uncertainty_score":0.003942668,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01870255359216738,"score_gpt":0.2252286630239944,"score_spread":0.206526109431827,"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."}}