Scheduling memory usage of a workload

• US 8,627,325 B2
• Filed: 10/24/2008
• Issued: 01/07/2014
• Est. Priority Date: 01/03/2008
• Status: Expired due to Fees

• Current Assignee: Micro Focus LLC (Open Text Corporation)
• Original Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Inventors: Gupta, Chetan Kumar, Mehta, Abbay, Dayal, Umeshwar
• Primary Examiner(s): Coleman, Eric
• Application Number:
  US12/258,226
• Publication Number:
  US 20090178045A1
• Time in Patent Office: 1,901 Days
• Field of Search: None
• US Class Current: 718/103
• CPC Class Codes: G06F 9/5016 the resource being the memory

Abstract

Described herein is a method for scheduling memory usage of a workload, the method comprising: receiving the workload, wherein the workload includes a plurality of jobs; determining a memory requirement to execute each of the plurality of jobs; arranging the plurality of jobs in an order of the memory requirements of the plurality of jobs such that the job with the largest memory requirement is at one end of the order and the job with the smallest memory requirement is at the other end of the order; assigning in order a unique priority to each of the plurality of jobs in accordance with the arranged order such that the job with the largest memory requirement is assigned the highest priority for execution and the job with the smallest memory requirement is assigned the lowest priority for execution; and executing the workload by concurrently executing the jobs in the workload in accordance with the arranged order of the plurality of jobs and the unique priority assigned to each of the plurality of jobs.

Claims

1. A method for scheduling memory usage of a workload, comprising:

receiving the workload, wherein the workload includes a plurality of jobs;

determining a memory requirement to execute each of the plurality of jobs;

arranging the plurality of jobs in an order of the memory requirements of the plurality of jobs such that the job with the largest memory requirement is at one end of the order and the job with the smallest memory requirement is at the other end of the order;

assigning a unique priority to each of the plurality of jobs in accordance with the arranged order such that the job with a largest memory requirement is assigned the highest priority for execution and the job with the smallest memory requirement is assigned the lowest priority for execution, wherein each assigned unique priority is different from any other of the assigned unique priorities; and

executing the workload in accordance with the arranged order of the plurality of jobs and the unique priority assigned to each of the plurality of jobs, from highest to lowest priority.

2. The method of claim 1, wherein receiving the workload comprises:

receiving the workload as one of a plurality of batches of jobs divided from a larger workload.

3. The method of claim 1, wherein executing the workload comprises:

concurrently initiating execution of the plurality of jobs; and

determining, in the arranged order of the plurality of jobs, whether there is available memory to execute each of the plurality of jobs based on a memory requirement of each job.

4. The method of claim 3, wherein executing the workload further comprises:

upon determining that there is available memory to execute one of the plurality of jobs,

a) allocating a first memory from the available memory to execute the one job; and

b) determining whether a remainder of the available memory after the allocation of the first memory is sufficient to execute another one of the plurality of jobs.

5. The method of claim 4, wherein executing the workload further comprises:

upon determining that there is available memory to execute one of the plurality of jobs, determining whether the assigned unique priority of the one job is higher than the assigned unique priority of a current job being executed; and

upon determining that the assigned unique priority of the one job is higher than the assigned unique priority of the current job, ceasing the execution of the current job in order to execute the one job.

6. The method of claim 5, further comprising:

releasing the first memory allocated to the one job once execution of the one job is complete; and

returning the first memory as part of the available memory to execute one of the plurality of jobs.

7. The method of claim 3, wherein executing the workload further comprises:

upon determining that there is not available memory to execute one of the plurality of jobs, placing the one job in a waiting queue until there is available memory to execute the one job.

8. The method of claim 7, wherein executing the workload further comprises:

once there is available memory to execute the one job in the waiting queue, allocating the available memory to execute the one job in the waiting queue with respect to other jobs in an order of the assigned unique priorities of the plurality of jobs such that a job with a higher priority in the waiting queue is given priority to use the available memory before a job with a lower priority.

