会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 12. 发明授权
    • Pattern-matching system
    • 模式匹配系统
    • US07508985B2
    • 2009-03-24
    • US10970798
    • 2004-10-21
    • Jan Van Lunteren
    • Jan Van Lunteren
    • G06K9/00G06F17/30
    • G06F17/30985Y10S707/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然后可以相应地解析所接收的文档。
    • 13. 发明授权
    • Packet classification
    • US07193997B2
    • 2007-03-20
    • US10090592
    • 2002-02-28
    • Jan Van LunterenAntonius Engbersen
    • Jan Van LunterenAntonius Engbersen
    • H04L12/28
    • H04L47/10H04L29/06H04L45/742H04L45/7453H04L47/20H04L69/22
    • Methods and apparatus are provided for classifying data packets in data processing systems. A first packet classification method determines which of a plurality of predefined processing rules applies to a data packet, where each rule is associated with a range of possible data values in each of a plurality of dimensions (X,Y) corresponding to respective data items in the packet format. For each dimension (X,Y), it is determined which of a set of predefined basic ranges contains the corresponding data value (I1, I2) from the packet, where the basic ranges correspond to respective non-overlapping value ranges between successive rule range boundaries in the dimension. For the basic range so determined for each dimension, a corresponding basic range identifier is selected from a set of predefined basic range identifiers corresponding to respective basic ranges in that dimension. For each of at least two dimensions (X,Y), the basic range identifiers comprise respective pD-bit strings generated independently for that dimension by a process of deriving a primitive range hierarchy based on the rule ranges in that dimension. The resulting basic range identifiers, one for each dimension, are then combined to produce a search key which is supplied to a ternary content-addressable memory (5). In the memory (5), the search key is compared with a set of ternary rule vectors, each associated with a particular rule and derived for that rule from the aforementioned hierarchies, to identify at least one rule which applies to the data packet. A second method classifies data packets according to the values in respective data packets of a single, predetermined data item (DA) in the data packet format, where a plurality of classification results are predefined for respective ranges of values of the data item (DA). Here the data item (DA) in the packet is first segmented. The resulting segments are then equated to different dimensions (X,Y) of a multidimensional packet classification problem and are processed in a similar manner to identify a classification result for the packet.
    • 14. 发明申请
    • Pattern-matching system
    • 模式匹配系统
    • US20050132342A1
    • 2005-06-16
    • US10970798
    • 2004-10-21
    • Jan Van Lunteren
    • Jan Van Lunteren
    • G06F9/45G06F17/30
    • G06F17/30985Y10S707/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然后可以相应地解析所接收的文档。
    • 15. 发明授权
    • Prefix search method and data structure using compressed search tables
    • 使用压缩搜索表前缀搜索方法和数据结构
    • US06782382B2
    • 2004-08-24
    • US09801026
    • 2001-03-07
    • Jan Van Lunteren
    • Jan Van Lunteren
    • G06F1730
    • G06F17/30985Y10S707/99931Y10S707/99933
    • The invention relates to a system in which given search keys are evaluated, segment by segment, to search through tree-structured tables for finding an output information corresponding to the longest matching prefix. For at least one of the segments, only selected bits of the search key segment are used as index for accessing an associated table where test values are stored which are to be compared to the respective search key segment. The bits to be selected are determined by an index mask, reflecting the distribution of the valid test values in the table entries (and valid search key segment values). This allows table compression for minimizing storage requirements and search time. A procedure is disclosed for generating an optimum index mask in response to the set of valid test values.
    • 本发明涉及一种系统,其中逐段评估给定的搜索关键字,以搜索通过树形结构的表以找到对应于最长匹配前缀的输出信息。 对于至少一个段,仅将搜索关键字段的选定位用作访问相关表的索引,其中存储测试值将与相应搜索关键段进行比较。 要选择的位由索引掩码确定,反映表条目中的有效测试值的分布(以及有效的搜索关键段值)。 这允许表压缩最小化存储要求和搜索时间。 公开了用于响应于一组有效测试值来生成最佳索引掩码的过程。
    • 16. 发明授权
    • Address translation for use in a pattern matching accelerator
    • 地址转换用于模式匹配加速器
    • US08495334B2
    • 2013-07-23
    • US13021756
    • 2011-02-06
    • Giora BiranChristoph HagleitnerTimothy Hume HeilJan Van Lunteren
    • Giora BiranChristoph HagleitnerTimothy Hume HeilJan Van Lunteren
    • G06F12/10
    • G06F17/30985G06F12/10
    • 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执行搜索并返回搜索结果。
    • 18. 发明申请
    • Local Result Processor
    • 本地结果处理器
    • US20120242369A1
    • 2012-09-27
    • US13070864
    • 2011-03-24
    • Jan Van Lunteren
    • Jan Van Lunteren
    • H03K19/173
    • H03K19/1737
    • A system includes a register, a first logical function portion, the first logical function portion operative to receive a first numerical value from the register, perform a first logical function with the first numerical value, and output a second numerical value, a second logical function portion, the second logical function portion operative to receive the first numerical value from the register, perform a second logical function with the first numerical value, and output a third numerical value, and a control logic portion, the control logic portion operative to receive the first numerical value from the register, determine whether the first numerical value includes a code associated with either the first logical function or the second logical function, and responsive to determining that the code is associated with the first logical function, and direct the output of the second numerical value to an input of the register.
    • 一种系统包括寄存器,第一逻辑功能部分,第一逻辑功能部分,用于从寄存器接收第一数值,执行具有第一数值的第一逻辑函数,并输出第二数值,第二逻辑函数 所述第二逻辑功能部分用于从所述寄存器接收所述第一数值,执行具有所述第一数值的第二逻辑功能,并输出第三数值,以及控制逻辑部分,所述控制逻辑部分用于接收所述第一数值, 确定所述第一数值是否包括与所述第一逻辑功能或所述第二逻辑功能相关联的代码,并且响应于确定所述代码与所述第一逻辑功能相关联,并且指示所述第一逻辑功能的输出 第二数值到寄存器的输入。
    • 19. 发明申请
    • ADDRESS TRANSLATION FOR USE IN A PATTERN MATCHING ACCELERATOR
    • 用于模式匹配加速器的地址翻译
    • US20120204000A1
    • 2012-08-09
    • US13021756
    • 2011-02-06
    • Giora BiranChristoph HagleitnerTimothy Hume HeilJan Van Lunteren
    • Giora BiranChristoph HagleitnerTimothy Hume HeilJan Van Lunteren
    • G06F12/10
    • G06F17/30985G06F12/10
    • 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执行搜索并返回搜索结果。
    • 20. 发明申请
    • PATTERN MATCHING ACCELERATOR
    • 图案匹配加速器
    • US20120203761A1
    • 2012-08-09
    • US13022850
    • 2011-02-08
    • Giora BiranChristoph HagleitnerTimothy H. HeilRussell D. HooverJan Van Lunteren
    • Giora BiranChristoph HagleitnerTimothy H. HeilRussell D. HooverJan Van Lunteren
    • G06F17/30
    • G06F17/30985G06K9/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执行搜索并返回搜索结果。