{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006973709,0.0005845638,0.0004530246,0.0008639338,0.0006816322,0.0008405332,0.0008744276,0.0004320236,0.0009222549],"category_scores_gemma":[0.001883706,0.0003357796,0.0004223488,0.0009338408,0.0004974183,0.0008208131,0.0006701963,0.0003673928,0.0002324853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001195506,"about_ca_system_score_gemma":0.001249105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006826955,"about_ca_topic_score_gemma":0.007498658,"domain_scores_codex":[0.9995816,0.000150518,0.00002088623,0.00007730754,0.000117834,0.00005185602],"domain_scores_gemma":[0.9990475,0.0004873697,0.00008486619,0.0001170914,0.0001829503,0.00008026606],"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.000185212,0.0001044089,0.001667291,0.00009756497,0.00003956632,0.0001061207,0.0001984628,0.8914217,0.01735288,0.0100876,0.002699278,0.07603992],"study_design_scores_gemma":[0.00001511577,0.00001822964,0.0001872784,0.000002443216,0.000003695267,0.00001202763,0.00002643891,0.9916015,0.002139777,0.005427763,0.0005617914,0.000003909898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1196503,0.0002160837,0.8755379,0.0002487597,0.00004904432,0.0001700609,0.0001335629,0.001687125,0.002306935],"genre_scores_gemma":[0.5801044,0.0001948401,0.4170331,0.00008640997,0.0000304443,0.0001555113,0.0004333334,0.0003145971,0.001647431],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006826955,"threshold_uncertainty_score":0.01357448,"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."}}