Parallelization of String Matching Algorithm with Compaction of DFA
Author:
Joshi Apurva,Shah Tanvi
Publisher
Springer Singapore
Reference11 articles.
1. V. Aho and Margaret J. Corasick, Efficient String Matching: An Aid to Bibliographic Search, communications of the ACM June 1975, Volume 18 Number 6. 2. Anat Bremler-Barr, Member, IEEE, David Hay, Member, IEEE, and Yaron Koral, Student Member, IEEE, CompactDFA: Scalable Pattern Matching Using Longest Pre x Match Solutions, IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 22, NO. 2, APRIL 2014. 3. Sang Kyun Yun Dept. of Comput. Telecommun. Eng., Yonsei Univ., Wonju, South Korea, An Efficient TCAM-Based Implementation of Multipattern Matching using Covered State Encoding, IEEE TRANSACTIONS ON COMPUTERS, VOL. 61, NO. 2, FEBRUARY 2012. 4. M. Becchi and P. Crowley, An improved algorithm to accelerate regular expression evaluation, in Proc. ACM/IEEE ANCS, 2007, pp. 145–154. 5. A. Bremler-Barr, D. Hay, and Y. Koral, CompactDFA: Generic state machine compression for scalable pattern matching, in Proc. IEEE INFOCOM, 2010, pp. 657–667.
|
|