9. The method of claim 1, wherein the plurality of jobs comprise a plurality queries to an electronic database.

10. A computerized system for executing a workload therein, wherein the workload includes a plurality of jobs to be executed, the computerized system comprises:

a processor to execute the workload;

a first memory storage device to execute the workload; and

a second memory storage device to provide instructions to the processor to;

determine a memory requirement of each of the plurality of jobs;

arrange the plurality of jobs in an order of the memory requirements of the plurality of jobs;

assign a unique priority, from highest priority to lowest priority, to each of the plurality of jobs in the arranged order of the plurality of jobs, wherein each assigned unique priority is different from any other of the assigned unique priorities; and

queue the execution of the plurality of jobs from highest priority to lowest priority based on the arranged order and the assigned unique priorities of the plurality of jobs.

11. The computerized system of claim 10, wherein to queue the execution of the plurality of jobs, the processor is to:

determine, for each of the plurality of jobs in the assigned order starting with the job with the highest priority, whether there is sufficient memory in the first memory storage device to execute each of the plurality of jobs based on the determined memory requirement of each job; and

then

execute a first job of the plurality of jobs, placing the first job in a waiting queue of the processor until there is sufficient memory in the first memory storage device to execute the first job.

12. The computerized system of claim 10, wherein to queue the execution of the plurality of jobs, the processor is to:

allocate memory in the first memory storage device to execute the plurality of jobs such that the memory is allocated to each of the plurality of jobs in the assigned order, wherein the first job with the highest priority is first allocated with the memory; and

determine whether a remainder of the memory in the first memory storage device after the first allocation is sufficient to execute one or more remaining ones of the plurality of jobs.

13. The computerized system of claim 12, wherein the processor is to execute the first job once the memory is first allocated and release the memory once the first job is completed such that the memory is available for the remainder of the plurality of jobs with the second job with the second highest priority given a next allocation of the memory.

14. The computerized system of claim 10, wherein the processor is to arrange the plurality of jobs in an order of the memory requirements of the plurality of jobs by arranging the job with the largest memory requirement on one end of the arranged order and the job with the smallest requirement on the other end of the arranged order.

15. The computerized system of claim 10, wherein the processor is to assign the unique priority to each of the plurality of jobs by assigning the highest priority to the job with the largest memory requirement and the lowest priority to the job with the smallest memory requirement.

16. The computerized system of claim 10, wherein the plurality of jobs comprise a plurality of queries to an electronic database.

17. The computerized system of claim 16, wherein the computerized system includes the electronic database.

18. A non-transitory computer readable medium encoded with programming code executed by a computer processor to:

receive the workload, wherein the workload includes a plurality of jobs;

determine a memory requirement to execute each of the plurality of jobs;

arrange the plurality of jobs in an order of the memory requirements of the plurality of jobs such that the job with the largest memory requirement is at one end of the order and the job with the smallest memory requirement is at the other end of the order;

assign a unique priority to each of the plurality of jobs in accordance with the arranged order such that the job with the largest memory requirement is assigned the highest priority for execution and the job with the smallest memory requirement is assigned the lowest priority for execution, wherein each assigned unique priority is different from any other of the assigned unique priorities; and

execute the workload in accordance with the arranged order of the plurality of jobs and the unique priority assigned to each of the plurality of jobs, from highest priority to lowest priority.

19. The non-transitory computer readable medium of claim 18, wherein the programming code to receive the workload comprises programming code to:

receive the workload as one of a plurality of batches of jobs divided from a larger workload.

20. The non-transitory computer readable medium of claim 18, wherein the programming code to execute the workload comprises programming code to:

concurrently initiate execution of the plurality of jobs; and

determine, in the arranged order of the plurality of jobs, whether there is available memory to execute each of the plurality of jobs based on the memory requirement of each job.