{"id":"W6892295760","doi":"10.5167/uzh-120510","title":"Workload Scheduling in Distributed Stream Processors using Graph Partitioning","year":2015,"lang":"en","type":"article","venue":"Zurich Open Repository and Archive (University of Zurich)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Graph partition; Workload; Scheduling (production processes); Implementation; Stream processing; Network topology; Graph; Space partitioning; Server; Distributed algorithm","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000729015,0.0001347095,0.0002381644,0.0001964969,0.0004171514,0.0001439228,0.0009019464,0.00004996302,0.000002676179],"category_scores_gemma":[0.00003120147,0.0001555279,0.00005045588,0.000713616,0.0001832209,0.001241735,0.0007577193,0.0001762302,0.000001839834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002803943,"about_ca_system_score_gemma":0.0001130152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003635604,"about_ca_topic_score_gemma":0.00003864281,"domain_scores_codex":[0.9986188,0.0003983315,0.0001625571,0.0003989862,0.0001772176,0.0002441164],"domain_scores_gemma":[0.9991269,0.0001563133,0.0001780532,0.0002651793,0.00008510114,0.0001884856],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001510203,0.003271616,0.5181924,0.0005785594,0.0006976764,0.003834168,0.08140489,0.1210264,0.02188811,0.2138048,0.001474716,0.03231644],"study_design_scores_gemma":[0.008940471,0.001117777,0.1336623,0.002244062,0.0002065654,0.0004918873,0.03221773,0.4911817,0.005915579,0.3202547,0.001437442,0.002329769],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6438993,0.0001635733,0.3540417,0.00005960464,0.00008253915,0.0001611631,0.000008205188,0.00003484894,0.001549087],"genre_scores_gemma":[0.9092533,0.00001750632,0.09061601,0.00001396495,0.0000163555,5.48093e-7,0.000007054799,0.000005002243,0.00007023753],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3845301,"threshold_uncertainty_score":0.6342246,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0265456552811856,"score_gpt":0.2284412648841046,"score_spread":0.201895609602919,"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."}}