{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001291668,0.0001496025,0.0001404493,0.0001856565,0.0004559018,0.00007598549,0.0007884345,0.00005402869,0.0001640519],"category_scores_gemma":[0.000008443783,0.0001443584,0.0001160714,0.0003465543,0.00006192013,0.0003877686,0.00002159741,0.0001420108,0.0001451241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005705742,"about_ca_system_score_gemma":0.00003778173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001033182,"about_ca_topic_score_gemma":0.000005150878,"domain_scores_codex":[0.9987954,0.00002888553,0.0001909984,0.0004010545,0.0002859655,0.0002976547],"domain_scores_gemma":[0.9989566,0.00012089,0.00003638867,0.0006467311,0.0001199345,0.000119506],"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.00006404904,0.001634336,0.00001149177,0.0001149779,0.0003563587,0.00007645862,0.004435445,0.03037333,0.0001513383,0.04859621,0.00363962,0.9105464],"study_design_scores_gemma":[0.01105495,0.002435775,0.004647695,0.0002641841,0.0001133488,0.0002766157,0.001703967,0.7360203,0.01593788,0.01868574,0.2063569,0.002502691],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007753287,0.00002427013,0.9905444,0.002332831,0.000336561,0.0005750231,0.00002915686,0.0002645061,0.005815665],"genre_scores_gemma":[0.05341591,0.0002802576,0.9352186,0.001085756,0.00005489301,0.0004343012,0.00001562317,0.00002653974,0.009468148],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9080437,"threshold_uncertainty_score":0.5886765,"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."}}