会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 21. 发明申请
    • APPARATUS AND METHOD FOR ACCESSING A MEMORY DEVICE
    • 用于访问存储器件的装置和方法
    • US20090006782A1
    • 2009-01-01
    • US12143889
    • 2008-06-23
    • Peter BuchmannMartin Leo SchmatzJan Van Lunteren
    • Peter BuchmannMartin Leo SchmatzJan Van Lunteren
    • G06F12/00
    • G06F12/02G06F12/0223G11C15/00
    • An apparatus and a corresponding method for coupling a memory device being addressable by means of an address space to a processing unit, the apparatus consisting: a first memory access unit being adapted for receiving a memory address from the processing unit and for accessing the memory device by the received memory address; a second memory access unit being adapted for receiving content data (an input key) from the processing unit and for controlling a search for the received content data in the memory device, and an allocation unit for allocating a first part of the address space of the memory device to the first memory access unit and a second part of the address space of the memory device to the second memory access unit. A storage medium to perform coupling a memory device being addressable by means of an address space to a processing unit is also provided.
    • 一种用于将可通过地址空间寻址的存储器件耦合到处理单元的装置和相应方法,所述装置包括:第一存储器存取单元,适于从所述处理单元接收存储器地址并访问存储器件 由接收的存储器地址; 第二存储器存取单元,其适于从所述处理单元接收内容数据(输入密钥),并且用于控制对所述存储器件中的所接收的内容数据的搜索;以及分配单元,用于分配所述存储器存储单元的地址空间的第一部分 存储器设备到第一存储器存取单元以及存储器件的地址空间的第二部分到第二存储器存取单元。 还提供了一种用于通过地址空间将可寻址的存储器件耦合到处理单元的存储介质。
    • 22. 发明申请
    • Method and apparatus for deep packet processing
    • 深度数据包处理的方法和装置
    • US20080228798A1
    • 2008-09-18
    • US12123183
    • 2008-05-19
    • Jan Van Lunteren
    • Jan Van Lunteren
    • G06F17/30
    • H04L63/02H04L45/7457H04L69/12H04L69/22
    • A method and apparatus for deep packet processing including a parsing and a searching method supported by a data structure storing the state-transition rules in the state-transition rule tables of a programmable state machine for parsing. The state-transition rule table is then compressed using the BaRT compression algorithm. Each transition rule comprises a test value, a test mask and a next state field. In a second embodiment the state-transition rule table is split into more than one state-transition rule table corresponding to disjoints state spaces, thus allowing more flexibility in the use of storage space. Finally a parsing and searching method can be implemented using the same hardware. The searching and parsing methods can be implemented alternatively or in any combination at wire-speed.
    • 一种用于深度分组处理的方法和装置,包括由可编程状态机的状态转换规则表中存储状态转换规则的数据结构支持的解析和搜索方法,用于解析。 然后使用BaRT压缩算法压缩状态转换规则表。 每个转换规则包括测试值,测试掩码和下一个状态字段。 在第二实施例中,状态转移规则表被分成与不相交状态空间相对应的多于一个的状态转移规则表,从而允许使用存储空间的更大的灵活性。 最后,可以使用相同的硬件实现解析和搜索方法。 搜索和解析方法可以以线速交替地或以任何组合来实现。
    • 23. 发明申请
    • Method and System for Changing a Description for a State Transition Function of a State Machine Engine
    • 用于更改状态机引擎的状态转换功能的描述的方法和系统
    • US20070283300A1
    • 2007-12-06
    • US11740487
    • 2007-04-26
    • Rolf FritzMarkus KaltenbachUlrich MayerThomas PfluegerCordt StarkeJan Van Lunteren
    • Rolf FritzMarkus KaltenbachUlrich MayerThomas PfluegerCordt StarkeJan Van Lunteren
    • G06F17/50
    • G06F17/5045
    • The invention relates to a method and system for the design and implementation of state machine engines. A first constraints checking step checks a state transition function created by a designer against constraints imposed by the implementation technology in order to detect all portions of the state transition function that are in conflict with the constraints. A subsequent conflict resolution step tries to determine one or more suggested ways to meet the conflicting constraints, by investigating how the original state transition function can be modified such that all constraints are met. A final presentation and selection step provides the designer textual and/or graphically results of the constraints check and suggested modifications. The modifications can be accepted interactively, or the state transition function can be changed manually. In the latter case, the modified state transition function will be processed starting again with the constraints checking step.
    • 本发明涉及一种用于设计和实施状态机发动机的方法和系统。 第一约束检查​​步骤检查由设计者创建的状态转换函数,以抵制由实施技术施加的约束,以便检测与约束相冲突的状态转换函数的所有部分。 随后的冲突解决步骤尝试通过调查如何修改原始状态转换功能以满足所有约束来确定满足冲突约束的一种或多种建议方式。 最后的演示和选择步骤为设计者提供了约束检查和建议修改的文本和/或图形结果。 可以交互接受修改,也可以手动更改状态转换功能。 在后一种情况下,将通过约束检查步骤再次开始处理修改的状态转换功能。
    • 24. 发明授权
    • Algorithm engine for use in a pattern matching accelerator
    • 用于模式匹配加速器的算法引擎
    • US08799188B2
    • 2014-08-05
    • US13023003
    • 2011-02-08
    • Giora BiranChristoph HagleitnerTimothy H. HeilRussell D. HooverJan Van Lunteren
    • Giora BiranChristoph HagleitnerTimothy H. HeilRussell D. HooverJan Van Lunteren
    • G06F15/18
    • 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执行搜索并返回搜索结果。
    • 25. 发明授权
    • Local results processor for use in a pattern matching accelerator
    • 本地结果处理器用于模式匹配加速器
    • US08447749B2
    • 2013-05-21
    • US13022967
    • 2011-02-08
    • Giora BiranChristoph HagleitnerTimothy H. HeilJan Van Lunteren
    • Giora BiranChristoph HagleitnerTimothy H. HeilJan Van Lunteren
    • G06F17/30
    • G06F17/30985G06F11/1402
    • 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执行搜索并返回搜索结果。
    • 26. 发明授权
    • Local result processor
    • 本地结果处理器
    • US08427201B2
    • 2013-04-23
    • 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.
    • 一种系统包括寄存器,第一逻辑功能部分,第一逻辑功能部分,用于从寄存器接收第一数值,执行具有第一数值的第一逻辑函数,并输出第二数值,第二逻辑函数 所述第二逻辑功能部分用于从所述寄存器接收所述第一数值,执行具有所述第一数值的第二逻辑功能,并输出第三数值,以及控制逻辑部分,所述控制逻辑部分用于接收所述第一数值, 确定所述第一数值是否包括与所述第一逻辑功能或所述第二逻辑功能相关联的代码,并且响应于确定所述代码与所述第一逻辑功能相关联,并且指示所述第一逻辑功能的输出 第二数值到寄存器的输入。
    • 28. 发明申请
    • LOCAL RESULTS PROCESSOR FOR USE IN A PATTERN MATCHING ACCELERATOR
    • 用于模式匹配加速器的本地结果处理器
    • US20120203756A1
    • 2012-08-09
    • US13022967
    • 2011-02-08
    • Giora BiranChristoph HagleitnerTimothy H. HeilJan Van Lunteren
    • Giora BiranChristoph HagleitnerTimothy H. HeilJan Van Lunteren
    • G06F17/30
    • G06F17/30985G06F11/1402
    • 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执行搜索并返回搜索结果。
    • 29. 发明申请
    • PERFORMANCE MONITORING MECHANISM FOR USE IN A PATTERN MATCHING ACCELERATOR
    • 性能监控机制,用于图形匹配加速器
    • US20120203754A1
    • 2012-08-09
    • US13022904
    • 2011-02-08
    • Giora BiranChristoph HagleitnerTimothy H. HeilJan Van Lunteren
    • Giora BiranChristoph HagleitnerTimothy H. HeilJan Van Lunteren
    • G06F17/30G06F13/28
    • 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执行搜索并返回搜索结果。