Achieving Unified Memory for FPGA-Based String Matching
Open Access
- 5 August 2026
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 144-150
Abstract
String matching serves as a critical module for network security systems. To meet escalating network bandwidth demands, recent studies have transitioned to hardware platforms like FPGA, leveraging the parallel processing ability to accelerate string matching. However, existing hardware solutions face a critical challenge in parallel matching of variable-length string patterns. They require length-specific memory blocks, such as separate hash tables to store patterns of different lengths. This distributed memory architecture causes a memory fragmentation issue when patterns are unevenly distributed, which impacts the scalability of prior works. To address the memory fragmentation issue of the distributed memory architecture, this paper proposes (1) a unified memory architecture that enables unified storage of variable-length patterns, and (2) a collision-free hash scheme that supports parallel matching of variable-length strings in the architecture. We implemented the proposed memory-efficient scheme on an FPGA-based prototype. Extensive evaluations demonstrate that the unified memory architecture achieves 4-5× lower memory usage compared to state-of-the-art alternatives while achieving comparable throughput. Meanwhile, the architecture can store patterns across arbitrary length distributions within a specified length range until its maximum capacity.Keywords
Funding Information
- Innovation Research Foundation of National University of Defense Technology (ZK25-14)
- Key Research and Development Project of Jiangsu Province (BE2023004-4)
- science and technology innovation Program of Hunan Province (2024RC3139)
This publication has 13 references indexed in Scilit:
- NetDPI: Efficient Deep Packet Inspection via Filtering-Plus-Verification in Programmable 5G Data Plane for Multi-Access Edge ComputingIEEE Transactions on Mobile Computing, 2024
- Cardinality Estimation Adaptive Cuckoo Filters (CE-ACF): Approximate Membership Check and Distinct Query Count for High-Speed Network MonitoringIEEE/ACM Transactions on Networking, 2023
- Harry: A Scalable SIMD-based Multi-literal Pattern Matching Engine for Deep Packet Inspection2023
- Bolt: Scalable and Cost-Efficient Multistring Pattern Matching With Programmable SwitchesIEEE/ACM Transactions on Networking, 2022
- Fast String Searching on PISA2019
- SilkRoad2017
- A Fast and Accurate Hardware String Matching Module with Bloom FiltersIEEE Transactions on Parallel and Distributed Systems, 2016
- An Efficient Pre-filter to Accelerate Regular Expression Matching2015
- A Pattern-Matching Scheme With High Throughput Performance and Low Memory RequirementIEEE/ACM Transactions on Networking, 2012
- High-Performance Pattern-Matching for Intrusion Detection2006