{"id":"W2013962395","doi":"10.1145/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":"Interconnection Networks and Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","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":true,"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.0007186423,0.0003330598,0.0004742353,0.0002498787,0.0006329193,0.0009337699,0.0006385077,0.0001848824,0.000001957145],"category_scores_gemma":[0.00007745094,0.0002854597,0.0002084307,0.0002705026,0.00008516887,0.0001759065,0.00002376843,0.0002923577,0.000002652667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008129697,"about_ca_system_score_gemma":0.00007339784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006544304,"about_ca_topic_score_gemma":0.00002678918,"domain_scores_codex":[0.9975988,0.0001794804,0.0007071488,0.0007451727,0.0002147133,0.0005546762],"domain_scores_gemma":[0.9979445,0.0006470096,0.0002665943,0.0006177532,0.0003653637,0.0001587348],"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.0001125738,0.0003063961,0.00009725104,0.0008150525,0.0004021387,0.000001817616,0.005979435,0.3202409,0.0004814645,0.004904768,0.0002015405,0.6664566],"study_design_scores_gemma":[0.001182198,0.0004021766,0.00001020352,0.0002118622,0.00002176163,0.0001290618,0.001933157,0.9946356,0.0001450091,0.0003312079,0.0006696643,0.0003280361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01531814,0.00008150444,0.9788712,0.0001958847,0.001483769,0.003518163,0.00001396965,0.0004473416,0.00007000305],"genre_scores_gemma":[0.6704956,4.392405e-7,0.3285544,0.00006059621,0.0002154823,0.0005780815,0.00001187678,0.00002428631,0.00005925578],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6743948,"threshold_uncertainty_score":0.9999598,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02470379012322059,"score_gpt":0.2588603850807183,"score_spread":0.2341565949574977,"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."}}