{"id":"W2159682405","doi":"10.1109/glocom.2011.6134134","title":"SHARP: A Scalable Framework for Dynamic Joint Replica Placement and Request Routing Scheduling","year":2011,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Replica; Scalability; Computer science; Scheduling (production processes); Distributed computing; Routing (electronic design automation); Dynamic priority scheduling; Processor scheduling; Computer network; Topology (electrical circuits); Mathematical optimization; Engineering; Resource (disambiguation); Database; Quality of service; Mathematics","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.0004647115,0.0001125674,0.0001389756,0.00005285184,0.0001911246,0.0001546687,0.0002803495,0.00006035875,0.0000150388],"category_scores_gemma":[0.0001182937,0.00009949972,0.00005496714,0.00009737643,0.00002008458,0.0002500352,0.0002540677,0.0001347454,0.00001426594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000396377,"about_ca_system_score_gemma":0.00002643683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001277707,"about_ca_topic_score_gemma":0.00001063034,"domain_scores_codex":[0.9989299,0.00001954865,0.000212567,0.0004467137,0.0001141133,0.0002771812],"domain_scores_gemma":[0.9992397,0.00008205173,0.00007195,0.0004645853,0.0000544728,0.00008719189],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005432491,0.0001771817,0.001283361,0.0000731629,0.00006952643,0.00001383789,0.002723955,0.0001298459,0.004884478,0.955731,0.0002791008,0.03458028],"study_design_scores_gemma":[0.0003746324,0.000193981,0.000624847,0.000202894,0.00001283582,0.00001776066,0.0002542399,0.9699402,0.00132115,0.02662738,0.0001423112,0.000287763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06615544,0.0001253108,0.9304099,0.000413904,0.000223795,0.0002017379,0.000001154674,0.0002295412,0.002239234],"genre_scores_gemma":[0.6360436,0.00000977225,0.3631247,0.0003975933,0.00002320474,0.00002295175,7.923043e-7,0.000006581975,0.0003708428],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9698104,"threshold_uncertainty_score":0.4057481,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05296694082498963,"score_gpt":0.2606959750714447,"score_spread":0.207729034246455,"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."}}