Systems and methods for caching task execution

• US 10,394,600 B2
• Filed: 12/28/2016
• Issued: 08/27/2019
• Est. Priority Date: 12/29/2015
• Status: Active Grant

• Current Assignee: Capital One Services LLC (Capital One Financial Corporation)
• Original Assignee: Capital One Services LLC (Capital One Financial Corporation)
• Inventors: Tao, Tao, Bardwaj, Santosh, Kumar, Subodh, Eugley, Brian
• Primary Examiner(s): Lee, Adam
• Application Number:
  US15/393,018
• Publication Number:
  US 20170185448A1
• Time in Patent Office: 972 Days
• CPC Class Codes: G06F 9/4881 Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
• CPC Class Codes: G06F 9/5033 considering data affinity
• CPC Class Codes: G06F 9/5066 Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs mappping at compile time, see G06F8/451
• CPC Class Codes: H04L 67/04 specially adapted for terminals or networks with limited capabilities; specially adapted for terminal portability
• CPC Class Codes: H04L 67/10 in which an application is distributed across nodes in the network software deployment G06F8/60; multiprogramming arrangements G06F9/46
• CPC Class Codes: H04L 67/568 Storing data temporarily at an intermediate stage, e.g. caching
• CPC Class Codes: H04L 67/60 Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources admission control or resource allocation H04L47/70
• CPC Class Codes: H04L 67/61 taking into account QoS or priority requirements
• CPC Class Codes: H04L 67/63 Routing a service request depending on the request content or context

Abstract

Certain disclosed embodiments provide improved systems and methods for processing jobs. The method comprises steps including receiving, from a client device over a network, information representing a job and generating at least two tasks representative of the job. The method further comprises, for each task, assigning, by a processor, a signature to the task representative of whether the task has been processed, determining at least one dataset related to the task, and assigning a signature to the determined at least one dataset. The method further comprises searching, by the processor, a data structure for the task signature, and based on the searching, sending the task over a network to a task executor for processing or locating results associated with the task. The method further comprises sending, over a network, a job result to the client device. Systems and computer-readable media are also provided.

Claims

1. A method for processing a job in a form of computer-executable code, comprising:

receiving, at a client device over a network, information representing the job;

receiving the job at a job scheduler of a master device;

dividing, by the job scheduler, the job into at least two tasks comprising a first task and a second task;

for the first task;

generating, by the job scheduler, a signature corresponding to the first task representative of whether the first task has been processed;

searching, by a task scheduler of the master device, a data structure for the generated signature;

if the signature is found in the data structure retrieving a result associated with the first task by the task scheduler;

if the signature is not found in the data structure,

sending the first task by the task scheduler over the network to a task executor device,

processing the first task by the task executor device,

receiving a result of the first task processing by the task scheduler, and

storing the task result and a signature corresponding to the processed first task in the data structure by the task scheduler;

aggregating, by the job scheduler, the task result into a job result;

sending, by the job scheduler and over the network, the job result to the client device; and

processing the job result by the client device.

2. The method of claim 1, wherein the data structure comprises a Directed Acyclic Graph (DAG).

3. The method of claim 1, wherein the data structure comprises:

a first node comprising a task signature associated with the first task.

4. The method of claim 1, further comprising:

determining a dataset related to one or more tasks.

5. The method of claim 1, wherein sending the first task to a task executor device further comprises:

determining a value associated with the first task;

determining amounts of processor load for a plurality of task executor devices;

selecting one of the task executor devices based upon the determined value and the determined amounts of processor load; and

sending the first task to the selected task executor device.

6. The method of claim 5, wherein the at least two tasks are processed by different task executor devices in parallel.

7. A system, comprising:

a memory device storing instructions to implement the method of claim 1; and

at least one processor, configured to execute the instructions.

8. The system of claim 7, wherein the data structure comprises a Directed Acyclic Graph (DAG).

9. The system of claim 7, wherein the data structure comprises a first node comprising a task signature associated with the first task.

10. The system of claim 7, further comprising:

determining a dataset related to one or more tasks.

11. The system of claim 7, wherein sending the first task to a task executor device further comprises:

determining a value associated with the first task;

determining amounts of processor load for a plurality of task executor devices;

selecting one of the task executor devices based upon the determined value and the determined amounts of processor load; and

sending the first task to the selected task executor device.

12. The system of claim 11, wherein the at least two tasks are processed by different task executor devices in parallel.

13. A non-transitory computer-readable medium comprising instructions that, when executed by at least one processor, cause the at least one processor to perform the method of claim 1.

14. The non-transitory computer-readable medium of claim 13, wherein the data structure comprises a Directed Acyclic Graph (DAG).

15. The non-transitory computer-readable medium of claim 13, wherein the data structure comprises a first node comprising a task signature associated with the first task.

16. The non-transitory computer-readable medium of claim 13, further comprising:

determining a dataset related to one or more tasks.

17. The non-transitory computer-readable medium of claim 13, wherein sending the first task to a task executor device further comprises:

determining a value associated with the first task;

determining amounts of processor load for a plurality of task executor devices;

selecting one of the task executor devices based upon the determined value and the determined amounts of processor load; and

sending the first task to the selected task executor device.