专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20080022401A1 Apparatus and Method for Multicore Network Security Processing 审中-公开
标题翻译：多核网络安全处理的装置与方法
公开(公告)号：US20080022401A1
公开(公告)日：2008-01-24
申请号：US11459280
申请日：2006-07-21
申请人： Craig Cameron , Teewoon Tan , Darren Williams , Robert Matthew Barrie
发明人： Craig Cameron , Teewoon Tan , Darren Williams , Robert Matthew Barrie
IPC分类号： G06F12/14
CPC分类号： H04L63/1441 , G06F21/552 , G06F21/562 , H04L63/20
摘要： A multicore network security system includes scheduler modules, one or more security modules and post-processing modules. Each security module may be a processing core or itself a network security system. A scheduler module routes input data to the security modules, which perform network security functions, then routes processed data to one or more post-processing modules. The post-processing modules post-process this processed data and route it back to scheduler modules. If further processing is required, the processed data is routed to the security modules; otherwise the processed data is output from the scheduler modules. Each processing core may operate independently from other processing cores, enabling parallel and simultaneous execution of network security functions.
摘要翻译：多核网络安全系统包括调度器模块，一个或多个安全模块和后处理模块。每个安全模块可以是处理核心或其本身的网络安全系统。调度器模块将输入数据路由到执行网络安全功能的安全模块，然后将处理后的数据路由到一个或多个后处理模块。后处理模块后处理此处理的数据并将其路由回调度程序模块。如果需要进一步处理，则处理后的数据被路由到安全模块; 否则处理的数据从调度器模块输出。每个处理核心可以独立于其他处理核心运行，从而实现并行和同时执行网络安全功能。

2. 发明授权

US07411418B2 Efficient representation of state transition tables 有权
标题翻译：状态转换表的有效表示
公开(公告)号：US07411418B2
公开(公告)日：2008-08-12
申请号：US10850979
申请日：2004-05-21
申请人： Stephen Gould , Robert Matthew Barrie , Michael Flanagan , Darren Williams
发明人： Stephen Gould , Robert Matthew Barrie , Michael Flanagan , Darren Williams
IPC分类号： G06F7/38 , H03K19/173
CPC分类号： G06F9/4498
摘要： The states associated with a programmable state machine are reordered to compress the storage of transitions which define the state machine. To reorder the states, a score is computed and assigned to each of the states. Next, the states are sorted according to their computed scores. In some embodiments, to compute the score for each current state based on the received input symbol, the number of times that the input symbol causes transition to similar states is added. The sum of the scores in each row of the table is representative of the score for the associated current state associated with that row. The states are sorted according to their score and a new state transition table is generated in accordance with the reordered states.
摘要翻译：与可编程状态机相关联的状态被重新排序以压缩定义状态机的转换的存储。要重新排序状态，计算得分并分配给每个状态。接下来，根据它们的计算分数对状态进行排序。在一些实施例中，为了基于接收到的输入符号来计算每个当前状态的得分，输入符号导致转变到类似状态的次数被增加。表中每行的分数之和表示与该行相关联的当前状态的分数。状态根据其分数进行排序，并根据重新排列的状态生成新的状态转换表。

3. 发明授权

US07180328B2 Apparatus and method for large hardware finite state machine with embedded equivalence classes 有权
标题翻译：具有嵌入式等价类的大型硬件有限状态机的装置和方法
公开(公告)号：US07180328B2
公开(公告)日：2007-02-20
申请号：US10850978
申请日：2004-05-21
申请人： Stephen Gould , Ernest Peltzer , Robert Matthew Barrie , Michael Flanagan , Darren Williams
发明人： Stephen Gould , Ernest Peltzer , Robert Matthew Barrie , Michael Flanagan , Darren Williams
IPC分类号： H03K19/173 , G06F7/38
CPC分类号： G06F9/4498
摘要： A programmable finite state machine (FSM) includes, in part, a first address calculation logic block, a first lookup table, a second address calculation logic block, and a second lookup table. The first address calculation logic block generates an address for the first lookup table based on the received input symbol and the current state. The data stored in first look-up table at the generated address is used by the second address calculation logic block to compute an address for the second lookup table. Data stored in the second lookup table is the next state to which the FSM transitions. The programmable FSMs uses redundant information of the transition table to compress these transitions and thus requires a smaller memory while maintaining a high data throughput. The data in the first and second lookup tables are coded and supplied by a compiler. The FSM operation may optionally be pipelined.
摘要翻译：可编程有限状态机（FSM）部分地包括第一地址计算逻辑块，第一查找表，第二地址计算逻辑块和第二查找表。第一地址计算逻辑块基于接收到的输入符号和当前状态生成第一查找表的地址。存储在生成地址的第一查找表中的数据由第二地址计算逻辑块用于计算第二查找表的地址。存储在第二查找表中的数据是FSM转换到的下一个状态。可编程FSM使用过渡表的冗余信息来压缩这些转换，因此需要较小的存储器，同时保持较高的数据吞吐量。第一和第二查找表中的数据由编译器编码和提供。 FSM操作可以可选地被流水线化。

