{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001711733,0.001167989,0.0006514545,0.0006715194,0.0007125363,0.001053427,0.0016272,0.0009190299,0.003240627],"category_scores_gemma":[0.003995328,0.0007998015,0.001220856,0.001842551,0.000807467,0.00108751,0.0008775707,0.002131712,0.0003981692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001196336,"about_ca_system_score_gemma":0.002899201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01309769,"about_ca_topic_score_gemma":0.02046688,"domain_scores_codex":[0.9988779,0.0004148703,0.00004598298,0.0001554217,0.0004032317,0.0001025984],"domain_scores_gemma":[0.9979139,0.001478054,0.0001280791,0.0001109681,0.0003035408,0.00006539312],"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.00003114173,0.00005946828,0.0001952413,0.00008978243,0.00004608474,0.00007710356,0.00006330208,0.9334002,0.001640009,0.03469188,0.00179788,0.02790794],"study_design_scores_gemma":[0.00001729753,0.00002605994,0.00005211007,0.00001053651,0.00001207024,0.00001986866,0.00001629746,0.9870072,0.0006801187,0.00938069,0.002770305,0.000007434006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002710427,0.0001070843,0.9945478,0.0001515582,0.00001816674,0.00006618756,0.00007221611,0.0001299166,0.002196635],"genre_scores_gemma":[0.05712193,0.0002508817,0.9400693,0.0001373658,0.00003363434,0.0003521286,0.000198434,0.0001124725,0.00172386],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01309769,"threshold_uncertainty_score":0.02604294,"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."}}