{"id":"W2314164187","doi":"10.1109/tcc.2016.2543722","title":"A Dynamical and Load-Balanced Flow Scheduling Approach for Big Data Centers in Clouds","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Cloud Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"ca_institutions":"St. Francis Xavier University","funders":"National Key Research and Development Program of China; Science and Technology Commission of Shanghai Municipality; Huawei Technologies; National Natural Science Foundation of China","keywords":"Computer science; Data center; OpenFlow; Distributed computing; Scheduling (production processes); Cloud computing; Load balancing (electrical power); Workload; Weighted round robin; Initialization; Round-robin scheduling; Big data; Dynamic priority scheduling; Polling; Real-time computing; Computer network; Quality of service; Software-defined networking; Mathematical optimization; Data mining","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.0008777986,0.0006649455,0.0006189714,0.0005639091,0.001105177,0.0009263693,0.001363398,0.0005268737,0.0009100444],"category_scores_gemma":[0.001431927,0.0003798414,0.0004367574,0.0006024601,0.0007300263,0.001354327,0.000863092,0.0006862836,0.0001312008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001414243,"about_ca_system_score_gemma":0.00192655,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005193809,"about_ca_topic_score_gemma":0.006680997,"domain_scores_codex":[0.9994822,0.0001439194,0.00002117,0.0001257595,0.0001320803,0.00009482672],"domain_scores_gemma":[0.9994587,0.0001806669,0.00008296516,0.00005201159,0.0001151449,0.0001105537],"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.0001278715,0.0000959636,0.0006833521,0.00004704718,0.00002401979,0.00007223975,0.0001027464,0.9337659,0.006968161,0.02316799,0.001555263,0.03338936],"study_design_scores_gemma":[0.000006472809,0.00001706471,0.00007033766,0.000001251847,0.000002465034,0.00000857252,0.00001395368,0.9957314,0.0003476173,0.003460724,0.0003357654,0.000004289713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02912595,0.000133646,0.9684664,0.000259354,0.00006512605,0.0000576243,0.00004177853,0.000200478,0.001649562],"genre_scores_gemma":[0.8550856,0.000176945,0.1430899,0.0001245251,0.00008222288,0.00008374269,0.0001009464,0.00006917478,0.001186787],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005193809,"threshold_uncertainty_score":0.01032716,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03922473891844563,"score_gpt":0.2590973795326437,"score_spread":0.2198726406141981,"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."}}