4. 发明授权

US07301792B2 Apparatus and method of ordering state transition rules for memory efficient, programmable, pattern matching finite state machine hardware 失效
标题翻译：用于存储器高效，可编程，模式匹配有限状态机硬件的状态转换规则的装置和方法
公开(公告)号：US07301792B2
公开(公告)日：2007-11-27
申请号：US11422529
申请日：2006-06-06
申请人： Stephen Gould , Robert Matthew Barrie , Darren Williams , Nicholas de Jong
发明人： Stephen Gould , Robert Matthew Barrie , Darren Williams , Nicholas de Jong
IPC分类号： G11C15/00
CPC分类号： G06F21/554 , G06F7/02 , G06F21/567 , G06F2207/025 , G11C15/00 , H04L63/0227 , H04L63/12 , H04L63/1441
摘要： A programmable finite state machine (FSM) includes, in part, first and second memories, and a selection circuit coupled to each of the memories. Upon receiving a (k+m)-bit word representative of the k-bit input symbol and the m-bit current state, the first memory supplies one ore more matching transition rules stored therein. The selection circuit selects the most specific of the supplied rules. The transition rules are stored in the first memory in a ranking order of generality. The second memory receives the selected transition rule and supplies the next state of the FSM. The first memory may be a ternary content addressable memory and the second memory may be a static random access memory. The contents of both the content addressable memory and the static random memory is determined by an algorithm which minimizes the number of terms required to represent the next-state transition functions.
摘要翻译：可编程有限状态机（FSM）部分地包括第一和第二存储器，以及耦合到每个存储器的选择电路。当接收到表示k位输入符号和m位当前状态的（k + m）位字时，第一存储器提供存储在其中的一个或多个匹配转换规则。选择电路选择最具体的提供的规则。过渡规则以一般性的排序顺序存储在第一存储器中。第二个存储器接收所选择的转移规则并提供FSM的下一个状态。第一存储器可以是三进制内容可寻址存储器，并且第二存储器可以是静态随机存取存储器。内容可寻址存储器和静态随机存储器的内容由最小化表示下一状态转换功能所需的术语数量的算法确定。

5. 发明授权

US07219319B2 Apparatus and method for generating state transition rules for memory efficient programmable pattern matching finite state machine hardware 有权
标题翻译：用于产生存储器有效可编程模式匹配有限状态机硬件的状态转换规则的装置和方法
公开(公告)号：US07219319B2
公开(公告)日：2007-05-15
申请号：US11422520
申请日：2006-06-06
申请人： Stephen Gould , Robert Matthew Barrie , Darren Williams , Nicholas de Jong
发明人： Stephen Gould , Robert Matthew Barrie , Darren Williams , Nicholas de Jong
IPC分类号： G06F17/50
CPC分类号： H04L63/12
摘要： A programmable finite state machine (FSM) includes, in part, first and second memories, and a selection circuit coupled to each of the memories. Upon receiving a (k+m)-bit word representative of the k-bit input symbol and the m-bit current state, the first memory supplies one ore more matching transition rules stored therein. The selection circuit selects the most specific of the supplied rules. The transition rules are stored in the first memory in a ranking order of generality. The second memory receives the selected transition rule and supplies the next state of the FSM. The first memory may be a ternary content addressable memory and the second memory may be a static random access memory. The contents of both the content addressable memory and the static random memory is determined by an algorithm which minimizes the number of terms required to represent the next-state transition functions.
摘要翻译：可编程有限状态机（FSM）部分地包括第一和第二存储器，以及耦合到每个存储器的选择电路。当接收到表示k位输入符号和m位当前状态的（k + m）位字时，第一存储器提供存储在其中的一个或多个匹配转换规则。选择电路选择最具体的提供的规则。过渡规则以一般性的排序顺序存储在第一存储器中。第二个存储器接收所选择的转移规则并提供FSM的下一个状态。第一存储器可以是三进制内容可寻址存储器，并且第二存储器可以是静态随机存取存储器。内容可寻址存储器和静态随机存储器的内容由最小化表示下一状态转换功能所需的术语数量的算法确定。

