Patents by Inventor Jeffery M. Tanner

Jeffery M. Tanner 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: 11816493
    Abstract: A markup language is provided. The markup language describes the composition of automata networks. For example, the markup language uses elements that represent automata processing resources. These resources may include at least one of a state transition element, a counter element, and a Boolean element as respective automata processing resources.
    Type: Grant
    Filed: November 18, 2020
    Date of Patent: November 14, 2023
    Assignee: Micron Technology, Inc.
    Inventors: Paul Glendenning, Jeffery M. Tanner, Michael C. Leventhal, Harold B Noyes
  • Patent number: 10929764
    Abstract: An apparatus includes a state machine engine. The state machine engine may also include an automaton, whereby the automaton is configured to analyze data from a beginning of an input data stream until a point when an end of data signal is seen. The automaton may further be configured to report an event representative of a satisfaction of a Boolean clause of a conjunctive normal form (CNF) Boolean expression representative of a Boolean Satisfiability problem (SAT) by a portion of the input data stream.
    Type: Grant
    Filed: August 31, 2017
    Date of Patent: February 23, 2021
    Assignee: Micron Technology, Inc.
    Inventors: Matthew T. Grimm, Jeffery M. Tanner
  • Patent number: 10846103
    Abstract: A markup language is provided. The markup language describes the composition of automata networks. For example, the markup language uses elements that represent automata processing resources. These resources may include at least one of a state transition element, a counter element, and a Boolean element as respective automata processing resources.
    Type: Grant
    Filed: October 5, 2016
    Date of Patent: November 24, 2020
    Assignee: Micron Technology, Inc.
    Inventors: Paul Glendenning, Jeffery M. Tanner, Michael C. Leventhal, Harold B Noyes
  • Publication number: 20200293804
    Abstract: An automaton is implemented in a state machine engine. The automaton is configured to observe data from a beginning of an input data stream until a point when an end of data (EOD) signal is seen. Additionally the automaton is configured to report an event only when one and only one occurrence of a target symbol is seen in the input data stream.
    Type: Application
    Filed: May 28, 2020
    Publication date: September 17, 2020
    Inventors: Harold B Noyes, Michael C. Leventhal, Jeffery M. Tanner, Inderjit Singh Bains
  • Patent number: 10691964
    Abstract: An automaton is implemented in a state machine engine. The automaton is configured to observe data from a beginning of an input data stream until a point when an end of data (EOD) signal is seen. Additionally the automaton is configured to report an event only when one and only one occurrence of a target symbol is seen in the input data stream.
    Type: Grant
    Filed: October 5, 2016
    Date of Patent: June 23, 2020
    Assignee: Micron Technology, Inc.
    Inventors: Harold B Noyes, Michael C. Leventhal, Jeffery M. Tanner, Inderjit Singh Bains
  • Publication number: 20180114131
    Abstract: An apparatus includes a state machine engine. The state machine engine may also include an automaton, whereby the automaton is configured to analyze data from a beginning of an input data stream until a point when an end of data signal is seen. The automaton may further be configured to report an event representative of a satisfaction of a Boolean clause of a conjunctive normal form (CNF) Boolean expression representative of a Boolean Satisfiability problem (SAT) by a portion of the input data stream.
    Type: Application
    Filed: August 31, 2017
    Publication date: April 26, 2018
    Inventors: Matthew T. Grimm, Jeffery M. Tanner
  • Publication number: 20180113951
    Abstract: An apparatus includes a state machine engine. The state machine engine may also include an automaton, whereby the automaton is configured to analyze data from a query related to solving a graph. The automaton may further be configured to report an event representative of a satisfaction of a node solving a hop of the graph by a portion of the input data stream.
    Type: Application
    Filed: August 31, 2017
    Publication date: April 26, 2018
    Inventor: Jeffery M. Tanner
  • Publication number: 20170098157
    Abstract: An automaton is implemented in a state machine engine. The automaton is configured to observe data from a beginning of an input data stream until a point when an end of data (EOD) signal is seen. Additionally the automaton is configured to report an event only when one and only one occurrence of a target symbol is seen in the input data stream.
    Type: Application
    Filed: October 5, 2016
    Publication date: April 6, 2017
    Inventors: Harold B Noyes, Michael C. Leventhal, Jeffery M. Tanner, Inderjit Singh Bains
  • Publication number: 20170097852
    Abstract: A markup language is provided. The markup language describes the composition of automata networks. For example, the markup language uses elements that represent automata processing resources. These resources may include at least one of a state transition element, a counter element, and a Boolean element as respective automata processing resources.
    Type: Application
    Filed: October 5, 2016
    Publication date: April 6, 2017
    Inventors: Paul Glendenning, Jeffery M. Tanner, Michael C. Leventhal, Harold B Noyes