{"id":"W4229577914","doi":"10.1002/cpe.1578","title":"A scheduling and load balancing scheme for dynamic P2P‐based system","year":2010,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Distributed computing; Load balancing (electrical power); Scheduling (production processes); Dynamic priority scheduling; Round-robin scheduling; Fair-share scheduling; Peer-to-peer; Computer network; Quality of service; Engineering","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.001050645,0.0006018752,0.0007616621,0.0009932631,0.001862202,0.001196751,0.001838039,0.0008270473,0.001790596],"category_scores_gemma":[0.001859373,0.0002307662,0.0002741599,0.0009972887,0.0006261485,0.00133787,0.001376205,0.0007362966,0.0006035704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009474959,"about_ca_system_score_gemma":0.001119428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001723615,"about_ca_topic_score_gemma":0.001340257,"domain_scores_codex":[0.9990778,0.00021507,0.00007573015,0.0002120694,0.0003054924,0.0001138658],"domain_scores_gemma":[0.9989449,0.0001864705,0.0001159003,0.0002765951,0.0003186834,0.0001574487],"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.001326274,0.0007602984,0.002255011,0.000297603,0.0001523393,0.000909679,0.0007648838,0.3452358,0.1583966,0.06188435,0.02238685,0.4056304],"study_design_scores_gemma":[0.00007945251,0.0001395639,0.000352169,0.000006606589,0.00002451918,0.000188385,0.0000574454,0.9736018,0.0102736,0.007280102,0.007964355,0.00003200473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09739077,0.0004094249,0.8888741,0.0005711091,0.0003555628,0.0003349237,0.0001044224,0.003918037,0.008041739],"genre_scores_gemma":[0.8916141,0.0001303476,0.1046445,0.0001265559,0.0001493432,0.0001873685,0.0001570965,0.00009841211,0.002892212],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001862202,"threshold_uncertainty_score":0.006874561,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01405767295905278,"score_gpt":0.3138966739778166,"score_spread":0.2998390010187638,"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."}}