{"id":"W1576430908","doi":"10.1109/mascot.2003.1240678","title":"Scheduling parallel jobs with CPU and I/O resource requirements in cluster computing systems","year":2004,"lang":"en","type":"article","venue":"","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Workload; Processor scheduling; Scheduling (production processes); Distributed computing; Shared resource; Job scheduler; Gang scheduling; Dynamic priority scheduling; Computer cluster; Time-sharing; Fair-share scheduling; Parallel computing; Rate-monotonic scheduling; Operating system; Resource (disambiguation); Computer network; Schedule; 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":[],"consensus_categories":[],"category_scores_codex":[0.0007818819,0.0002204783,0.0002981223,0.000138685,0.0001624635,0.0004834759,0.0005831802,0.00006767694,6.912238e-7],"category_scores_gemma":[0.00001878388,0.0001760476,0.00002814472,0.0004650582,0.00004546145,0.0003394624,0.000317038,0.0001898582,0.00001944049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001031507,"about_ca_system_score_gemma":0.0000665785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004355761,"about_ca_topic_score_gemma":0.00004410569,"domain_scores_codex":[0.9980063,0.0001209348,0.0004487145,0.0005738578,0.0003605578,0.0004896168],"domain_scores_gemma":[0.9991207,0.00009064879,0.0001492752,0.0004492938,0.00005586937,0.0001341729],"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.00002237506,0.00007921855,0.01867267,0.0001097456,0.00003134561,0.00007476036,0.001769453,0.9390215,0.00003914589,0.03892939,0.0001624131,0.00108795],"study_design_scores_gemma":[0.005043188,0.000282378,0.01115132,0.001393387,0.000008269982,0.000352365,0.0005768132,0.9756857,0.00002419943,0.0006790098,0.00407064,0.000732769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2056893,0.0002629313,0.7894141,0.0005341829,0.0001613469,0.0002886919,6.278196e-7,0.0002085537,0.00344028],"genre_scores_gemma":[0.9400779,0.000002333424,0.05930689,0.0003792073,0.00007583803,0.000005498438,0.000004171654,0.00001239288,0.0001357438],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7343886,"threshold_uncertainty_score":0.7179015,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01928899219393387,"score_gpt":0.2440319120488646,"score_spread":0.2247429198549308,"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."}}