{"id":"W1880476883","doi":"10.1109/wordsf.1999.842329","title":"Batching earliest deadline first scheduling","year":2003,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Scheduling (production processes); Dynamic priority scheduling; Earliest deadline first scheduling; Distributed computing; Fixed-priority pre-emptive scheduling; Deadline-monotonic scheduling; Prioritization; Fair-share scheduling; Rate-monotonic scheduling; Processor scheduling; Real-time computing; Mathematical optimization; Quality of service; Computer network; Resource (disambiguation)","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.0008578293,0.0001893908,0.0002157161,0.0001154026,0.0002781897,0.0004368314,0.0007582115,0.00008056411,0.00007237324],"category_scores_gemma":[0.0002618949,0.0001687341,0.00008339518,0.0004572533,0.00002297205,0.0009567447,0.0001539688,0.0001918197,0.0007014705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005608803,"about_ca_system_score_gemma":0.00009346989,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001546078,"about_ca_topic_score_gemma":0.00005319806,"domain_scores_codex":[0.9982357,0.00009808922,0.000371444,0.0004988183,0.0003423178,0.000453646],"domain_scores_gemma":[0.9986859,0.0002000399,0.00009833814,0.0007610592,0.00008672723,0.0001679367],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002130479,0.00008612075,0.007378407,0.00006183349,0.00004130688,0.00006069696,0.001163281,0.01709861,0.00272195,0.9661919,0.0003116885,0.004882016],"study_design_scores_gemma":[0.002339243,0.0002185831,0.004147873,0.0004299329,0.00002592412,0.0007701116,0.0009280264,0.8592951,0.03635072,0.02254777,0.07065791,0.002288766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04610251,0.0001591616,0.9024957,0.0006431839,0.0005858287,0.0001434329,1.665303e-7,0.0004194171,0.04945061],"genre_scores_gemma":[0.6213081,0.000004444226,0.3777382,0.000147413,0.00006566106,0.000007041145,4.095527e-7,0.0000123219,0.0007164063],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9436442,"threshold_uncertainty_score":0.9016218,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01406938097791094,"score_gpt":0.2271196325326044,"score_spread":0.2130502515546935,"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."}}