Abstract: A computer system for executing a processing graph including: (A) accessing a graph definition of the processing graph from a nodes database, each node of the processing graph representing a component of computation performed by at least one program referenced by that node; (B) constructing the processing graph in the at least one memory device; (C) identifying at least one group of nodes in the processing graph; (D) traversing the at least one group of nodes; (E) upon visiting a node of the at least one group of nodes, accessing a node definition of the node from the nodes database, the node definition identifying a program referenced by the node; (F) executing the program to generate an output; and (G) passing the output to a parent node of the node, the parent node using the output during processing of the parent node.

Abstract: A computer system for executing a processing graph including: (A) access a graph definition of the processing graph from a nodes database, the graph definition identifies nodes and edges, each edge connects a pair of nodes, each node represents a component of computation performed by at least one program referenced by that node; (B) constructing the processing graph in the memory; (C) traversing the processing graph to visit and process each node in the processing graph; (D) upon visiting a first node of the processing graph, accessing a first node definition of the first node from the nodes database, the first node definition identifies a first program; (E) executing the first program to generate a first output; and (F) passing the first output to a parent node of the first node, the parent node uses the first output during processing of the parent node.