{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00394359,0.001281008,0.001324801,0.0008000748,0.0008637938,0.001807376,0.004033271,0.001060734,0.004774773],"category_scores_gemma":[0.005396596,0.0008274596,0.001179678,0.001224349,0.0009816614,0.002564876,0.003077855,0.002370549,0.00154562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001749044,"about_ca_system_score_gemma":0.00355843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005109752,"about_ca_topic_score_gemma":0.007833788,"domain_scores_codex":[0.9976054,0.0007917968,0.0001301527,0.0003078085,0.0009085721,0.0002562129],"domain_scores_gemma":[0.9981682,0.000752825,0.0001583105,0.0004754379,0.0002815925,0.0001636328],"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.0001478778,0.000116966,0.0002877502,0.0001654126,0.00007704162,0.000133547,0.0001062579,0.7624013,0.00563335,0.1303591,0.01123693,0.08933448],"study_design_scores_gemma":[0.00002706979,0.00002289665,0.00002799887,0.000005787706,0.000009589514,0.00002211596,0.00001180547,0.9788669,0.0006940089,0.01654094,0.003759058,0.00001187917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008736353,0.00007963831,0.9970173,0.00007041434,0.00003236124,0.00007080678,0.0000556488,0.0009257935,0.0008744505],"genre_scores_gemma":[0.1248036,0.0003452144,0.8710474,0.0001137368,0.0001364234,0.0005333095,0.0003830573,0.000529408,0.002107882],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005109752,"threshold_uncertainty_score":0.02085596,"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."}}