{"id":"W2520417227","doi":"10.1007/978-3-319-46433-6_1","title":"Analytic Solution of Fair Share Scheduling in Layered Queueing Networks","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Parameterized complexity; Scheduling (production processes); Weighted fair queueing; Scalability; Queueing theory; Fair queuing; Round-robin scheduling; Distributed computing; Solver; Proportionally fair; Mean value analysis; Dynamic priority scheduling; Mathematical optimization; Layered queueing network; Algorithm; Computer network; Quality of service; 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.001374329,0.0009202303,0.0008439742,0.0007592562,0.0006492708,0.001683229,0.001610738,0.001175168,0.003035856],"category_scores_gemma":[0.007349207,0.0005731327,0.0006345329,0.000814265,0.001177083,0.001621195,0.001518938,0.001451893,0.0003531461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002395296,"about_ca_system_score_gemma":0.002052379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008771684,"about_ca_topic_score_gemma":0.004561995,"domain_scores_codex":[0.9996071,0.0001414027,0.00001178008,0.00002846028,0.0001311767,0.00008002104],"domain_scores_gemma":[0.9988453,0.0007495855,0.00007527005,0.00005364952,0.0001961305,0.00008001597],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004499804,0.00003165836,0.0002090947,0.00005949408,0.0000196933,0.00003835648,0.00007942244,0.8371884,0.001191008,0.15013,0.001723548,0.009284304],"study_design_scores_gemma":[0.000002907293,0.00000311637,0.00002108789,0.000004868609,0.000002301644,0.000003504384,0.000008149459,0.9767447,0.00006073189,0.02291353,0.0002323639,0.000002756181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02340955,0.001128162,0.9628553,0.0005878248,0.0001603359,0.00004527407,0.00007226845,0.0001861319,0.0115551],"genre_scores_gemma":[0.8608686,0.001956927,0.1210505,0.0001882218,0.0003174043,0.0002080124,0.0001767171,0.0001928402,0.0150407],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008771684,"threshold_uncertainty_score":0.01744127,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01517167482556693,"score_gpt":0.2416346958652756,"score_spread":0.2264630210397087,"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."}}