公开(公告)号：GB2511072A

公开(公告)日：2014-08-27

申请号：GB201303130

申请日：2013-02-22

Applicant: IBM

Inventor： ATASU KUBILAY ,  POLIG RAPHAEL ,  REISS FREDERICK RALPH ,  HAGLEITNER CHRISTOPH

IPC: G06F17/11

Abstract: The invention relates to a non-deterministic finite state machine module (1) for use in a regular expression matching system, comprising a computational unit (2) implementing a non-deterministic finite state machine representing a regular expression, wherein the computational unit (2) is configured to receive an input data stream (cur_input), in which the occurrence of the regular expression shall be determined, and an activation signal. The computational unit (2) processes the input data stream (cur_input) with respect to the implemented non-deterministic finite state machine depending on the activation signal and provides branch data outputs for initializing another non-deterministic finite state machine module in case the processing of an element of the input data stream (cur_input) according to the provided non-deterministic finite state machine results in a branching of the processing thread. Also claimed is a routing method for use with a plurality of the modules.