{"id":"W4251606168","doi":"10.1145/2501626.2512470","title":"A constraint programming approach for integrated spatial and temporal scheduling for clustered architectures","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scheduling (production processes); Parallel computing; Gang scheduling; Dynamic priority scheduling; Two-level scheduling; Compiler; Fair-share scheduling; Distributed computing; Schedule; Programming language; Mathematical optimization","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002664036,0.0002735789,0.000330652,0.0001930721,0.0002904865,0.0002963339,0.0001844599,0.0001583116,0.000003518415],"category_scores_gemma":[0.00007121113,0.0002576291,0.0001135468,0.0001765239,0.00006307487,0.00005984108,0.000004582055,0.0002464476,0.000001826416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000577564,"about_ca_system_score_gemma":0.0000297727,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001233872,"about_ca_topic_score_gemma":0.000005514219,"domain_scores_codex":[0.9986467,0.00004418682,0.0004518621,0.0003472805,0.0001281496,0.000381867],"domain_scores_gemma":[0.9990122,0.0003340902,0.00007879872,0.000275558,0.0001750719,0.0001242383],"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.00001936234,0.00003822444,0.00001634199,0.0003049306,0.0001112862,1.794987e-7,0.0008436327,0.8641638,0.000105513,0.00002584674,0.000009568303,0.1343613],"study_design_scores_gemma":[0.001194155,0.0001193738,0.000006533968,0.0001306676,0.00004214809,0.00003046063,0.002508008,0.9952095,0.0003337374,0.00004721218,0.00009301962,0.0002852357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02842719,0.0001199329,0.9677755,0.00004246421,0.0006483047,0.002162165,0.00003330452,0.0007511181,0.00003998777],"genre_scores_gemma":[0.5373479,9.365929e-7,0.4621387,0.000013103,0.0001009992,0.000307491,0.00003708612,0.0000390002,0.00001471523],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5089207,"threshold_uncertainty_score":0.9999876,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01773392888687907,"score_gpt":0.2413033639518936,"score_spread":0.2235694350650146,"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."}}