-
公开(公告)号：US07734091B2
公开(公告)日：2010-06-08
申请号：US12062273
申请日：2008-04-03
申请人： Jan Van Lunteren
发明人： Jan Van Lunteren
CPC分类号： G06F17/30985 , Y10S707/99936
摘要： An XML parsing system includes a pattern-matching system 1 that receives an input stream 2 of characters corresponding to the XML document to be parsed, and provides an output 3 for subsequent processing in software by a processor 4. The pattern matching system 1 includes two main components, a controller in the form of a programmable state machine 5, which is programmed with an appropriate state transition diagram 6, and a character processing unit 7 in the form of a token and character handler. The programmable state machine 5 controls the character processing unit 7 to, e.g., compare characters in the input character stream 2 with other received or stored characters. The character processing unit 7 then provides feedback to the programmable state machine controller 5, e.g., as to whether the compared characters match, so that the programmable state machine controller 5 can then parse the received document accordingly.
摘要翻译： XML解析系统包括模式匹配系统1，其接收与要解析的XML文档相对应的字符的输入流2，并且通过处理器4提供用于后续处理的输出3。模式匹配系统1包括两个 主要组件，以可编程状态机5的形式的控制器，其由适当的状态转换图6编程，以及以令牌和字符处理器的形式的字符处理单元7。 可编程状态机5控制字符处理单元7，例如将输入字符流2中的字符与其他接收或存储的字符进行比较。 字符处理单元7然后向可编程状态机控制器5提供例如关于所比较的字符是否匹配的反馈，使得可编程状态机控制器5然后可以相应地解析所接收的文档。
-
公开(公告)号：US20080184105A1
公开(公告)日：2008-07-31
申请号：US12059913
申请日：2008-03-31
IPC分类号： G06F17/27
CPC分类号： G06F17/2247 , G06F17/2725
摘要： A data processing method comprises receiving an electronically parseable document, scanning the document according to at least one predefined rule to determine if the document is suspicious, and, if the document is determined not to be suspicious, parsing the document with a first parser, and, if the document is determined to be suspicious, parsing the document with a second parser.
摘要翻译： 数据处理方法包括接收电子可解析文档，根据至少一个预定义规则扫描文档以确定文档是否可疑，以及如果文档被确定为不可疑，则用第一解析器解析文档，以及 如果文档被确定为可疑，则使用第二个解析器解析文档。
-
33.发明授权Method and system for converting ranges into overlapping prefixes for a longest prefix match 失效将范围转换为重叠前缀的方法和系统，用于最长前缀匹配公开(公告)号：US07177313B2
公开(公告)日：2007-02-13
申请号：US10155566
申请日：2002-05-23
IPC分类号： H04L12/28
CPC分类号： H04L45/00 , H04L45/04 , H04L45/30 , H04L45/54 , H04L63/0227 , H04L63/0236 , H04L63/0263
摘要： A method and system for converting a plurality of ranges of values for a plurality of packet classification rules in a computer system is disclosed. The plurality of ranges exists in at least one dimension. The method and system include mapping each of the plurality of ranges to a plurality of nonoverlapping prefixes. The method and system also include mapping the plurality of nonoverlapping prefixes to a plurality of overlapping prefixes corresponding to the plurality of ranges. The plurality of overlapping prefixes include a plurality of shorter matching overlapping prefixes for a plurality of nonconflicting ranges.
摘要翻译： 公开了一种用于在计算机系统中转换多个分组分类规则的多个值范围的方法和系统。 多个范围存在于至少一个维度中。 该方法和系统包括将多个范围中的每一个映射到多个不重叠前缀。 所述方法和系统还包括将所述多个非重叠前缀映射到对应于所述多个范围的多个重叠前缀。 多个重叠前缀包括用于多个非冲突范围的多个较短的匹配重叠前缀。
-
34.发明授权Compiling pattern contexts to scan lanes under instruction execution constraints 有权编译模式上下文以在指令执行约束下扫描通道公开(公告)号：US09246928B2
公开(公告)日：2016-01-26
申请号：US13098772
申请日：2011-05-02
CPC分类号： H04L63/1408
摘要： A technique for determining scan lanes is provided. For a set of patterns, a number of scan lanes is estimated to be utilized on an accelerator. The number of the scan lanes estimated for the set of patterns is iteratively incremented to optimize a throughput of the accelerator. The set of patterns is distributed to the number of the scan lanes as a distribution, and each one of the scan lanes has a predetermined number of engines. A size of a memory space is evaluated that is needed for the distribution to distribute the set of patterns onto the number of scan lanes.
摘要翻译： 提供了一种用于确定扫描通道的技术。 对于一组模式，估计在加速器上使用多个扫描通道。 针对该组模式估计的扫描通道的数量被迭代地增加以优化加速器的吞吐量。 该组图案被分配到扫描通道的数量作为分布，并且每个扫描通道具有预定数量的引擎。 评估存储器空间的大小，以便将该组图案分配到扫描通道数上。
-
公开(公告)号：US08983891B2
公开(公告)日：2015-03-17
申请号：US13022881
申请日：2011-02-08
IPC分类号： G06N5/02
CPC分类号： G06N5/025
摘要： A pattern matching accelerator (PMA) for assisting software threads to find the presence and location of strings in an input data stream that match a given pattern. The patterns are defined using regular expressions that are compiled into a data structure comprised of rules subsequently processed by the PMA. The patterns to be searched in the input stream are defined by the user as a set of regular expressions. The patterns to be searched are grouped in pattern context sets. The sets of regular expressions which define the pattern context sets are compiled to generate a rules structure used by the PMA hardware. The rules are compiled before search run time and stored in main memory, in rule cache memory within the PMA or a combination thereof. For each input character, the PMA executes the search and returns the search results.
摘要翻译： 模式匹配加速器（PMA），用于帮助软件线程查找匹配给定模式的输入数据流中字符串的存在和位置。 使用正则表达式定义模式，该正则表达式被编译成由PMA随后处理的规则组成的数据结构。 在输入流中要搜索的模式由用户定义为一组正则表达式。 要搜索的模式分组在模式上下文集中。 编译定义模式上下文集的正则表达式集合，以生成PMA硬件使用的规则结构。 该规则在搜索运行时间之前被编译并存储在主存储器中，在PMA内的规则高速缓冲存储器中或其组合中。 对于每个输入字符，PMA执行搜索并返回搜索结果。
-
36.发明授权Software and hardware managed dual rule bank cache for use in a pattern matching accelerator 有权软件和硬件管理的双规则库缓存用于模式匹配加速器公开(公告)号：US08966182B2
公开(公告)日：2015-02-24
申请号：US13023058
申请日：2011-02-08
CPC分类号： G06F17/30985
摘要： A pattern matching accelerator (PMA) for assisting software threads to find the presence and location of strings in an input data stream that match a given pattern. The patterns are defined using regular expressions that are compiled into a data structure comprised of rules subsequently processed by the PMA. The patterns to be searched in the input stream are defined by the user as a set of regular expressions. The patterns to be searched are grouped in pattern context sets. The sets of regular expressions which define the pattern context sets are compiled to generate a rules structure used by the PMA hardware. The rules are compiled before search run time and stored in main memory, in rule cache memory within the PMA or a combination thereof. For each input character, the PMA executes the search and returns the search results.
摘要翻译： 模式匹配加速器（PMA），用于帮助软件线程查找匹配给定模式的输入数据流中字符串的存在和位置。 使用正则表达式定义模式，该正则表达式被编译成由PMA随后处理的规则组成的数据结构。 在输入流中要搜索的模式由用户定义为一组正则表达式。 要搜索的模式分组在模式上下文集中。 编译定义模式上下文集的正则表达式集合，以生成PMA硬件使用的规则结构。 该规则在搜索运行时间之前被编译并存储在主存储器中，在PMA内的规则高速缓冲存储器中或其组合中。 对于每个输入字符，PMA执行搜索并返回搜索结果。
-
37.发明申请Determination and Handling of Subexpression Overlaps in Regular Expression Decompositions 失效正则表达式分解中子表达式重叠的确定和处理公开(公告)号：US20130262493A1
公开(公告)日：2013-10-03
申请号：US13571431
申请日：2012-08-10
IPC分类号： G06F17/30
CPC分类号： G06F17/30985
摘要： A computer program product comprising a computer readable storage medium containing computer code that, when executed by a computer, implements a method for transforming a finite state automaton (FSA) of a regular expression, wherein the method includes determining, by a computer, a first subexpression R1 and a second subexpression R2 in the regular expression; calculating an overlap FSA, the overlap FSA configured to determine the existence of a partial overlap or a full overlap between the first subexpression R1 and the second subexpression R2; determining whether the overlap FSA has an accepting state; and in the event the overlap FSA is determined not to have an accepting state, determining that the transformation of the regular expression is safe, and constructing a transformed FSA of the regular expression comprising a first FSA for the first subexpression R1 and a second FSA for the second subexpression R2.
摘要翻译： 一种计算机程序产品，包括包含计算机代码的计算机可读存储介质，所述计算机代码当由计算机执行时实现用于转换正则表达式的有限状态自动机（FSA）的方法，其中所述方法包括由计算机确定第一 正则表达式中的子表达式R1和第二子表达式R2; 计算重叠FSA，配置为确定第一子表达式R1和第二子表达式R2之间的部分重叠或全部重叠的存在的重叠FSA; 确定重叠FSA是否具有接受状态; 并且在重叠FSA被确定为不具有接受状态的情况下，确定正则表达式的变换是安全的，并且构建包括用于第一子表达式R1的第一FSA和第二FSA的正则表达式的变换FSA， 第二个子表达式R2。
-
公开(公告)号：US08478736B2
公开(公告)日：2013-07-02
申请号：US13022850
申请日：2011-02-08
IPC分类号： G06F17/30
CPC分类号： G06F17/30985 , G06K9/00986
摘要： A pattern matching accelerator (PMA) for assisting software threads to find the presence and location of strings in an input data stream that match a given pattern. The patterns are defined using regular expressions that are compiled into a data structure comprised of rules subsequently processed by the PMA. The patterns to be searched in the input stream are defined by the user as a set of regular expressions. The patterns to be searched are grouped in pattern context sets. The sets of regular expressions which define the pattern context sets are compiled to generate a rules structure used by the PMA hardware. The rules are compiled before search run time and stored in main memory, in rule cache memory within the PMA or a combination thereof. For each input character, the PMA executes the search and returns the search results.
摘要翻译： 模式匹配加速器（PMA），用于帮助软件线程查找匹配给定模式的输入数据流中字符串的存在和位置。 使用正则表达式定义模式，该正则表达式被编译成由PMA随后处理的规则组成的数据结构。 在输入流中要搜索的模式由用户定义为一组正则表达式。 要搜索的模式分组在模式上下文集中。 编译定义模式上下文集的正则表达式集合，以生成PMA硬件使用的规则结构。 该规则在搜索运行时间之前被编译并存储在主存储器中，在PMA内的规则高速缓冲存储器中或其组合中。 对于每个输入字符，PMA执行搜索并返回搜索结果。
-
39.发明授权公开(公告)号：US08423533B2
公开(公告)日：2013-04-16
申请号：US13022938
申请日：2011-02-08
IPC分类号： G06F17/30
CPC分类号： G06F17/30985
摘要： A pattern matching accelerator (PMA) for assisting software threads to find the presence and location of strings in an input data stream that match a given pattern. The patterns are defined using regular expressions that are compiled into a data structure comprised of rules subsequently processed by the PMA. The patterns to be searched in the input stream are defined by the user as a set of regular expressions. The patterns to be searched are grouped in pattern context sets. The sets of regular expressions which define the pattern context sets are compiled to generate a rules structure used by the PMA hardware. The rules are compiled before search run time and stored in main memory, in rule cache memory within the PMA or a combination thereof. For each input character, the PMA executes the search and returns the search results.
摘要翻译： 模式匹配加速器（PMA），用于帮助软件线程查找匹配给定模式的输入数据流中字符串的存在和位置。 使用正则表达式定义模式，该正则表达式被编译成由PMA随后处理的规则组成的数据结构。 在输入流中要搜索的模式由用户定义为一组正则表达式。 要搜索的模式分组在模式上下文集中。 编译定义模式上下文集的正则表达式集合，以生成PMA硬件使用的规则结构。 该规则在搜索运行时间之前被编译并存储在主存储器中，在PMA内的规则高速缓冲存储器中或其组合中。 对于每个输入字符，PMA执行搜索并返回搜索结果。
-
公开(公告)号：US08412722B2
公开(公告)日：2013-04-02
申请号：US13022863
申请日：2011-02-08
IPC分类号： G06F17/30
CPC分类号： G06F17/30985
摘要： A pattern matching accelerator (PMA) for assisting software threads to find the presence and location of strings in an input data stream that match a given pattern. The patterns are defined using regular expressions that are compiled into a data structure comprised of rules subsequently processed by the PMA. The patterns to be searched in the input stream are defined by the user as a set of regular expressions. The patterns to be searched are grouped in pattern context sets. The sets of regular expressions which define the pattern context sets are compiled to generate a rules structure used by the PMA hardware. The rules are compiled before search run time and stored in main memory, in rule cache memory within the PMA or a combination thereof. For each input character, the PMA executes the search and returns the search results.
摘要翻译： 模式匹配加速器（PMA），用于帮助软件线程查找匹配给定模式的输入数据流中字符串的存在和位置。 使用正则表达式定义模式，该正则表达式被编译成由PMA随后处理的规则组成的数据结构。 在输入流中要搜索的模式由用户定义为一组正则表达式。 要搜索的模式分组在模式上下文集中。 编译定义模式上下文集的正则表达式集合，以生成PMA硬件使用的规则结构。 该规则在搜索运行时间之前被编译并存储在主存储器中，在PMA内的规则高速缓冲存储器中或其组合中。 对于每个输入字符，PMA执行搜索并返回搜索结果。
-
-
-
-
-
-
-
-
-
搜索结果
71 条记录 (耗时 0.036 秒)
