{"id":"W2096151535","doi":"10.1142/s0129054101000485","title":"EFFICIENT PARALLEL JOB SCHEDULING USING GANG SERVICE","year":2001,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; McMaster University; National Aeronautics and Space Administration","keywords":"Computer science; Dynamic priority scheduling; Rate-monotonic scheduling; Scheduling (production processes); Gang scheduling; Fair-share scheduling; Two-level scheduling; Distributed computing; Multiprocessor scheduling; Workload; Bin packing problem; Earliest deadline first scheduling; Mathematical optimization; Parallel computing; Algorithm; Mathematics; Bin; Quality of service","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001114947,0.0004647368,0.0009009311,0.001029442,0.001188693,0.001204086,0.001204404,0.0005925837,0.001814958],"category_scores_gemma":[0.002267581,0.0003710073,0.0005682249,0.00170415,0.0005075705,0.001492647,0.001841602,0.0006389286,0.0007041245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005812277,"about_ca_system_score_gemma":0.001182489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001479011,"about_ca_topic_score_gemma":0.001853802,"domain_scores_codex":[0.9992275,0.0001774789,0.00004335243,0.00008002704,0.0002956612,0.0001760069],"domain_scores_gemma":[0.9989738,0.0003202376,0.00008875113,0.0002617122,0.0002152764,0.0001402069],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001349429,0.0005049072,0.002284388,0.0003062595,0.0001067274,0.000396926,0.0003379061,0.536653,0.04730229,0.08727463,0.009669029,0.3138145],"study_design_scores_gemma":[0.00007194663,0.0001238864,0.0002808595,0.000007243112,0.00001507556,0.0001197012,0.00005882734,0.9436712,0.009059363,0.03902919,0.007541252,0.00002133466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08621289,0.0004987198,0.9045466,0.0002236183,0.0001320855,0.0001531935,0.00009756463,0.001937298,0.006197967],"genre_scores_gemma":[0.7460845,0.0004346651,0.2481202,0.0001053107,0.0001011941,0.0001774709,0.0002783846,0.0001964705,0.004501733],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001814958,"threshold_uncertainty_score":0.006071627,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02467930034830723,"score_gpt":0.2913659341351398,"score_spread":0.2666866337868326,"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."}}