{"id":"W31541170","doi":"10.1038/s41598-019-50088-1","title":"An Approach to Scheduling in a Hardware-Software Co-Design Toolchain","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"National Institute of Neurological Disorders and Stroke; National Cancer Institute; Canadian Institutes of Health Research","keywords":"Computer science; Compiler; Very long instruction word; Toolchain; Compile time; Digital subscriber line; Parallel computing; Optimizing compiler; Programming language; Instruction scheduling; Just-in-time compilation; Code generation; Scheduling (production processes); Domain-specific language; Computer architecture; Software; Schedule; Operating system; Dynamic priority scheduling","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006975346,0.0003370572,0.0003794491,0.0006578366,0.0001075522,0.0002840128,0.001785929,0.000329977,0.00001432639],"category_scores_gemma":[0.00009527693,0.0003390286,0.00007122489,0.0006490276,0.000008951212,0.0003825788,0.00006580842,0.0003405446,0.00004526791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006476482,"about_ca_system_score_gemma":0.0002210723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001411224,"about_ca_topic_score_gemma":0.0000181423,"domain_scores_codex":[0.9977951,0.0001950953,0.0004370174,0.0008902619,0.000306574,0.0003759714],"domain_scores_gemma":[0.9986095,0.00005722844,0.0001555552,0.0008429053,0.0001636421,0.0001712001],"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.0002300814,0.001800033,0.0006488757,0.0004295155,0.00008372343,0.00005058579,0.03173695,0.7126298,0.000366263,0.08554113,0.008816084,0.157667],"study_design_scores_gemma":[0.0003385512,0.0002856295,0.0009732672,0.0002789401,0.000008773575,0.000007113486,0.0003161125,0.9854831,0.006634334,0.003925839,0.0004499345,0.001298464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006643325,0.00006130871,0.9715239,0.000009757045,0.0001777481,0.0005799396,0.000001391002,0.001431255,0.0255503],"genre_scores_gemma":[0.01283829,0.00001211525,0.9824823,0.0002763549,0.00004368891,0.0001353835,0.0001905609,0.00003780356,0.003983511],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2728532,"threshold_uncertainty_score":0.9999062,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04248305388404554,"score_gpt":0.2989307512534728,"score_spread":0.2564476973694273,"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."}}