{"id":"W2414459484","doi":"10.1142/s0129626416500092","title":"On Optimal Scheduling Algorithms for Well-Structured Workflows in the Cloud with Budget and Deadline Constraints","year":2016,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick; Ontario Tech University","funders":"Atlantic Canada Opportunities Agency","keywords":"Computer science; Cloud computing; Knapsack problem; Scheduling (production processes); Computation; Algorithm; Provisioning; Mathematical optimization; Parallel computing; Mathematics","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":[],"consensus_categories":[],"category_scores_codex":[0.0006088815,0.0002549943,0.0002494624,0.00009107198,0.0002365423,0.0003751832,0.0007468818,0.00007022322,0.000001914305],"category_scores_gemma":[0.00004704763,0.0001365055,0.00004358578,0.0002720102,0.0002085941,0.0002441658,0.00005768538,0.0001710306,0.000006187312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003407071,"about_ca_system_score_gemma":0.00006506676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004475738,"about_ca_topic_score_gemma":0.000003001692,"domain_scores_codex":[0.9982534,0.000102089,0.0002989185,0.0005590399,0.0002928156,0.0004937295],"domain_scores_gemma":[0.9989979,0.0003857808,0.000168317,0.0003207363,0.00005273387,0.00007458431],"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.00114074,0.0004674269,0.008498827,0.0008405672,0.0002616593,0.0005591769,0.01334492,0.2893734,0.005098609,0.03487991,0.009171684,0.6363631],"study_design_scores_gemma":[0.01771683,0.001126942,0.007480984,0.004199626,0.0000764634,0.001199209,0.0005546178,0.944704,0.0005021426,0.007438177,0.01224591,0.00275508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1273492,0.0001217679,0.8622636,0.009552181,0.0001708269,0.0003512924,0.000007606995,0.00009048246,0.00009315408],"genre_scores_gemma":[0.8430383,0.000002240697,0.154497,0.002195109,0.0001841183,0.00004461372,0.000006164756,0.00001420493,0.00001826248],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7156891,"threshold_uncertainty_score":0.5566532,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01511263069793686,"score_gpt":0.2470564242794591,"score_spread":0.2319437935815223,"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."}}