earticle

논문검색

A Parallel Algorithm of String Matching Based on Message Passing Interface for Multicore Processors

초록

영어

Multicore has long been considered an attractive platform for string matching. However, some existing traditional algorithms of string matching do not adapt to multicore platform, which pose new challenges to parallelism designs. In this paper, we introduce a multicore architecture with message passing interface to address these challenges. We exploit the popular Aho-Corasick algorithm for the string matching engine. Data parallelism is utilized to design optimization technique of string matching. The experiments show that an implementation of the 8-core system achieves up to 10.5 Gbps throughput on the average.

목차

Abstract
 1. Introduction
 2. Related Work and Background
  2.1 Related Work
  2.2 Aho-Corasick Algorithm
  2.3 Data Parallelism
  2.3 Data Parallelism
 3. Parallel Algorithm
 4. Performance Analysis
 5. Conclusions
 Acknowledgement
 References

저자정보

  • Jiaxing Qu Harbin Engineering University, Harbin 150001, China
  • Guoyin Zhang Harbin Engineering University, Harbin 150001, China
  • Zhou Fang Heilongjiang Province Electronic Information Products Supervision Inspection Institute, Harbin 150090, China
  • Jiahui Liu Harbin University of Science and Technology, College of Computer Science and Technology, Harbin 150080, China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.