{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003114634,0.001129574,0.001773119,0.001187345,0.0009766346,0.00124932,0.002579876,0.0006797486,0.002052703],"category_scores_gemma":[0.00576795,0.0006348106,0.0005466611,0.001701188,0.0006499943,0.00135535,0.0005609198,0.001090728,0.0007438521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001916824,"about_ca_system_score_gemma":0.002503419,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005180438,"about_ca_topic_score_gemma":0.005051215,"domain_scores_codex":[0.9986896,0.0002644693,0.0001033594,0.0003070268,0.0004865855,0.0001489578],"domain_scores_gemma":[0.9963825,0.001979906,0.0004969607,0.0004381754,0.0005221795,0.0001803138],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001535609,0.0004643913,0.003151463,0.001162583,0.0001695501,0.0002598768,0.0003936569,0.3046028,0.04506403,0.05094139,0.01133879,0.5809159],"study_design_scores_gemma":[0.0002321612,0.0006441782,0.001091972,0.00005570552,0.00009287801,0.0003537806,0.00005581981,0.9118451,0.0356548,0.02504214,0.02484655,0.00008496339],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02292749,0.002101875,0.9685484,0.0002331412,0.0003173068,0.0003917513,0.0001948867,0.002175945,0.003109301],"genre_scores_gemma":[0.287497,0.001483074,0.7036129,0.0002347423,0.0002875975,0.0002469962,0.0003416828,0.0002194748,0.006076435],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005180438,"threshold_uncertainty_score":0.01647198,"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."}}