{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005621993,0.00009790504,0.0001055061,0.00003918582,0.0001641479,0.0002739761,0.0005081455,0.00003190733,0.000001676394],"category_scores_gemma":[0.00002900158,0.00006088008,0.0000251265,0.0001342157,0.00002455405,0.0003684097,0.0003170232,0.0001679347,0.000004655887],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002442175,"about_ca_system_score_gemma":0.00001280429,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001543769,"about_ca_topic_score_gemma":0.0008089958,"domain_scores_codex":[0.9991438,0.000119627,0.000147022,0.0002729704,0.000134333,0.0001822032],"domain_scores_gemma":[0.9993346,0.0001971412,0.00004604537,0.0003578652,0.00002079205,0.0000435375],"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.00008367191,0.0003491089,0.05650171,0.0003433622,0.00009701843,0.0000961613,0.01507319,0.05166083,0.0092319,0.0932252,0.0004133876,0.7729245],"study_design_scores_gemma":[0.000221683,0.000019479,0.01114384,0.00005687817,0.00000299272,0.00000837444,0.0002173709,0.9873456,0.00002376241,0.0007566094,0.00009893576,0.000104509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6158412,0.0001836504,0.3794617,0.002975116,0.0001771967,0.0001266568,0.000001564256,0.0001504143,0.001082508],"genre_scores_gemma":[0.9967147,0.00001329695,0.002615026,0.000482159,0.00001734176,0.000007069509,0.000004867031,0.000004522336,0.0001410532],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9356847,"threshold_uncertainty_score":0.2641958,"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."}}