Managing A Workload In A Database

• US 20090178042A1
• Filed: 10/22/2008
• Published: 07/09/2009
• Est. Priority Date: 01/03/2008
• Status: Active Grant

• Current Assignee: Micro Focus LLC (Open Text Corporation)
• Original Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Inventors: Dayal, Umeahwar, Mehta, Abhay, Gupta, Chetan Kumar
• Granted Patent: US 8,627,330 B2
• Time in Patent Office: Days
• US Class Current: 718/101
• CPC Class Codes: G06F 2209/484 Precedence
• CPC Class Codes: G06F 9/4881 Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues

Abstract

Described herein is a workload manager for managing a workload in a database that includes: an admission controller operating to divide the workload into a plurality of batches, with each batch having at least one workload process to be performed in the database, and each batch having a memory requirement based on the available memory for processing workloads in the database; a scheduler operating to assign a unique priority to each of the at least one workload process in each of the plurality of batches, the unique priority provides an order in which each workload process is executed in the database; and an execution manager operating to execute the at least one workload process in each of the plurality of batches in accordance with the unique priority assigned to each workload process.

Claims

1. A workload manager for managing a workload in a database, comprising:

an admission controller operating to divide the workload into a plurality of batches, with each batch having at least one workload process to be performed in the database, and each batch having a memory requirement based on the available memory for processing workloads in the database;

a scheduler operating to assign a unique priority to each of the at least one workload process in each of the plurality of batches, the unique priority provides an order in which each workload process is executed in the database; and

an execution manager operating to execute the at least one workload process in each of the plurality of batches in accordance with the unique priority assigned to each workload process.

2. The workload manager of claim 1, wherein the workload comprises a plurality of database queries, and each of the plurality of batches includes at least one database query as the at least one workload process.

3. The workload manager of claim 1, wherein the admission controller further operating to arrange the at least one workload process in each of the plurality of batches in order of memory requirement so as to divide the workload into the plurality of batches.

4. The workload manager of claim 1, wherein the scheduler operating to randomly assign a unique priority to each of the at least one workload process in each of the plurality of batches.

5. The workload manager of claim 1, wherein the scheduler operating to assign a unique priority to each of the at least one workload process in each of the plurality of batches based on a memory requirement of the at least one workload process.

6. The workload manager of claim 5, wherein the at least one workload process in a first batch of the plurality of batches comprises a plurality of workload processes, and the one process with the highest memory requirement in the first batch is assigned the highest priority as its unique priority.

7. The workload manager of claim 1, wherein the scheduler operating to assign a unique priority to each of the at least one workload process in each of the plurality of batches based on a characteristic of a resource in the database.

8. A method for managing a workload of queries in a database, comprising:

dividing the workload of queries into a plurality of batches of queries such that each batch has a memory requirement of no more than an average available memory for processing workloads in the database;

assigning a unique priority to each of the queries in each of the plurality of batches, the unique priority provides an order in which each workload process is executed in the database; and

executing each of the plurality of batches by;

a) executing one of the plurality of batches based on the unique priority assigned to each of the queries in the one batch;

b) determining whether the execution of the one batch is done; and

c) executing another one of the plurality of batches once the execution of the one batch is done.

9. The method of claim 8, wherein determining whether the execution of the one batch is done comprises at least one of:

first determining whether a predetermined threshold number of queries in the one batch is done;

second determining whether a usage of memory of the database by the one batch falls below a predetermined memory threshold; and

third determining whether an average utilization of a processing power of the database by the one batch falls below a predetermined processing threshold.

10. The method of claim 8, wherein determining whether the execution of the one batch is done comprises the steps of first determining, second determining, and third determining.

11. The method of claim 8, wherein dividing the workload of queries into a plurality of batches of queries comprises:

arranging the queries in the workload in descending order of memory requirement;

assigning a first one of the queries in the arranged descending order to one of the plurality of batches that is able to accommodate the each query without exceeding the average available memory for processing workloads in the database; and

repeating the step of assigning for each of the queries, in the arranged descending order, until of the of the queries in the workload are assigned to the plurality of batches.

12. The method of claim 8, wherein assigning a unique priority to each of the queries in each of the plurality of batches comprises:

uniquely ordering the queries in each of the plurality of batches; and

assigning a unique priority to each of the queries in the each batch from highest priority to lowest priority in accordance with the unique ordering of the queries in the each batch.

13. The method of claim 12, wherein uniquely ordering the queries comprises:

uniquely ordering the queries in each of the plurality of batches according to an ordering function that randomly orders the queries.

14. The method of claim 12, wherein unique ordering the queries comprises:

uniquely ordering the queries in each of the plurality of batches according to an ordering function that is based a memory requirement of each of the queries in the each batch.

15. The method of claim 14, wherein uniquely ordering the queries further comprises:

providing the ordering function that ranks first a query in the each batch that has the highest memory requirement and ranks last a query in the each batch that has the lowest memory requirement.

16. The method of claim 15, wherein assigning the unique priority to each of the queries in the each batch from highest priority to lowest priority by assigning the highest priority with the first ranked query and the lowest priority with the last-ranked query.

20. The computer readable medium of claim 12, wherein the encoded programming code executable to uniquely order the queries comprises encoded programming code executable to perform one of:

uniquely ordering the queries in each of the plurality of batches according to an ordering function that randomly orders the queries; and

uniquely ordering the queries in each of the plurality of batches according to an ordering function that is based a memory requirement of each of the queries in the each batch.

17. A computer readable medium on which is encoded programming code executable by a processing unit in a computerized system to:

divide the workload of queries into a plurality of batches of queries such that each batch has a memory requirement of no more than an average available memory for processing workloads in the database;

assign a unique priority to each of the queries in each of the plurality of batches, the unique priority provides an order in which each workload process is executed in the database; and

execute each of the plurality of batches by;

a) executing one of the plurality of batches based on the unique priority assigned to each of the queries in the one batch;

b) determining whether the execution of the one batch is done;

c) executing another one of the plurality of batches once the execution of the one batch is done.

18. The computer readable medium of claim 17, wherein the encoded programming code executable to divide the workload of queries into a plurality of batches of queries comprises encoded programming code executable by the processing unit to:

arrange the queries in the workload in descending order of memory requirement;

assign a first one of the queries in the arranged descending order to one of the plurality of batches that is able to accommodate the each query without exceeding the average available memory for processing workloads in the database; and

repeat the step of assigning for each of the queries, in the arranged descending order, until of the of the queries in the workload are assigned to the plurality of batches.

19. The computer readable medium of claim 17, wherein the encoded programming code executable to assign a unique priority to each of the queries in each of the plurality of batches comprises encoded programming code executable by the processing unit to:

uniquely order the queries in each of the plurality of batches; and

assign a unique priority to each of the queries in the each batch from highest priority to lowest priority in accordance with the unique ordering of the queries in the each batch.