System, method and computer program product for dynamically increasing resources utilized for processing tasks

• US 8,875,152 B2
• Filed: 04/21/2011
• Issued: 10/28/2014
• Est. Priority Date: 04/22/2010
• Status: Active Grant

• Current Assignee: Salesforce.com, Inc.
• Original Assignee: Salesforce.com, Inc.
• Inventors: Devadhar, Vijayanth, Oliver, Kevin
• Primary Examiner(s): Puente, Emerson
• Assistant Examiner(s): MILLS, PAUL V
• Application Number:
  US13/092,077
• Publication Number:
  US 20110265088A1
• Time in Patent Office: 1,286 Days
• Field of Search: None
• US Class Current: 718/105
• CPC Class Codes: G06F 16/21 Design, administration or maintenance of databases
• CPC Class Codes: G06F 9/5027 the resource being a machine, e.g. CPUs, Servers, Terminals
• CPC Class Codes: G06F 9/505 considering the load
• CPC Class Codes: G06F 9/5083 Techniques for rebalancing the load in a distributed system
• CPC Class Codes: H04L 41/5003 Managing SLA; Interaction between SLA and QoS
• CPC Class Codes: H04L 67/02 based on web technology, e.g. hypertext transfer protocol [HTTP]
• CPC Class Codes: H04L 67/1017 based on a round robin mechanism

Abstract

Mechanisms and methods are provided for dynamically increasing resources utilized for processing tasks. These mechanisms and methods for dynamically increasing resources utilized for processing tasks can enable embodiments to adjust processing power utilized for task processing. Further, adjusting processing power can ensure that quality of service goals set for processing tasks are achieved.

Claims

1. A computer program product embodied on a non-transitory computer-readable medium including computer code which, when executed by a processor, performs a method comprising:

identifying, at a first server of a plurality of servers, an unprocessed task in a queue of a system, the unprocessed task stored in the queue for processing, wherein each of the servers is configured to dequeue unprocessed tasks from the queue in accordance with a respective listener list identifying one or more types of tasks the server is allowed to process;

determining at the first server whether a quality of service policy associated with processing the unprocessed task has been violated;

releasing a permit which specifies at least the type of the unprocessed task and storing the permit in a permit table in response to a determination that the quality of service policy associated with processing the unprocessed task has been violated, wherein each of the servers periodically examines the permit table and may determine to claim one or more of the permits stored therein based on one or more conditions, and wherein claiming a permit comprises adding the type of task specified in the claimed permit to the listener list of the server claiming the permit;

identifying an age associated with the permit stored in the permit table;

determining whether the age associated with the permit exceeds an age threshold;

incrementing a number of unclaimed permits in response to a determination that the age associated with the permit exceeds the age threshold;

determining whether the number of unclaimed permits exceeds a predetermined number; and

triggering registration of a second server to the plurality of servers in response to a determination that the number of unclaimed permits exceeds the predetermined number.

2. The computer program product of claim 1, wherein the queue includes a table and the computer program product is operable such that the unprocessed task is stored in a row of the table such that the unprocessed task is identified by reading a row of the table.

3. The computer program product of claim 1, wherein identifying the unprocessed task includes identifying a type of the unprocessed task.

4. The computer program product of claim 3, wherein the computer program product is operable such that the quality of service policy is predetermined for the type of the unprocessed task.

5. The computer program product of claim 1, wherein the quality of service policy indicates an amount of time, upon storage in the queue, in which the unprocessed task is to be processed.

6. The computer program product of claim 5, wherein the computer program product is operable such that it is determined that the quality of service policy has been violated in response to a determination that the unprocessed task has been stored in the queue for more than the amount of time indicated by the quality of service policy.

7. The computer program product of claim 5, wherein the computer program product is operable such that it is determined that the quality of service policy has not been violated in response to a determination that the unprocessed task has been stored in the queue for less than the amount of time indicated by the quality of service policy.

8. The computer program product of claim 1, wherein registering the second server includes adding the type of the unprocessed task to the listener list of the second server.

