{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004148624,0.000152314,0.000164716,0.0000843864,0.0003307032,0.0003711676,0.0002530777,0.00008546908,4.619164e-7],"category_scores_gemma":[0.00069188,0.0001507496,0.00001676944,0.0002661372,0.0001163813,0.001096103,0.0001877882,0.0002061695,0.000002412652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002314899,"about_ca_system_score_gemma":0.00009843474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001431784,"about_ca_topic_score_gemma":0.000006729581,"domain_scores_codex":[0.9988089,0.00003204729,0.0002220937,0.0005094488,0.0001851531,0.0002424129],"domain_scores_gemma":[0.998693,0.0005977979,0.0001477981,0.0002129218,0.0002342658,0.000114164],"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.00009263829,0.0001024492,0.002026216,0.0004272838,0.00003453524,0.00003047868,0.01658688,0.0007785709,0.02007206,0.1256387,0.0001758927,0.8340343],"study_design_scores_gemma":[0.000509233,0.0001365426,0.0005618337,0.00009719137,0.00001014433,0.0001078178,0.002535747,0.99128,0.0005757005,0.0006191276,0.003311586,0.0002550274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3648779,0.0006320067,0.6321662,0.001475107,0.0003559668,0.0002095449,0.000001601485,0.000202221,0.00007949294],"genre_scores_gemma":[0.7458274,0.00002069637,0.2537517,0.0002966832,0.00002036424,0.00007242053,0.000001467026,0.00000461588,0.000004677342],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9905015,"threshold_uncertainty_score":0.6147391,"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."}}