Patents by Inventor Trent Parker
Trent Parker has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 9787693Abstract: In a method and apparatus for analyzing nodes of a Deterministic Finite Automata (DFA), an accessibility ranking, based on a DFA graph geometrical configuration, may be determined in order to determine cacheable portions of the DFA graph in order to reduce the number of external memory accesses. A walker process may be configured to walk the graph in a graph cache as well as main memory. The graph may be generated in a manner allowing each arc to include information if the node it is pointing to is stored in the graph cache or in main memory. The walker may use this information to determine whether or not to access the next arc in the graph cache or in main memory.Type: GrantFiled: December 5, 2011Date of Patent: October 10, 2017Assignee: Cavium, Inc.Inventors: Rajan Goyal, Muhammad Raghib Hussain, Trent Parker
-
Patent number: 9652505Abstract: An improved content search mechanism uses a graph that includes intelligent nodes avoids the overhead of post processing and improves the overall performance of a content processing application. An intelligent node is similar to a node in a DFA graph but includes a command. The command in the intelligent node allows additional state for the node to be generated and checked. This additional state allows the content search mechanism to traverse the same node with two different interpretations. By generating state for the node, the graph of nodes does not become exponential. It also allows a user function to be called upon reaching a node, which can perform any desired user tasks, including modifying the input data or position.Type: GrantFiled: April 21, 2016Date of Patent: May 16, 2017Assignee: Cavium, Inc.Inventors: Muhammad R. Hussain, David A. Carlson, Gregg A. Bouchard, Trent Parker
-
Publication number: 20160232210Abstract: An improved content search mechanism uses a graph that includes intelligent nodes avoids the overhead of post processing and improves the overall performance of a content processing application. An intelligent node is similar to a node in a DFA graph but includes a command. The command in the intelligent node allows additional state for the node to be generated and checked. This additional state allows the content search mechanism to traverse the same node with two different interpretations. By generating state for the node, the graph of nodes does not become exponential. It also allows a user function to be called upon reaching a node, which can perform any desired user tasks, including modifying the input data or position.Type: ApplicationFiled: April 21, 2016Publication date: August 11, 2016Inventors: Muhammad R. Hussain, David A. Carlson, Gregg A. Bouchard, Trent Parker
-
Patent number: 9336328Abstract: An improved content search mechanism uses a graph that includes intelligent nodes avoids the overhead of post processing and improves the overall performance of a content processing application. An intelligent node is similar to a node in a DFA graph but includes a command. The command in the intelligent node allows additional state for the node to be generated and checked. This additional state allows the content search mechanism to traverse the same node with two different interpretations. By generating state for the node, the graph of nodes does not become exponential. It also allows a user function to be called upon reaching a node, which can perform any desired user tasks, including modifying the input data or position.Type: GrantFiled: July 22, 2014Date of Patent: May 10, 2016Assignee: Cavium, Inc.Inventors: Muhammad R. Hussain, David A. Carlson, Gregg A. Bouchard, Trent Parker
-
Publication number: 20140337387Abstract: An improved content search mechanism uses a graph that includes intelligent nodes avoids the overhead of post processing and improves the overall performance of a content processing application. An intelligent node is similar to a node in a DFA graph but includes a command. The command in the intelligent node allows additional state for the node to be generated and checked. This additional state allows the content search mechanism to traverse the same node with two different interpretations. By generating state for the node, the graph of nodes does not become exponential. It also allows a user function to be called upon reaching a node, which can perform any desired user tasks, including modifying the input data or position.Type: ApplicationFiled: July 22, 2014Publication date: November 13, 2014Inventors: Muhammad R. Hussain, David A. Carlson, Gregg A. Bouchard, Trent Parker
-
Patent number: 8818921Abstract: An improved content search mechanism uses a graph that includes intelligent nodes avoids the overhead of post processing and improves the overall performance of a content processing application. An intelligent node is similar to a node in a DFA graph but includes a command. The command in the intelligent node allows additional state for the node to be generated and checked. This additional state allows the content search mechanism to traverse the same node with two different interpretations. By generating state for the node, the graph of nodes does not become exponential. It also allows a user function to be called upon reaching a node, which can perform any desired user tasks, including modifying the input data or position.Type: GrantFiled: September 27, 2013Date of Patent: August 26, 2014Assignee: Cavium, Inc.Inventors: Muhammad R. Hussain, David A. Carlson, Gregg A. Bouchard, Trent Parker
-
Patent number: 8661266Abstract: Disclosed are systems and methods for protecting secret device keys, such as High-bandwidth Digital Content Protection (HDCP) device keys. Instead of storing secret device keys in the plain, a security algorithm and one or more protection keys are stored on the device. The security algorithm is applied to the secret device keys and the one or more protection keys to produce encrypted secret device keys. The encrypted secret device keys are then stored either on chip or off-chip.Type: GrantFiled: April 20, 2011Date of Patent: February 25, 2014Assignee: Cavium, Inc.Inventors: Harri Hakkarainen, Amer Haider, Muhammad Hussain, Trent Parker
-
Publication number: 20140032607Abstract: An improved content search mechanism uses a graph that includes intelligent nodes avoids the overhead of post processing and improves the overall performance of a content processing application. An intelligent node is similar to a node in a DFA graph but includes a command. The command in the intelligent node allows additional state for the node to be generated and checked. This additional state allows the content search mechanism to traverse the same node with two different interpretations. By generating state for the node, the graph of nodes does not become exponential. It also allows a user function to be called upon reaching a node, which can perform any desired user tasks, including modifying the input data or position.Type: ApplicationFiled: September 27, 2013Publication date: January 30, 2014Applicant: Cavium, Inc.Inventors: Muhammad R. Hussain, David A. Carlson, Gregg A. Bouchard, Trent Parker
-
Patent number: 8560475Abstract: An improved content search mechanism uses a graph that includes intelligent nodes avoids the overhead of post processing and improves the overall performance of a content processing application. An intelligent node is similar to a node in a DFA graph but includes a command. The command in the intelligent node allows additional state for the node to be generated and checked. This additional state allows the content search mechanism to traverse the same node with two different interpretations. By generating state for the node, the graph of nodes does not become exponential. It also allows a user function to be called upon reaching a node, which can perform any desired user tasks, including modifying the input data or position.Type: GrantFiled: September 12, 2005Date of Patent: October 15, 2013Assignee: Cavium, Inc.Inventors: Muhammad R. Hussain, David A. Carlson, Gregg A. Bouchard, Trent Parker
-
Publication number: 20120143854Abstract: In a method and apparatus for analyzing nodes of a Deterministic Finite Automata (DFA), an accessibility ranking, based on a DFA graph geometrical configuration, may be determined in order to determine cacheable portions of the DFA graph in order to reduce the number of external memory accesses. A walker process may be configured to walk the graph in a graph cache as well as main memory. The graph may be generated in a manner allowing each arc to include information if the node it is pointing to is stored in the graph cache or in main memory. The walker may use this information to determine whether or not to access the next arc in the graph cache or in main memory.Type: ApplicationFiled: December 5, 2011Publication date: June 7, 2012Applicant: Cavium, Inc.Inventors: Rajan Goyal, Muhammad Raghib Hussain, Trent Parker
-
Publication number: 20120011373Abstract: Disclosed are systems and methods for protecting secret device keys, such as High-bandwidth Digital Content Protection (HDCP) device keys. Instead of storing secret device keys in the plain, a security algorithm and one or more protection keys are stored on the device. The security algorithm is applied to the secret device keys and the one or more protection keys to produce encrypted secret device keys. The encrypted secret device keys are then stored either on chip or off-chip.Type: ApplicationFiled: April 20, 2011Publication date: January 12, 2012Applicant: CAVIUM NETWORKSInventors: Harri Hakkarainen, Amer Haider, Muhammad Hussain, Trent Parker
-
Patent number: 8086609Abstract: In a method and apparatus for analyzing nodes of a Deterministic Finite Automata (DFA), an accessibility ranking, based on a DFA graph geometrical configuration, may be determined in order to determine cacheable portions of the DFA graph in order to reduce the number of external memory accesses. A walker process may be configured to walk the graph in a graph cache as well as main memory. The graph may be generated in a manner allowing each arc to include information if the node it is pointing to is stored in the graph cache or in main memory. The walker may use this information to determine whether or not to access the next arc in the graph cache or in main memory.Type: GrantFiled: November 1, 2007Date of Patent: December 27, 2011Assignee: Cavium, Inc.Inventors: Rajan Goyal, Muhammad Raghib Hussain, Trent Parker
-
Publication number: 20090119279Abstract: In a method and apparatus for analyzing nodes of a Deterministic Finite Automata (DFA), an accessibility ranking, based on a DFA graph geometrical configuration, may be determined in order to determine cacheable portions of the DFA graph in order to reduce the number of external memory accesses. A walker process may be configured to walk the graph in a graph cache as well as main memory. The graph may be generated in a manner allowing each arc to include information if the node it is pointing to is stored in the graph cache or in main memory. The walker may use this information to determine whether or not to access the next arc in the graph cache or in main memory.Type: ApplicationFiled: November 1, 2007Publication date: May 7, 2009Applicant: Cavium Networks, Inc.Inventors: Rajan Goyal, Muhammad Raghib Hussain, Trent Parker
-
Publication number: 20060085533Abstract: An improved content search mechanism uses a graph that includes intelligent nodes avoids the overhead of post processing and improves the overall performance of a content processing application. An intelligent node is similar to a node in a DFA graph but includes a command. The command in the intelligent node allows additional state for the node to be generated and checked. This additional state allows the content search mechanism to traverse the same node with two different interpretations. By generating state for the node, the graph of nodes does not become exponential. It also allows a user function to be called upon reaching a node, which can perform any desired user tasks, including modifying the input data or position.Type: ApplicationFiled: September 12, 2005Publication date: April 20, 2006Inventors: Muhammad Hussain, David Carlson, Gregg Bouchard, Trent Parker
-
Publication number: 20060059286Abstract: In a multi-core processor, a high-speed interrupt-signal interconnect allows more than one of the processors to be interrupted at substantially the same time. For example, a global signal interconnect is coupled to each of the multiple processors, each processor being configured to selectively provide an interrupt signal, or pulse thereon. Preferably, each of the processor cores is capable of pulsing the global signal interconnect during every clock cycle to minimize delay between a triggering event and its respective interrupt signal. Each of the multiple processors also senses, or samples the global signal interconnect, preferably during the same cycle within which the pulse was provided, to determine the existence of an interrupt signal. Upon sensing an interrupt signal, each of the multiple processors responds to it substantially simultaneously. For example, an interrupt signal sampled by each of the multiple processors causes each processor to invoke a debug handler routine.Type: ApplicationFiled: January 25, 2005Publication date: March 16, 2006Applicant: Cavium NetworksInventors: Michael Bertone, David Carlson, Richard Kessler, Philip Dickinson, Muhammad Hussain, Trent Parker