{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004494436,0.00008213948,0.0001185495,0.0005074975,0.00008648701,0.0001542553,0.0007443586,0.00002389448,0.00003068848],"category_scores_gemma":[0.00005414421,0.00008057695,0.00005892487,0.0006754469,0.00009525741,0.000350868,0.00006318653,0.0001127532,0.000007343873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001249037,"about_ca_system_score_gemma":0.0001694867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007482572,"about_ca_topic_score_gemma":0.000001538537,"domain_scores_codex":[0.9986398,0.00001153302,0.0004459992,0.00009523876,0.0006748223,0.0001325625],"domain_scores_gemma":[0.9979128,0.00005464378,0.000189233,0.0001155455,0.001648157,0.00007966589],"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.000004999587,0.00002589425,0.0004816288,0.000002915293,0.00002783765,0.000006070925,0.0002156431,0.9916458,0.001553503,0.000480644,0.000004258236,0.005550856],"study_design_scores_gemma":[0.000299035,0.00001545424,0.002107014,0.00008350283,0.00000823666,0.0002317202,0.00004651882,0.9965653,0.0003769169,0.0001263051,0.00006256024,0.00007747171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4132551,0.00003886183,0.5848156,0.000183037,0.001519942,0.00001956541,7.750677e-7,0.00001707116,0.0001500655],"genre_scores_gemma":[0.5537039,0.00001345973,0.4460154,0.00005256049,0.00020687,2.205343e-7,5.578268e-7,0.000004863989,0.000002115523],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.1404488,"threshold_uncertainty_score":0.3285833,"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."}}