会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 52. 发明申请
    • MULTIPLE RULE BANK ACCESS SCHEME FOR USE IN A PATTERN MATCHING ACCELERATOR
    • 用于模式匹配加速器的多条规则银行存取方案
    • US20120203755A1
    • 2012-08-09
    • US13022938
    • 2011-02-08
    • Giora BiranChristoph HagleitnerTimothy H. HeilJan Van Lunteren
    • Giora BiranChristoph HagleitnerTimothy H. HeilJan Van Lunteren
    • G06F17/30
    • 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执行搜索并返回搜索结果。
    • 53. 发明申请
    • MULTIPLE HASH SCHEME FOR USE IN A PATTERN MATCHING ACCELERATOR
    • 用于模式匹配加速器的多个哈希方案
    • US20120203729A1
    • 2012-08-09
    • US13021757
    • 2011-02-06
    • Giora BiranChristoph HagleitnerTimothy Hume HeilJan Van Lunteren
    • Giora BiranChristoph HagleitnerTimothy Hume HeilJan Van Lunteren
    • G06N5/02
    • G06N5/047G06N5/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执行搜索并返回搜索结果。
    • 54. 发明申请
    • STORAGE EFFICIENT PROGRAMMABLE STATE MACHINE
    • 存储高效可编程状态机
    • US20120158635A1
    • 2012-06-21
    • US12970127
    • 2010-12-16
    • Jan Van Lunteren
    • Jan Van Lunteren
    • G06N5/02
    • G06N5/025
    • A state machine includes a rule selector. The rule selector receives input data, and one or more transition rules. The one or more transition rules including a next state. The state machine also includes a character classifier communicatively coupled to the rule selector. The character classifier includes a plurality of base classes. The character classifier receiving the input data, and sending one or more of the plurality of base classes to the rule selector in response to receiving the input data. The rule selector selects one of the one or more transition rules in response to determining that the input data and one of the plurality of base classes correspond to the transition rule. The current state of the state machine is then set to the next state of the selected one of the one or more transition rules.
    • 状态机包括规则选择器。 规则选择器接收输入数据,以及一个或多个转换规则。 一个或多个转换规则包括下一个状态。 状态机还包括通信地耦合到规则选择器的字符分类器。 字符分类器包括多个基类。 字符分类器接收输入数据,并且响应于接收到输入数据而将多个基类中的一个或多个发送到规则选择器。 响应于确定输入数据和多个基类中的一个与转换规则相对应,规则选择器选择一个或多个转换规则之一。 然后将状态机的当前状态设置为所述一个或多个转换规则中所选择的一个的下一状态。
    • 56. 发明授权
    • Method and apparatus for deep packet processing
    • 深度数据包处理的方法和装置
    • US07787474B2
    • 2010-08-31
    • US12123183
    • 2008-05-19
    • Jan Van Lunteren
    • Jan Van Lunteren
    • H04L12/28
    • 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压缩算法压缩状态转换规则表。 每个转换规则包括测试值,测试掩码和下一个状态字段。 在第二实施例中,状态转移规则表被分成与不相交状态空间相对应的多于一个的状态转移规则表,从而允许使用存储空间的更大的灵活性。 最后,可以使用相同的硬件实现解析和搜索方法。 搜索和解析方法可以以线速交替地或以任何组合来实现。
    • 57. 发明授权
    • Method and system for changing a description for a state transition function of a state machine engine
    • 用于改变状态机引擎的状态转换功能的描述的方法和系统
    • US07703058B2
    • 2010-04-20
    • 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.
    • 本发明涉及一种用于设计和实施状态机发动机的方法和系统。 第一约束检查​​步骤检查由设计者创建的状态转换函数,以抵制由实施技术施加的约束,以便检测与约束相冲突的状态转换函数的所有部分。 随后的冲突解决步骤尝试通过调查如何修改原始状态转换功能以满足所有约束来确定满足冲突约束的一种或多种建议方式。 最后的演示和选择步骤为设计者提供了约束检查和建议修改的文本和/或图形结果。 可以交互接受修改,也可以手动更改状态转换功能。 在后一种情况下,将通过约束检查步骤再次开始处理修改的状态转换功能。
    • 58. 发明申请
    • PARALLEL PATTERN MATCHING ON MULTIPLE INPUT STREAMS IN A DATA PROCESSING SYSTEM
    • 数据处理系统中多个输入流的并行模式匹配
    • US20090307175A1
    • 2009-12-10
    • US12136386
    • 2008-06-10
    • Iorio FrancescoJan Van Lunteren
    • Iorio FrancescoJan Van Lunteren
    • G06N5/02
    • G06F9/4498
    • A method, system and computer program product for performing pattern matching in parallel for a plurality of input streams. The method includes calculating a memory address in a translation table responsive to a current input value, a current state and current state information. A transition rule is retrieved from the transition rule table at the memory address, the transition rule including a test input value, a test current state, and next state information. It is determined if the current input value and the current state match the test input value and the test current state. The current state information is updated with the next state information in response to determining that the current input value and the current state match the test input value and the test current state. The current state information is updated with contents of a default transition rule in response to determining that the current input value and the current state do not match the test input value and the test current state.
    • 一种用于对多个输入流并行执行模式匹配的方法,系统和计算机程序产品。 该方法包括响应于当前输入值,当前状态和当前状态信息来计算翻译表中的存储器地址。 从存储器地址的转移规则表中检索转移规则,转换规则包括测试输入值,测试当前状态和下一状态信息。 确定当前输入值和当前状态是否与测试输入值和测试当前状态相匹配。 响应于确定当前输入值和当前状态与测试输入值和测试当前状态匹配,当前状态信息被更新为具有下一状态信息。 响应于确定当前输入值和当前状态与测试输入值和测试当前状态不匹配,当前状态信息被更新为默认转换规则的内容。