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.
Claims18
A method comprising:
- identifying, by an execution engine, an arbitrary graph that includes a plurality of jobs for execution;
- determining a retry schedule associated with the arbitrary graph, the retry schedule includes a plurality of retry attempts that are configured for one or more jobs from the plurality of jobs;
- converting the arbitrary graph into a directed acyclic graph at least based on the plurality of retry attempts, the converting of the arbitrary graph comprising:
- identifying a set of retry attempts of a job from the plurality of jobs, the set of retry attempts exceeding a threshold, and
- grouping the set of retry attempts of the job using a shared edge;
- and
- processing, by the execution engine, the directed acyclic graph.
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, by an execution engine, an arbitrary graph that includes a plurality of jobs for execution;
- determining a retry schedule associated with the arbitrary graph, the retry schedule includes a plurality of retry attempts that are configured for one or more jobs from the plurality of jobs;
- converting the arbitrary graph into a directed acyclic graph at least based on the plurality of retry attempts, the converting of the arbitrary graph comprising:
- identifying a set of retry attempts of a job from the plurality of jobs, the set of retry attempts exceeding a threshold, and
- grouping the set of retry attempts of the job using a shared edge;
- and
- processing, by the execution engine, the directed acyclic graph.
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, by an execution engine, an arbitrary graph that includes a plurality of jobs for execution;
- determining a retry schedule associated with the arbitrary graph, the retry schedule includes a plurality of retry attempts that are configured for one or more jobs from the plurality of jobs;
- converting the arbitrary graph into a directed acyclic graph at least based on the plurality of retry attempts, the converting of the arbitrary graph comprising:
- identifying a set of retry attempts of a job from the plurality of jobs, the set of retry attempts exceeding a threshold, and
- grouping the set of retry attempts of the job using a shared edge;
- and
- processing, by the execution engine, the directed acyclic graph.
Dependencies are inferred from the claim text.