Pipelined Parallel AC-Based Approach for Multi-String Matching

Lin, Wei; Liu, Bin

doi:10.1109/icpads.2008.47

Cited by 15 publications

(9 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Wei Lin and Bin Liu have presented a study on an improved Aho-Corasick algorithm, which is called P2-AC on SRAM [8]. The authors suggested a pipelined parallel approach on SRAMs.…”

Section: Related Workmentioning

confidence: 99%

Accelerating string matching for bio-computing applications on multi-core CPUs

Herath

Lakmali

Ragel

2012

2012 IEEE 7th International Conference on Industrial and Information Systems (ICIIS)

View full text Add to dashboard Cite

Huge amount of data in the form of strings are being handled in bio-computing applications and searching algorithms are quite frequently used in them. Many methods utilizing on both software and hardware are being proposed to accelerate processing of such data. The typical hardware-based acceleration techniques either require special hardware such as generalpurpose graphics processing units (GPGPUs) or need building a new hardware such as an FPGA based design. On the other hard, software-based acceleration techniques are easier since they only require some changes in the software code or the software architecture. Typical software-based techniques make use of computers connected over a network, also known as a network grid to accelerate the processing. In this paper, we test the hypothesis that multi-core architectures should provide better performance in this kind of computation, but still it would depend on the algorithm selected as well as the programming model being utilized. We present the acceleration of a stringsearching algorithm on a multi-core CPU via a POSIX thread based implementation. Our implementation on an 8-core processor (that supports 16-threads) resulted in 9x throughput improvement compared to a single thread implementation.

show abstract

“…Wei Lin and Bin Liu have presented a study on an improved Aho-Corasick algorithm, which is called P2-AC on SRAM [8]. The authors suggested a pipelined parallel approach on SRAMs.…”

Section: Related Workmentioning

confidence: 99%

Accelerating string matching for bio-computing applications on multi-core CPUs

Herath

Lakmali

Ragel

2012

2012 IEEE 7th International Conference on Industrial and Information Systems (ICIIS)

View full text Add to dashboard Cite

show abstract

“…Other hardware-based architectures also have been proposed using memory and combinatorial logic elements. In [9], the authors proposed a pipelined approach with parallel SRAMs for hardware implementation of the Aho-Corasick algorithm.…”

Section: Introductionmentioning

confidence: 99%

High performance DFA-based string matching

Kim

2010

2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)

View full text Add to dashboard Cite

On communication networks, deep-packet inspection (DPI) techniques are used to handle various requirements, such as network security, network quality-of-service and so on. DPI is a technique to scan packets to detect specific patterns from those packets and to identify those packets according to the scanning result and the purpose of requirements. String matching is a key element of DPI and is especially used for scanning application specific data of packet payload. In this paper, I propose a string matching architecture to process multiple characters at a single cycle and a technique to speed up the string matching process. The evaluation results show that the memory efficiency and the processing speed can be enhanced by the proposed approach, compared to the previous works.

show abstract

“…As a result, the space required for the transitions can be reduced. Pao et al [35] and W. Lin and B. Liu [36] proposed pipeline architectures to implement the partial trie that only contains goto functions of the AC-trie so that it can reduce the space induced by failure functions. N. Hua et al [37] proposed another approach based on a block-oriented scheme instead of usually byte-oriented processing of patterns to reduce the memory usage.…”

Section: Fig 3 Number Of Patterns Vs Relative Instructionsmentioning

confidence: 99%

“…Wei Lin, Bin Liu [30] presented a pipelined parallel approach for hardware implementation of Aho-Corasick (AC) algorithm for multiple strings matching called P2-AC. P2-AC organizes the transition rules in multiple stages and processes in pipeline manner, which significantly simplifies the DFA state transition graph into a character tree that only contains forwarding edges.…”

Section: Aho Corasick Based Approachesmentioning

confidence: 99%

Parallel String Matching Problems with Computing Models An Analysis of the Most Recent Studies

Raju¹,

Rao²,

Raju³

2013

IJCA

View full text Add to dashboard Cite

We survey the current techniques to handle with the problem of parallel string matching with computing models. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational biology. We focus on current developments of parallel string matching, computing models, and the central ideas of the algorithms and their complexities. We present the performance of the different algorithms and their effectiveness. Finally this analysis helps the researchers to develop the better technique.

show abstract

Pipelined Parallel AC-Based Approach for Multi-String Matching

Cited by 15 publications

References 12 publications

Accelerating string matching for bio-computing applications on multi-core CPUs

Accelerating string matching for bio-computing applications on multi-core CPUs

High performance DFA-based string matching

Parallel String Matching Problems with Computing Models An Analysis of the Most Recent Studies

Contact Info

Product

Resources

About