{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001526316,0.0004125231,0.0006746511,0.0009004709,0.000138021,0.0001552749,0.002422373,0.0004331331,0.00001304411],"category_scores_gemma":[0.0001319653,0.0003204505,0.000158988,0.0008642734,0.0004353718,0.0007969482,0.001026139,0.0006419597,0.00001613865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004611203,"about_ca_system_score_gemma":0.0005176037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005401891,"about_ca_topic_score_gemma":0.0001643087,"domain_scores_codex":[0.9964097,0.00005022414,0.0008397732,0.001281726,0.0007524133,0.0006661237],"domain_scores_gemma":[0.997414,0.0004563744,0.0004375636,0.001307648,0.0002729969,0.0001113996],"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.00001138585,0.00003090654,0.004350315,0.0001927147,0.00001389159,0.00003705611,0.000646785,0.4748684,0.0001209452,0.004355026,0.000004487185,0.5153681],"study_design_scores_gemma":[0.0002902865,0.00008773319,0.001431192,0.002335351,0.000003953834,0.00001864022,2.053647e-7,0.972083,0.0002784931,0.02299724,0.00004712218,0.0004268278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001091947,0.0006913661,0.9954184,0.0002879468,0.001435493,0.0003512148,0.000002884066,0.0001118435,0.0006089325],"genre_scores_gemma":[0.9281548,0.00004942049,0.07125003,0.0001606694,0.0003044103,0.000006948028,0.000001932648,0.00001907462,0.00005271297],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9270629,"threshold_uncertainty_score":0.9999248,"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."}}