{"id":"W2033661244","doi":"10.1145/1435375.1435378","title":"Competitive buffer management for shared-memory switches","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Competitive analysis; Computer science; Network packet; Queue; Buffer (optical fiber); Preemption; Constraint (computer-aided design); Partition (number theory); Upper and lower bounds; Online algorithm; Computer network; Operating system; Algorithm; Mathematics; Telecommunications","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.002236376,0.0009498781,0.001166055,0.0005744362,0.001241649,0.002718298,0.002557843,0.001421596,0.002637052],"category_scores_gemma":[0.008652984,0.0003608994,0.0004326166,0.0009325875,0.00105002,0.003019158,0.001482131,0.001064319,0.0002029214],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002609428,"about_ca_system_score_gemma":0.002015634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003943108,"about_ca_topic_score_gemma":0.002847214,"domain_scores_codex":[0.9982565,0.0005235859,0.00005281372,0.0002253058,0.0004539269,0.0004878984],"domain_scores_gemma":[0.9953843,0.002881152,0.0004614141,0.0002352391,0.0005267342,0.0005111643],"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.0006853698,0.0003830225,0.001552652,0.0002080985,0.00009141079,0.0002495737,0.0001837994,0.7520374,0.008198553,0.2007369,0.003184053,0.03248922],"study_design_scores_gemma":[0.00004006009,0.00007732138,0.0001300256,0.000004627004,0.00001258508,0.00004195236,0.00002850388,0.971644,0.001107456,0.02632779,0.0005779827,0.000007633879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4262123,0.002061586,0.5533981,0.001324693,0.00020175,0.0001945095,0.0001589188,0.0003981051,0.01605002],"genre_scores_gemma":[0.9765733,0.0002768238,0.02159705,0.0001074837,0.00006705229,0.00005514771,0.00004413908,0.00002269443,0.001256254],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003943108,"threshold_uncertainty_score":0.01893282,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03958810005221866,"score_gpt":0.2723584283068775,"score_spread":0.2327703282546588,"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."}}