Patent ID: 9158610
Filing Date: 2015-10-13
Classification: G06F

Abstract:
1. A computer-implemented method, the method comprising the steps of: accessing, by a first server, a first task list comprising tuples defining a plurality of tasks, each task of the plurality of tasks having a stage and a maximum stage; receiving a first request to execute a first task on a first client machine, the first task having a first estimated time of completion, a first stage, and a first maximum stage which indicates a maximum stage of execution that can be executed in parallel with the first task, wherein each task is associated with at least one task and each stage is associated with one or more tasks; determining that the first task may execute based on there not being another pending or currently running task having a stage less than the first stage and a maximum stage less than the first maximum stage; when there is not another pending or currently running task having a stage less than the first stage and a maximum stage less than the first maximum stage, responding to the first request by indicating that the first task may execute; when the first server does not receive communications from the first client machine within a predetermined time interval, identifying failure at the first client machine; and upon identifying a failure at the first client machine: