{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008820695,0.0002716017,0.0003093304,0.0001854215,0.0003180077,0.0001490921,0.001255017,0.00009051189,7.920087e-7],"category_scores_gemma":[0.00002014219,0.0002178839,0.00009245009,0.0004434285,0.00008312439,0.00005137548,0.00008082804,0.0002554156,0.000004753177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001680054,"about_ca_system_score_gemma":0.00006933731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004140653,"about_ca_topic_score_gemma":0.0000148691,"domain_scores_codex":[0.9974672,0.0001100401,0.0004407938,0.00106593,0.0003348933,0.0005811067],"domain_scores_gemma":[0.9981837,0.0004774408,0.0001111417,0.001038368,0.00005511793,0.0001342241],"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.0000504124,0.0002982317,0.0001639764,0.00006535622,0.00006799695,0.000006183635,0.0004953936,0.3283821,0.000420335,0.0003866929,0.00006510708,0.6695982],"study_design_scores_gemma":[0.001787589,0.00008575974,0.0001255008,0.0002054109,0.00001501455,0.00001410112,0.00007368724,0.9966601,0.0002674336,0.0002099883,0.0002532729,0.000302103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.127207,0.0000370309,0.8696364,0.0007635813,0.00163643,0.0003629808,0.00001706977,0.0002324373,0.0001070726],"genre_scores_gemma":[0.8703155,0.000004305908,0.129065,0.0001615909,0.0003368819,0.00001264531,0.000002762269,0.00002227164,0.00007903772],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7431085,"threshold_uncertainty_score":0.8885047,"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."}}