SYSTEMS AND METHODS FOR SCHEDULING, PROCESSING, AND MONITORING TASKS

• US 20080120620A1
• Filed: 09/27/2006
• Published: 05/22/2008
• Est. Priority Date: 09/27/2006
• Status: Active Grant

• Current Assignee: OL Security LLC (Intellectual Ventures LLC)
• Original Assignee: Raytheon Company (Rtx Corporation)
• Inventors: Renno, Gregory, Lett, Richard, Terwiel, Thomas
• Granted Patent: US 7,669,081 B2
• Time in Patent Office: Days
• US Class Current: 718/103
• CPC Class Codes: G06F 11/1438 Restarting or rejuvenating
• CPC Class Codes: G06F 11/1461 Backup scheduling policy
• CPC Class Codes: G06F 11/203 using migration
• CPC Class Codes: G06F 11/2046 where the redundant components share persistent storage G06F11/2043 takes precedence
• CPC Class Codes: G06F 2209/5021 Priority
• CPC Class Codes: G06F 2209/508 Monitor
• CPC Class Codes: G06F 9/485 Task life-cycle, e.g. stopping, restarting, resuming execution G06F9/4881 takes precedence
• CPC Class Codes: G06F 9/4881 Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
• CPC Class Codes: G06F 9/5038 considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration scheduling strategies G06F9/4881 and subgroups

Abstract

A computer-implemented method for performing a process is provided. The method comprises: (a) receiving a request to perform a process, the process comprising a plurality of tasks and at least a scheduler rule; (b) receiving a plurality of checkpoints associated with the process, each checkpoint comprising checkpoint state data and at least a respective checkpoint rule governing execution of the process; (c) determining a first task of the plurality of tasks to be scheduled into a priority queue, in accordance with the scheduler rule; (d) determining the first checkpoint of the plurality of checkpoints that is to be the first checkpoint used in processing the first task, in accordance with the scheduler rule; (e) creating the checkpoint state data for the first checkpoint; (f) saving the checkpoint state data for the first checkpoint; (g) processing the first task in accordance with the checkpoint rule associated with the first checkpoint; (h) determining the next task in the plurality of tasks to perform, based on the checkpoint rule associated with the first checkpoint; (i) updating the saved checkpoint data for the first checkpoint with the data and state associated with the first task; and (j) repeating steps (c) through (i) for each subsequent task and checkpoint, in accordance with the respective scheduler and checkpoint rules, until a predetermined condition has been reached.

Claims

1. A computer-implemented method for performing a process, the method comprising:

(a) receiving a request to perform a process, the process comprising a plurality of tasks and at least a scheduler rule

(b) receiving a plurality of checkpoints associated with the process, each checkpoint comprising checkpoint state data and at least a respective checkpoint rule governing execution of the process;

(c) determining a first task of the plurality of tasks to be scheduled into a priority queue, in accordance with the scheduler rule;

(d) determining the first checkpoint of the plurality of checkpoints that is to be the first checkpoint used in processing the first task, in accordance with the scheduler rule;

(e) creating the checkpoint state data for the first checkpoint;

(f) saving the checkpoint state data for the first checkpoint'"'"'

(g) processing the first task in accordance with the checkpoint rule associated with the first checkpoint;

(h) determining the next task in the plurality of tasks to perform, based on the checkpoint rule associated with the first checkpoint

(i) updating the saved checkpoint data for the first checkpoint with the data and state associated with the first task;

(j) repeating steps (c) through (i) for each subsequent task and checkpoint, in accordance with the respective scheduler and checkpoint rules, until a predetermined condition has been reached.

2. The method of claim 1, wherein the predetermined condition comprises determining that the process has finished.

3. The method of claim 1, wherein the predetermined condition comprises checking a rule to determine whether the process has finished.

4. The method of claim 1, wherein the predetermined condition comprises receiving an instruction to process the tasks in a specific order.

5. The method of claim 4, wherein the specific order deviates from the order specified in at least one of the scheduler and checkpoint rules.

6. The method of claim 1, wherein the predetermined condition comprises receiving a second request to perform a process, where the second request has a higher priority than the first request.

7. The method of claim 1 wherein the predetermined condition comprises determining that a task has not been scheduled properly.

8. The method of claim 1, wherein the predetermined condition comprises determining that a task has not been processed correctly.

9. The method of claim 1, wherein the predetermined condition comprises determining that a task is unhealthy.

10. The method of claim 9 further comprising:

(k) retrieving a stored checkpoint associated with the task that did not process correctly;

(l) recovering the failed task using the retrieved checkpoint; and

(m) repeating steps (d) through (j).

11. The method of claim 1, further comprising polling during at least one of steps (a) through (j) to determine whether processing of a task occurred correctly.

12. The method of claim 1, wherein each checkpoint is allocated a respective thread and a priority queue, and the method further comprises polling each thread to determine whether the thread is healthy.

13. The method of claim 12, further comprising reporting when a task has been processed.

14. The method of claim 13, further comprising determining, based on when a task has been processed, how long it takes for a given task to be performed.

15. The method of claim 1, wherein the predetermined condition comprises receiving an instruction to pause or stop the performing of the process.

16. The method of claim 1, further comprising sending a notification providing information regarding the progress made in performing the process.

17. The method of claim 9 further comprising providing a notification if a task is unhealthy.

18. The method of claim 11, further comprising attempting to perform at least one of the following actions if a task is unhealthy:

(i) restarting the task;

(ii) ending the task; and

(iii) moving processing to a different task

19. The method of claim 12 further comprising attempting to perform at least one of the following actions if a task is unhealthy:

(i) restarting the task;

(ii) ending the task; and

(iii) moving processing to a different task

20. A method for processing a logical thread, comprising the steps of:

(a) dividing the logical thread into a plurality of processor functions;

(b) modeling the state of the logical thread as a first task that is passed between processor functions, the first task comprising first task data and a first task state;

(c) adding the first task to a queue of tasks;

(d) persisting the first task in a first checkpoint;

(e) selecting a first processor function for processing the first task in accordance with a first rule;

(f) receiving the first task at a first processor function and using the first task data to perform a first process on the task;

(g) storing the output data from the first process in the first task;

(h) persisting the first task in a second checkpoint;

(i) selecting a second processor function for processing the first task in accordance with a second rule; and

(j) receiving the first task at the second processor function, wherein the second processor function uses the output data from the first process, if necessary, as the input data to the second process.

21. The method of claim 20, further comprising repeating steps (e) through (j) until all processor functions are complete.

22. The method of claim 20, further comprising tracking task data that is used across processor functions.

23. The method of claim 22, further comprising removing the tracked task data when all processor functions are complete.

24. The method of claim 20, wherein the modeling further comprises modeling the state of the logical thread as a second task that is passed between processor functions, the second task comprising first task data and a first task state and further comprising the steps of:

adding the second task to the queue of tasks;

persisting the second task in a third checkpoint; and

selecting the next task to be processed by the processor functions in accordance with a predetermined priority.

25. A computerized system for executing a process, the system comprising:

means for receiving requests to execute a business process and for providing responses to the requests;

means for processing incoming requests in accordance with a predetermined priority method;

means for saving data relating to the state of processing of the incoming request at one or more checkpoints; and

means for recovering data from a checkpoint, to restore the business process.

26. The system of claim 25, further comprising means for checking the health of the business process.

27. The system of claim 25, further comprising means for pausing the business process to permit a higher priority activity to occur.

28. The system of claim 25, further comprising means for changing the way the business process executes.