Data processing and management
AssigneeTwilio Inc.
InventorsChristopher O'Hara, Achille Roussel
Life of this patent
Estimating the term…
Abstract
Various embodiments include systems, methods, and non-transitory computer-readable media for managing data. Consistent with these embodiments, a method includes identifying an arbitrary graph that includes a plurality of jobs for execution; determining a retry schedule associated with the arbitrary graph; converting the arbitrary graph into a directed acyclic graph based on the plurality of retry attempts; and processing, by the execution engine, the directed acyclic graph.
Claims20
A method comprising:
- identifying a directed acyclic graph comprising a plurality of vertices, each vertex representing a job for execution;
- determining that a set of retry attempts of a job exceeds a threshold value, the set of retry attempts being represented by a plurality of edges associated with a vertex representing the job;
- and
- grouping the plurality of edges using one or more shared edges.
A system comprising:
- at least one memory storing instructions;
- and
- one or more hardware processors communicatively coupled to the at least one memory and configured by the instructions to perform operations comprising:
- identifying a directed acyclic graph comprising a plurality of vertices, each vertex representing a job for execution;
- determining that a set of retry attempts of a job exceeds a threshold value, the set of retry attempts being represented by a plurality of edges associated with a vertex representing the job;
- and
- grouping the plurality of edges using one or more shared edges.
A non-transitory computer-readable medium comprising instructions that, when executed by a hardware processor of a device, cause the device to perform operations comprising:
- identifying a directed acyclic graph comprising a plurality of vertices, each vertex representing a job for execution;
- determining that a set of retry attempts of a job exceeds a threshold value, the set of retry attempts being represented by a plurality of edges associated with a vertex representing the job;
- and
- grouping the plurality of edges using one or more shared edges.
Dependencies are inferred from the claim text.