9. The computer program product of claim 1, wherein the computer program product is operable such that after the second server is registered, the second server is unregistered from the plurality of servers in response to a determination that the number of unclaimed permits no longer exceeds the predetermined number.

10. The computer program product of claim 1, wherein triggering registration of the second server comprises a master process requesting that an additional server be added to the plurality of servers.

11. The computer program product of claim 1, wherein a server determining to claim a permit from the permit table comprises determining that the server has sufficient resources to act on the permit.

12. The computer program product of claim 1, wherein the computer program product is operable such that upon registration of the second server, the second server creates a listen list which includes at least the type of the unprocessed task.

13. The computer program product of claim 1, wherein the computer program product is operable such that each of the servers process unprocessed tasks from the queue based on utilization of resources of the server and utilization of resources remote to the server.

14. The computer program product of claim 13, wherein the computer program product is operable such that a server of the plurality of servers processes the unprocessed task in response to a determination that the utilization of the resources of the server is below a first predetermined threshold and the utilization of the resources remote to the server is below a second predetermined threshold.

15. The computer program product of claim 13, wherein the resources of the server include memory of the server and the resources remote to the server include a central processing unit of a database that provides the queue.

16. The computer program product of claim 1, wherein releasing the permit further comprise:

determining whether necessary service resources are available by comparing a current resource availability against a utilization behavior of the type of the unprocessed task; and

releasing the permit to be stored in the permit table in response to the determination that the quality of service policy associated with processing the unprocessed task has been violated and a determination that the necessary service resources are available.

17. The computer program product of claim 1, wherein the permit further includes an identification of a clustered database node associated with the unprocessed task.

18. A method comprising:

identifying, at a first server of a plurality of servers, an unprocessed task in a queue of a system, the unprocessed task stored in the queue for processing, wherein each of the servers is configured to dequeue unprocessed tasks from the queue in accordance with a respective listener list identifying one or more types of tasks the server is allowed to process;

determining at the first server whether a quality of service policy associated with processing the unprocessed task has been violated;

releasing a permit which specifies at least the type of the unprocessed task and storing the permit in a permit table in response to a determination that the quality of service policy associated with processing the unprocessed task has been violated, wherein each of the servers periodically examines the permit table and may determine to claim one or more of the permits stored therein based on one or more conditions, and wherein claiming a permit comprises adding the type of task specified in the claimed permit to the listener list of the server claiming the permit;

identifying an age associated with the permit stored in the permit table;

determining whether the age associated with the permit exceeds an age threshold;

incrementing a number of unclaimed permits in response to a determination that the age associated with the permit exceeds the age threshold;

determining whether the number of unclaimed permits exceeds a predetermined number; and

triggering registration of a second server to the plurality of servers in response to a determination that the number of unclaimed permits exceeds the predetermined number.

19. An apparatus, comprising:

a processor; and

a memory comprising computer readable instructions which, when executed by the processor, cause the apparatus to perform a method comprising;

identifying, at a first server of a plurality of servers, an unprocessed task in a queue of a system, the unprocessed task stored in the queue for processing, wherein each of the servers is configured to dequeue unprocessed tasks from the queue in accordance with a respective listener list identifying one or more types of tasks the server is allowed to process;

determining at the first server whether a quality of service policy associated with processing the unprocessed task has been violated;

releasing a permit which specifies at least the type of the unprocessed task and storing the permit in a permit table in response to a determination that the quality of service policy associated with processing the unprocessed task has been violated, wherein each of the servers periodically examines the permit table and may determine to claim one or more of the permits stored therein based on one or more conditions, and wherein claiming a permit comprises adding the type of task specified in the claimed permit to the listener list of the server claiming the permit;

identifying an age associated with the permit stored in the permit table;

determining whether the age associated with the permit exceeds an age threshold;

incrementing a number of unclaimed permits in response to a determination that the age associated with the permit exceeds the age threshold;

determining whether the number of unclaimed permits exceeds a predetermined number; and

triggering registration of a second server to the plurality of servers in response to a determination that the number of unclaimed permits exceeds the predetermined number.