{"id":"W2135331813","doi":"10.1109/glocom.2001.966200","title":"Deadline based channel scheduling","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Earliest deadline first scheduling; Scheduling (production processes); Network packet; Real-time computing; Dynamic priority scheduling; Round-robin scheduling; Computer network; Fair-share scheduling; Rate-monotonic scheduling; Deadline-monotonic scheduling; Queue; Priority queue; Distributed computing; Quality of service; Mathematical optimization; Mathematics","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.0000970749,0.00007126813,0.0000743226,0.00004124171,0.00006971443,0.00006909832,0.0003543552,0.0000309206,0.000282426],"category_scores_gemma":[0.00001252975,0.00006083865,0.00003875201,0.0001991895,0.0000119385,0.0001489194,0.00003175197,0.00006629492,0.0004258239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008116196,"about_ca_system_score_gemma":0.0000091824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002000703,"about_ca_topic_score_gemma":0.000002436099,"domain_scores_codex":[0.9993747,0.00002025545,0.0001035852,0.0001942892,0.0001229946,0.0001842014],"domain_scores_gemma":[0.999539,0.00005839377,0.00002289735,0.0002625744,0.00004019164,0.00007693935],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002376285,0.0001075489,0.00006625262,0.000003853773,0.00001101341,0.00001996678,0.00007167774,0.04220038,0.00004442391,0.1037555,0.006614818,0.8471022],"study_design_scores_gemma":[0.0003261638,0.00002099116,0.00002748569,0.000004841813,0.000001638319,0.000002681864,0.00000237121,0.9947903,0.00007275468,0.0002562166,0.004409124,0.00008549589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008695856,0.000225861,0.9812774,0.007335221,0.0002316828,0.00005345679,1.338234e-7,0.0003842797,0.009622402],"genre_scores_gemma":[0.9382952,0.00000544977,0.05690332,0.002883489,0.0001265844,0.000007797635,3.259667e-7,0.000003716998,0.001774044],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9525899,"threshold_uncertainty_score":0.5473247,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02218514546706572,"score_gpt":0.2034999235855982,"score_spread":0.1813147781185324,"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."}}