6. 发明授权

US07082044B2 Apparatus and method for memory efficient, programmable, pattern matching finite state machine hardware 失效
标题翻译：用于存储器高效，可编程，模式匹配的有限状态机硬件的装置和方法
公开(公告)号：US07082044B2
公开(公告)日：2006-07-25
申请号：US10799367
申请日：2004-03-12
申请人： Stephen Gould , Robert Matthew Barrie , Darren Williams , Nicholas de Jong
发明人： Stephen Gould , Robert Matthew Barrie , Darren Williams , Nicholas de Jong
IPC分类号： G11C13/00
CPC分类号： G06F21/554 , G06F7/02 , G06F21/567 , G06F2207/025 , G11C15/00 , H04L63/0227 , H04L63/12 , H04L63/1441
摘要： A programmable finite state machine (FSM) includes, in part, first and second memories, and a selection circuit coupled to each of the memories. Upon receiving a (k+m)-bit word representative of the k-bit input symbol and the m-bit current state, the first memory supplies one ore more matching transition rules stored therein. The selection circuit selects the most specific of the supplied rules. The transition rules are stored in the first memory in a ranking order of generality. The second memory receives the selected transition rule and supplies the next state of the FSM. The first memory may be a ternary content addressable memory and the second memory may be a static random access memory. The contents of both the content addressable memory and the static random memory is determined by an algorithm which minimizes the number of terms required to represent the next-state transition functions.
摘要翻译：可编程有限状态机（FSM）部分地包括第一和第二存储器，以及耦合到每个存储器的选择电路。当接收到表示k位输入符号和m位当前状态的（k + m）位字时，第一存储器提供存储在其中的一个或多个匹配转换规则。选择电路选择最具体的提供的规则。过渡规则以一般性的排序顺序存储在第一存储器中。第二个存储器接收所选择的转移规则并提供FSM的下一个状态。第一存储器可以是三进制内容可寻址存储器，并且第二存储器可以是静态随机存取存储器。内容可寻址存储器和静态随机存储器的内容由最小化表示下一状态转换功能所需的术语数量的算法确定。

7. 发明申请

US20120095908A1 Distributed Computing for Engaging Software Services 审中-公开
标题翻译：用于参与软件服务的分布式计算
公开(公告)号：US20120095908A1
公开(公告)日：2012-04-19
申请号：US13088424
申请日：2011-04-18
申请人： Robert Matthew Barrie , Darren Nicholas John Williams , David Harrison , Peter Phillips
发明人： Robert Matthew Barrie , Darren Nicholas John Williams , David Harrison , Peter Phillips
IPC分类号： G06Q99/00
CPC分类号： G06Q10/06 , G06Q20/10 , G06Q30/02
摘要： A method and apparatus for engaging, on behalf of a client computing device, one or more remote computing devices to perform a client directed task for a fee. The method comprising the steps of: receiving, from a client computing device, data indicative of a task to be performed; reviewing capabilities of the remote computing devices; selecting one or more suitable remote computing devices for performing at least a first subtask; negotiating, and reaching agreement, with selected remote computing devices on terms for performing the first subtask; verifying receipt of payment from a client, being associated with the client computing device; dispatching the first subtask; receiving a first result, from respective remote computing device; and providing payment to a remote provider, being associated with the remote computer device.
摘要翻译：用于代表客户端计算设备接合一个或多个远程计算设备以执行费用的客户导向任务的方法和装置。该方法包括以下步骤：从客户端计算设备接收指示要执行的任务的数据; 审查远程计算设备的功能; 选择用于执行至少第一子任务的一个或多个合适的远程计算设备; 与所选择的远程计算设备协商和达成协议，用于执行第一个子任务; 验证与客户端计算设备相关联的客户端的付款接收; 调度第一个子任务; 从相应的远程计算设备接收第一结果; 并向与远程计算机设备相关联的远程提供商提供支付。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式