{"id":"W2043006334","doi":"10.1145/1071021.1071038","title":"Solving layered queueing networks of large client-server systems with symmetric replication","year":2005,"lang":"en","type":"article","venue":"","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Queueing theory; Layered queueing network; Solver; Distributed computing; Workload; Exploit; Replication (statistics); Mean value analysis; Markov process; Mathematical optimization; Parallel computing; Computer network; Mathematics; Operating system","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low","status":"direct model label, unvalidated"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"other","about_ca_system":false,"about_ca_topic":false,"confidence":"high","status":"direct model label, unvalidated"}],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001142366,0.0001160982,0.0002142293,0.0001311141,0.0001069162,0.00007775389,0.00050588,0.00008379182,0.000007811504],"category_scores_gemma":[0.00002775141,0.00007980521,0.0000510061,0.0008114526,0.00001861624,0.0006764375,0.0001305553,0.00009952101,0.00002832988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008190447,"about_ca_system_score_gemma":0.00004578567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001716564,"about_ca_topic_score_gemma":0.00003179477,"domain_scores_codex":[0.9984975,0.00006736474,0.00041592,0.0004242164,0.0003028926,0.000292056],"domain_scores_gemma":[0.9982426,0.00009663915,0.0002216304,0.001178936,0.0001949023,0.00006525403],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005061893,0.0006172713,0.5722512,0.0007082595,0.0001456984,0.000005156983,0.001501782,0.1862846,0.0003037738,0.1537857,0.001990823,0.08235508],"study_design_scores_gemma":[0.0004304817,0.00008954082,0.0342315,0.0001136056,0.000006337203,0.00001622904,0.00005950554,0.9619349,0.0005688337,0.00001421344,0.002363468,0.0001714501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1775958,0.0005571567,0.8185332,0.0001223515,0.0002090924,0.0003125583,4.952274e-7,0.0002499241,0.002419462],"genre_scores_gemma":[0.9896656,0.00001839811,0.009803632,0.00008008246,0.0001176336,0.00002292781,0.000001954393,0.000007927614,0.0002818507],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8120698,"threshold_uncertainty_score":0.3254362,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009971847590710015,"score_gpt":0.239494039819977,"score_spread":0.229522192229267,"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."}}