{"id":"W2758109413","doi":"10.1109/iscas.2017.8050818","title":"Scalable memory-less architecture for string matching with FPGAs","year":2017,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Scalability; Parallel computing; Field-programmable gate array; Throughput; String (physics); Memory architecture; Content-addressable memory; Routing table; Routing (electronic design automation); Content-addressable storage; String searching algorithm; Lookup table; Computer hardware; Embedded system; Data structure; Operating system; Routing protocol","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.000133023,0.0003008302,0.0002620759,0.0004845195,0.000294423,0.0005493533,0.001379555,0.0002833782,0.008722839],"category_scores_gemma":[0.000342416,0.0001650239,0.000183975,0.0008110779,0.0001421343,0.001064341,0.0004185197,0.0002832996,0.001178769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005375799,"about_ca_system_score_gemma":0.0004652898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001145452,"about_ca_topic_score_gemma":0.002046175,"domain_scores_codex":[0.9998482,0.00001853428,0.00001307456,0.00002679285,0.00005601503,0.0000372781],"domain_scores_gemma":[0.9998947,0.00002388632,0.0000150918,0.00003289619,0.00002490152,0.000008427488],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0009255898,0.0002004421,0.001895497,0.0005565792,0.00009560637,0.0003699115,0.00008472703,0.0439404,0.1852839,0.02946912,0.01423372,0.7229444],"study_design_scores_gemma":[0.0002803803,0.001446836,0.002893463,0.0001007569,0.0001444199,0.001055621,0.0001229686,0.5780466,0.335627,0.01314018,0.06706537,0.00007651031],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3024662,0.00347393,0.6486462,0.0003990847,0.0003207161,0.0002466715,0.0005136968,0.008086755,0.0358468],"genre_scores_gemma":[0.8062714,0.0005155652,0.183535,0.0001720405,0.00004012988,0.0001046871,0.0005487545,0.00007179672,0.008740606],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008722839,"threshold_uncertainty_score":0.02918082,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01775539484387704,"score_gpt":0.2490131059414327,"score_spread":0.2312577110975556,"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."}}