{"id":"W2096194041","doi":"10.1109/iscc.2012.6249373","title":"Load balancing with minimal flow remapping for network processors","year":2012,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Router; Packet processing; Network packet; Hash function; Workload; Computer network; Load balancing (electrical power); Processing delay; Distributed computing; Parallel computing; Operating system; Transmission delay","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.0004978311,0.0001197848,0.0001256776,0.00002507293,0.0002265337,0.0001534231,0.0002664971,0.00004699723,0.000004853114],"category_scores_gemma":[0.00003053025,0.00008976513,0.00002600029,0.0004346243,0.00001805753,0.0008664183,0.00005185063,0.00005994405,0.000008189129],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004036308,"about_ca_system_score_gemma":0.000107596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001784676,"about_ca_topic_score_gemma":0.000006815987,"domain_scores_codex":[0.9988861,0.0000162709,0.0001468652,0.0002338253,0.0001978943,0.0005190235],"domain_scores_gemma":[0.9993765,0.00007299671,0.00008375308,0.0002018617,0.0001618239,0.000103085],"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.000206236,0.0002711632,0.0347965,0.0005550907,0.0001185477,0.000004494386,0.008514708,0.604358,0.000110581,0.03580103,0.05714938,0.2581143],"study_design_scores_gemma":[0.0003624224,0.00007574262,0.0003316887,0.0001157793,0.00001000839,0.00001629167,0.00003653995,0.9909143,0.0002708753,0.0004623878,0.00716815,0.0002358042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001596741,0.0003941598,0.9907072,0.0002963438,0.0002733501,0.0001615486,1.75055e-7,0.0002580734,0.006312433],"genre_scores_gemma":[0.2957283,0.000004289966,0.7024885,0.0003386363,0.0005825107,0.00002890766,0.000002344671,0.0000109341,0.0008156431],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3865563,"threshold_uncertainty_score":0.3660516,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01235588497026915,"score_gpt":0.2266134984612152,"score_spread":0.214257613490946,"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."}}