Disclosed herein are systems, on-chip processors, and methods for executing decision trees. Decision tree circuitry retrieves a plurality of decision trees, which include feature locations and threshold values. A subset of the decision nodes includes next node data. The decision tree circuitry executes the decision nodes and determines next decision nodes to be retrieved and executed based on outcomes of the execution of the decision nodes. First outcomes of decision tree node executions result in determining the next decision nodes of the plurality of decision nodes based on the next node data. Second outcomes of the decision tree node executions result in determining the next decision nodes that are adjacent to currently executing nodes of the plurality of decision nodes.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A method of executing a decision tree, comprising: retrieving by decision tree circuitry, a plurality of decision nodes, ones of the decision nodes including at least feature locations and threshold values, a subset of the decision nodes also including next node data; executing the decision nodes by the decision tree circuitry; and determining by the decision tree circuitry next decision nodes to be retrieved and executed, the determining based on outcomes of executing the decision nodes, wherein: first outcomes of decision tree node executions result in determining the next decision nodes of the plurality of decision nodes based on the next node data; and second outcomes of the decision tree node executions result in determining the next decision nodes that are adjacent to currently executing nodes of the plurality of decision nodes. 2. The method of claim 1, wherein the decision tree circuitry comprises a portion of a general purpose processor, and the method further comprises performing one or more of the retrieving, the executing, or the determining responsive to receipt of an atomic decision tree command to score a decision tree associated with the plurality of decision nodes. 3. The method of claim 1, wherein the decision tree circuitry is at least partly included in one or more of: a system-on-chip, an application-specific integrated circuit, or a programmable logic device. 4. The method of claim 1, wherein: the subset of the decision nodes is a first subset of the decision nodes, ones of a second subset of the decision nodes include one or more leaf values, and a final outcome of the decision tree node executions results in outputting one of the one or more leaf values as an output of the decision tree-walking thread. 5. The method of claim 1, wherein the decision tree is one of a plurality of tree-walking threads executed by the decision tree circuitry. 6. The method of claim 5, wherein the plurality of multi-threaded tree walking threads are executed in a pipeline of the decision tree circuitry. 7. The method of claim 1, further comprising storing the plurality of decision nodes within a dedicated memory of the decision tree circuitry. 8. The method of claim 1, further comprising determining the next node addresses by adding the next node data to current locations, within a decision tree table containing the plurality of decision nodes, of currently executing decision nodes. 9. The method of claim 1, further comprising reading, for ones of the decision nodes, feature values identified by corresponding ones of the feature locations, wherein the executing the decision nodes includes comparing the threshold values to feature values. 10. A decision tree processor comprising: a memory including a decision tree table; and tree-walking circuitry configured to: retrieve decision nodes from the decision tree table, ones of the decision nodes including at least feature locations and threshold values, a subset of the decision nodes also including next node data; execute the decision nodes, and determine next decision nodes to be retrieved and executed based on outcomes of decision node execution, wherein: first outcomes of decision tree node executions result in determining the next decision nodes in the decision tree table based on the next node data; and second outcomes of the decision tree node executions result in determining the next decision nodes that are adjacent to currently executing nodes in the decision tree table. 11. The decision tree processor of claim 10, wherein the subset of the decision nodes is a first subset, and ones of a second subset of the decision nodes includes leaf values, and, based at least on an execution outcome of a particular one of the second subset of the decision nodes, the tree-walking circuitry is further configured to set an output value for the decision tree based on a particular leaf value of the particular one of the second subset of the decision nodes. 12. The decision tree processor of claim 10, wherein the tree-walking circuitry is further configured to: read, based on the feature locations, feature values from a feature storage communicatively coupled to the tree-walking circuitry; and execute the decision nodes by comparison of the feature values to the threshold values. 13. The decision tree processor of claim 10, wherein the tree-walking circuitry implements a multi-stage decision tree-walking pipeline, the decision tree-walking pipeline including at least read circuitry to read the decision nodes from the decision tree table, and execution circuitry to execute the decision nodes and to determine the next decision nodes based on the outcomes of the executions. 14. The decision tree processor of claim 13, wherein: the memory includes a plurality of decision tree tables; and the read circuitry is configured to read a first decision node from a first one of the plurality of decision tree tables during a time that the execution circuitry executes a second decision node from a second one of the plurality of decision tree tables. 15. A system comprising: a feature storage comprising a plurality of feature values; and a decision tree processor including a tree-walking circuit, the tree-walking circuit comprising: read circuitry to read decision tree nodes from decision tree tables, ones of the decision tree nodes including at least feature addresses and threshold values, the decision tree nodes further including one or more of next node data, first leaf values, and second leaf values; feature circuitry to read feature values from the feature storage based on ones of the feature addresses; execution circuitry to compare ones of the threshold values to ones of the feature values and to select, based on the compares, either next decision tree node addresses or output values for ones of the decision trees, wherein: ones of the next decision tree node addresses are determined from either adjacent decision tree nodes or from ones of the next node data, and ones of the output values are determined either from ones of the first leaf values or ones of the second leaf values. 16. The system of claim 15, wherein the read circuitry, the feature circuitry, and the execution circuitry are part of a tree-walking pipeline. 17. The system of claim 15, wherein the read circuitry, the feature circuitry, and the execution circuitry concurrently: read a first decision tree node associated with a first decision tree; read a second feature associated with a second decision tree; and execute a third decision tree node associated with a third decision tree. 18. The system of claim 15, wherein the tree-walking circuit processes a plurality of decision trees as different threads, and the tree-walking circuit further comprises thread circuitry to determine a next thread from a list of decision tree threads, the execution circuitry to de-link a particular decision tree thread from the list upon outputting an output value for the particular decision tree thread. 19. The system of claim 15, wherein the execution circuitry selects one or more of: a first possible next decision tree node location based on the next node data, a second possible next decision tree node location based on the adjacent decision tree node, a first output value based on the first leaf value, and a second output value based on the second leaf value. 20. The system of claim 15, wherein the decision tree nodes are stored in a memory of the decision tree circuitry, the decision tree circuitry being loadable with new decision tree nodes.