Logical data flow mapping rules for (sub) graph isomorphism in a cluster computing environment
AssigneeXplenty Ltd.
InventorChris K. Wensel
Life of this patent
Estimating the term…
Abstract
A system and a method are disclosed for transforming cluster computing resources of a target system to match a user defined logical data flow so data processing between the source and target are functionally equivalent. The source logical dataflow is compatibly mapped to a target directed acyclic graph that represents the cluster computing resources. A series of subgraph assertion and transform operations are applied iteratively until the logical data flow is isomorphic with a directed acyclic graph. The assertion and transform operations are comprised of rules and assertions, which are maintained in a rules registry.
Claims13
A computer-implemented method of directed acyclic graph transformation, comprising:
- receiving a memory resident directed acyclic graph comprised of nodes connected by edges that describes resources in a cluster computing system;
- receiving a memory resident logical data flow comprised of rules and actions that describe instructions to structurally map or transform a directed acyclic graph;
- applying a function stored in a computer readable memory, wherein the function may use the logical data flow to map or modify the directed acyclic graph into an executable physical data flow;
- transmitting the executable physical data flow to the cluster computing system whereby the cluster computing system is functionally transformed to match the results of the executable physical data flow.
Dependencies are inferred from the claim text.