{"id":"W2091457418","doi":"10.1109/iwqos.2014.6914303","title":"Optimize the dynamic provisioning and request dispatching in distributed memory cache services","year":2014,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Provisioning; Server; Dynamic programming; Cache algorithms; Cache invalidation; Distributed computing; Key (lock); Optimization problem; Minification; CPU cache; Computer network; Operating system; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"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.0005878309,0.0005826748,0.0006706346,0.0003113122,0.0004024566,0.0007370794,0.0007759036,0.00073231,0.0009388555],"category_scores_gemma":[0.001854097,0.0002911296,0.0002553867,0.0006887909,0.0003787099,0.0007961345,0.0005084494,0.00043157,0.0001545215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001210831,"about_ca_system_score_gemma":0.001613821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008715108,"about_ca_topic_score_gemma":0.00772108,"domain_scores_codex":[0.9997424,0.00008412005,0.00000939527,0.0000468128,0.00004505916,0.00007217731],"domain_scores_gemma":[0.9994814,0.0003357526,0.00005787908,0.0000275071,0.00006735691,0.00003019515],"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.00006064588,0.00004418503,0.0003990975,0.0000366805,0.00001003452,0.00002220867,0.00001885081,0.9812421,0.001807895,0.003301426,0.0004669788,0.01259003],"study_design_scores_gemma":[0.00000447935,0.000009018589,0.00004513743,5.789209e-7,0.000001761528,0.000003316039,0.000003712888,0.9987827,0.0002950396,0.0007886773,0.00006448433,0.000001062964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2383281,0.0005563518,0.7552911,0.0004826892,0.00003256574,0.000101483,0.0001439203,0.0005664763,0.004497461],"genre_scores_gemma":[0.9302291,0.0001391124,0.06802414,0.00003641148,0.0000120125,0.00006520208,0.00007504963,0.00005326726,0.001365695],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008715108,"threshold_uncertainty_score":0.01732874,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00430309064737642,"score_gpt":0.2022920935557911,"score_spread":0.1979890029084146,"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."}}