{"id":"W2344488400","doi":"10.1145/2927964.2927973","title":"Efficient Mapping and Allocation of Execution Units to Task Graphs using an Evolutionary Framework","year":2016,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Control reconfiguration; Computer science; Task (project management); Field-programmable gate array; Genetic algorithm; Execution time; Power consumption; Multi-objective optimization; Power (physics); Distributed computing; Parallel computing; Embedded system; Engineering","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.0004079218,0.0003910342,0.0003254082,0.0005154649,0.0004010314,0.0005578508,0.0009080778,0.0004115426,0.001185397],"category_scores_gemma":[0.001069049,0.0002244187,0.000462703,0.0004537509,0.0004497538,0.000511964,0.0004978279,0.0006194406,0.0002088996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006349609,"about_ca_system_score_gemma":0.001010394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004565485,"about_ca_topic_score_gemma":0.007178459,"domain_scores_codex":[0.9997389,0.0000762882,0.000009055141,0.00004324868,0.0000803046,0.0000522555],"domain_scores_gemma":[0.9997773,0.00008458554,0.0000233516,0.00005056882,0.00004520121,0.00001901385],"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.00004319431,0.00006903576,0.0006388574,0.00004303174,0.00002396173,0.00008146333,0.00008670345,0.828442,0.01970125,0.01465895,0.00102091,0.1351906],"study_design_scores_gemma":[0.000008946943,0.00004297967,0.0002755552,0.000005669424,0.00001044113,0.00004334196,0.00002722255,0.9879731,0.004041536,0.005549237,0.00201563,0.000006373806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03900638,0.0001257508,0.9568021,0.00009257065,0.00001592565,0.00005705887,0.00002468309,0.0006512488,0.003224415],"genre_scores_gemma":[0.4213833,0.0001965385,0.5751866,0.00006201888,0.00001210883,0.000113136,0.00009767488,0.0001665883,0.002782091],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004565485,"threshold_uncertainty_score":0.009077787,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0317336233244092,"score_gpt":0.2716607310664878,"score_spread":0.2399271077420786,"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."}}