Presentation is loading. Please wait.

Presentation is loading. Please wait.

Design of High Performance Pattern Matching Engine Through Compact Deterministic Finite Automata Department of Computer Science and Information Engineering.

Similar presentations


Presentation on theme: "Design of High Performance Pattern Matching Engine Through Compact Deterministic Finite Automata Department of Computer Science and Information Engineering."— Presentation transcript:

1 Design of High Performance Pattern Matching Engine Through Compact Deterministic Finite Automata Department of Computer Science and Information Engineering National Cheng Kung University, Taiwan R.O.C. Authors: Piyachon, P. Yan Luo Publisher: DAC 2008 45th ACM, June 8-13, 2008, Anaheim, California, USA. Present: Chia-Ming,Chuang Date: 11, 26, 2008 1

2 Outline 1. Introduction 2. Proposed schemes 3. Architecture 4. Experiments 5. Conclusion 2

3 Introduction (1/5) 3

4 Introduction (2/5) 4 bit DFA 3bit DFA 2bit DFA 1bit DFA 0 h01101000 i01101001 s01110011 e01100101 r01110010 m01101101 a01100001 n01101110 l01101100 d01100100 y01111001

5 5 Introduction (3/5)

6 Introduction (4/5) 6 Implementation Issues: The bit-DFA method requires thousands of processing elements to implement thousands of bit-DFA, which is not practical under today’s silicontechnology. Memory Wastage: Since introduced in 2005, the bit-DFA method has not been put into its limitation to give optimal memory efficiency.

7 Introduction (5/5) 7

8 Outline 1. Introduction 2. Proposed schemes 3. Architecture 4. Experiments 5. Conclusion 7

9 Proposed schemes (1/7) 8

10 Proposed schemes (2/7) 9 ( 一 ) We design two schemes to determine the matched patterns: LTT for common output states, and CLT for unique ones. ( 一 ) the state ξ3,0 is a common output state and, π0,0∩π1,0∩π2,0∩π3,0 = {p0}.

11 Proposed schemes (3/7) 10

12 Proposed schemes (4/7) 11

13 Proposed schemes (5/7) 12

14 Proposed schemes (6/7) 13

15 Proposed schemes (7/7) 14

16 Outline 1. Introduction 2. Proposed schemes 3. Architecture 4. Experiments 5. Conclusion 15

17 Architecture (1/3) 16

18 Architecture (2/3) 17

19 Architecture (3/3) 18

20 Outline 1. Introduction 2. Proposed schemes 3. Architecture 4. Experiments 5. Conclusion 19

21 Experiments (1/1) 20

22 Outline 1. Introduction 2. Proposed schemes 3. Architecture 4. Experiments 5. Conclusion 21

23 Conclusion (1/1) ( ㄧ ) We proposed using Label Translation Table and CAM-based Lookup Table methods to tackle the problems. The proposed schemes reduces the usage by up to 85% ( 二 ) We present the architecture that realizes our proposed methods. The architecture suits for both ASIC and FPGA implementation as well as multi-core system 22


Download ppt "Design of High Performance Pattern Matching Engine Through Compact Deterministic Finite Automata Department of Computer Science and Information Engineering."

Similar presentations


Ads by Google