{"id":"W2766857375","doi":"10.1109/access.2017.2767703","title":"On-Demand Capacity Provisioning in Storage Clusters Through Workload Pattern Modeling","year":2017,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Provisioning; Computer science; Distributed computing; Quality of service; Workload; Queueing theory; Capacity planning; Resource (disambiguation); Computer network; Resource allocation; Energy consumption; Variety (cybernetics); Operating system","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.001233782,0.0007055518,0.0005831148,0.0005235162,0.0004674617,0.001207564,0.001467509,0.0007058605,0.000577891],"category_scores_gemma":[0.0034093,0.0003970764,0.0004780789,0.000660926,0.0004126236,0.001190621,0.0006252233,0.0005394413,0.000114842],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001659258,"about_ca_system_score_gemma":0.001397614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01281688,"about_ca_topic_score_gemma":0.007518572,"domain_scores_codex":[0.99919,0.000228791,0.0000463126,0.0001727783,0.0002105423,0.0001514291],"domain_scores_gemma":[0.9986026,0.0006552414,0.0001806898,0.0001537237,0.0002875332,0.0001203386],"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.00006091034,0.00004319733,0.001464751,0.00002086688,0.00001390855,0.00004521364,0.00005545748,0.9832659,0.00260189,0.003090292,0.0003424924,0.008995155],"study_design_scores_gemma":[7.963738e-7,0.000003420048,0.00007164853,4.251793e-7,9.738606e-7,0.0000028949,0.000004647576,0.9994018,0.0001498775,0.0003307943,0.00003150132,0.000001155348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3406284,0.0003504697,0.654318,0.0004959405,0.00005991654,0.000166521,0.0002150633,0.0008726539,0.002892987],"genre_scores_gemma":[0.9806907,0.000123328,0.01840431,0.00003659153,0.00001387769,0.00004432137,0.00008242026,0.00002857512,0.0005759645],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01281688,"threshold_uncertainty_score":0.02548456,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06248843316803498,"score_gpt":0.3097510564840926,"score_spread":0.2472626233160576,"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."}}