{"id":"W1879969327","doi":"10.1109/icatm.1999.786815","title":"A feasible scheduling algorithm for per-VC queueing ATM switches","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Queueing theory; Computer science; Scheduling (production processes); Layered queueing network; Computation; Queueing system; Weighted fair queueing; Computer network; Algorithm; Real-time computing; Distributed computing; Parallel computing; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001361595,0.0008344595,0.0007627051,0.0006994788,0.001062965,0.001591411,0.002139831,0.00109471,0.006832964],"category_scores_gemma":[0.004063895,0.00063921,0.0006772849,0.0009935281,0.0006726666,0.001612047,0.001173803,0.001224383,0.00173483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001249082,"about_ca_system_score_gemma":0.002721178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00324126,"about_ca_topic_score_gemma":0.002443925,"domain_scores_codex":[0.9989604,0.0003061708,0.00006437014,0.0001767929,0.0003420605,0.000150263],"domain_scores_gemma":[0.998896,0.0005046047,0.00008669036,0.0001412115,0.0002948073,0.00007659852],"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.000287497,0.0001246508,0.000335936,0.0001884804,0.00003678863,0.0001471312,0.0001894218,0.5814957,0.00684262,0.1714009,0.008341965,0.230609],"study_design_scores_gemma":[0.00004872722,0.00004224399,0.00003933628,0.00001093282,0.000006815507,0.0000281919,0.00001585191,0.9723948,0.001131337,0.02277627,0.003493827,0.00001167654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002428969,0.00005233888,0.9954632,0.0000733692,0.00004081859,0.00005429396,0.00004339518,0.0003129116,0.001530678],"genre_scores_gemma":[0.133159,0.0001458247,0.8637044,0.00006115055,0.00006120247,0.0002555106,0.0002433507,0.0001527201,0.00221687],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006832964,"threshold_uncertainty_score":0.0228585,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02649184236328101,"score_gpt":0.2579020394017021,"score_spread":0.2314101970384211,"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."}}