A Parallel String Searching Algorithm for Information Filtering

作     者：Jin Shu(1),Liu Fengyu(2)(1.NAEG System Integration Engineering Co.Ltd,Nanjing,210003,P.R.China 2.Nanjing University of Science & Technology,Computer Science Department,210094,P.R.China) 

出 版 物：《工程科学（英文版）》 (Engineering Sciences)

年 卷 期：2007年第5卷第3期

页      面：82-90,100页

学科分类：08[工学] 081202[工学-计算机软件与理论] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：This work is supported by National Science Foundatinon Grant60273035"Software Performance Assure and Recovery" 

主　　题：String Searching Information Filtering Parallel Algorithm PBM Algorithm 

摘      要：Playing an increasingly important role in the security protection of the network information systems,the intrusion detection system(IDS) becomes a hotspot of research interest ***,this technology in the kernel to many of these systems,namely string searching algorithm,has not received enough *** utilizing the concurrent mechanisms(multi-threading) provided by modern operation systems,such work can be divided symmetrically and thus improve the throughput of the corresponding application *** in this work is a paralleled string searching algorithm-PBM,an algorithm based on the famous Boyer-Moore(BM) string searching *** as a dividable process,the string searching work is distributed between many cooperating threads of execution in the PBM algorithm,while each of them searches the target pattern in their respective share of the target *** compared with the traditional string searching algorithms,the PBM algorithm can do the pattern matching work faster by increasing the data processing throughput,thus adapting better to the drastic increase in the network band width.A simplification of the PBM algorithm that can be used as a multi-string searching algorithm is also suggested with supporting simulations,which is a promising approach when the number of target patterns is limited.