Facilitating dynamic hierarchical management of queue resources in an on-demand services environment

Patent metadata

Field	Value
Publication number	US-2016119246-A1
Application number	US-201414526159-A
Country	US
Kind code	A1
Filing date	Oct 28, 2014
Priority date	Oct 28, 2014
Publication date	Apr 28, 2016
Grant date	—

Abstract

In accordance with embodiments, there are provided mechanisms and methods for facilitating dynamic hierarchical management of queue resources in an on-demand services environment in a multi-tenant environment according to one embodiment. In one embodiment and by way of example, a method includes assigning, in runtime, by the database system, weights to at least one of a plurality of tenants and a plurality of message types. The assigned weights are capable of being dynamically scaled, in runtime, based on one or more factors. The method may further include allocating, in runtime, by the database system, resources to one or more of the plurality of tenants and one or more of the plurality of message types based on their assigned one or more weights of the weights. The allocated resources are capable of being dynamically modified, in runtime, based on scaling of the assigned weights.

First claim

What is claimed is:

1 . A database system-implemented method comprising:
assigning, in runtime, by the database system, weights to at least one of a plurality of tenants and a plurality of message types, wherein the assigned weights are capable of being dynamically scaled, in runtime, based on one or more factors; and allocating, in runtime, by the database system, resources to one or more of the plurality of tenants and one or more of the plurality of message types based on their assigned one or more weights of the weights, wherein the allocated resources are capable of being dynamically modified, in runtime, based on scaling of the assigned weights.

2 . The method of claim 1 , further comprising fetching, by the database system, queuing time associated with at least one of each of the plurality of the message types and each of the plurality of tenants associated with one or more of the plurality of message types.

3 . The method of claim 1 , further comprising allocating, by the database system, zero resources to at least one of one or more zero resource-consuming tenants of the plurality of tenants and one or more zero resource-consuming message types of the plurality of message types that are determined as using zero queuing time of the queuing time.

4 . The method of claim 1 , further comprising fetching, by the database system, one or more weights from a weights cache, wherein the one or more factors include one or more of importance levels, priority levels, and process urgency levels associated with at least one of one or more of the plurality of tenants and one or more of the plurality of message types.

5 . The method of claim 4 , wherein a weight identifies one or more of an importance level, a priority level, and a process urgency level associated with at least one of a message type and a tenant, wherein the weight is assigned to at least one of the message type and the tenant.

6 . The method of claim 1 , wherein allocating is based on a multi-level hierarchical formation, wherein the resources include thread resources relating to one or more application servers in a multi-tenant environment.

7 . The method of claim 6 , wherein the multi-level hierarchical formation includes a two-level hierarchical formation including at one of a tenant level associated with the plurality of tenants and a message type level associated with the plurality of message types.

8 . The method of claim 1 , further comprising:
monitoring, by the database system, resource consumption levels associated with the plurality of tenants and message types, wherein the resource consumption levels are monitored to ensure fair usage of the resources by the plurality of tenants and message types based on the assigned weights; and computing, by the database system, the weights relating to the plurality of tenants and message types prior to assigning the weights to at least one of the plurality of tenants and the plurality of message types.

9 . A system comprising:
a processor and a memory to execute instructions at the system; and a mechanism to: assign, in runtime, weights to at least one of a plurality of tenants and a plurality of message types, wherein the assigned weights are capable of being dynamically scaled, in runtime, based on one or more factors; and allocate, in runtime, resources to one or more of the plurality of tenants and one or more of the plurality of message types based on their assigned one or more weights of the weights, wherein the allocated resources are capable of being dynamically modified, in runtime, based on scaling of the assigned weights.

10 . The system of claim 9 , wherein the mechanism is further to fetch queuing time associated with at least one of each of the plurality of the message types and each of the plurality of tenants associated with one or more of the plurality of message types.

11 . The system of claim 9 , wherein the mechanism is further to allocate, by the database system, zero resources to at least one of one or more zero resource-consuming tenants of the plurality of tenants and one or more zero resource-consuming message types of the plurality of message types that are determined as using zero queuing time of the queuing time.

12 . The system of claim 9 , wherein the mechanism is further to fetch one or more weights from a weights cache, wherein the one or more factors include one or more of importance levels, priority levels, and process urgency levels associated with at least one of one or more of the plurality of tenants and one or more of the plurality of message types.

13 . The system of claim 12 , wherein a weight identifies one or more of an importance level, a priority level, and a process urgency level associated with at least one of a message type and a tenant, wherein the weight is assigned to at least one of the message type and the tenant.

14 . The system of claim 9 , wherein allocating is based on a multi-level hierarchical formation, wherein the resources include thread resources relating to one or more application servers in a multi-tenant environment.

15 . The system of claim 14 , wherein the multi-level hierarchical formation includes a two-level hierarchical formation including at one of a tenant level associated with the plurality of tenants and a message type level associated with the plurality of message types.

16 . The system of claim 9 , wherein the mechanism is further to:
monitor resource consumption levels associated with the plurality of tenants and message types, wherein the resource consumption levels are monitored to ensure fair usage of the resources by the plurality of tenants and message types based on the assigned weights; and compute the weights relating to the plurality of tenants and message types prior to assigning the weights to at least one of the plurality of tenants and the plurality of message types.

17 . A machine-readable medium comprising a plurality of instructions which, when executed by a processing device, cause the processing device to perform one or more operations comprising:
assigning, in runtime, weights to at least one of a plurality of tenants and a plurality of message types, wherein the assigned weights are capable of being dynamically scaled, in runtime, based on one or more factors; and allocating, in runtime, resources to one or more of the plurality of tenants and one or more of the plurality of message types based on their assigned one or more weights of the weights, wherein the allocated resources are capable of being dynamically modified, in runtime, based on scaling of the assigned weights.

18 . The machine-readable medium of claim 17 , wherein the one or more operations comprise fetching queuing time associated with at least one of each of the plurality of the message types and each of the plurality of tenants associated with one or more of the plurality of message types.

19 . The machine-readable medium of claim 17 , wherein the one or more operations comprise allocating zero resources to at least one of one or more zero resource-consuming tenants of the plurality of tenants and one or more zero resource-consuming message types of the plurality of message types that are determined as using zero queuing time of the queuing time.

20 . The machine-readable medium of claim 17 , wherein the one or more operations comprise fetching one or more weights from a weights cache, wherein the one or more factors include one or more of importance levels, priority levels, and process urgency levels ass

Assignees

• Salesforce Com Inc

Inventors

• Wang Xiaodan

Classifications

• G06F9/546

  Message passing systems or structures, e.g. queues · CPC title

• H04L47/50

  Queue scheduling · CPC title

• H04L47/72 Primary

  using reservation actions during connection setup · CPC title

• G06F2209/5018

  Thread allocation · CPC title

• G06F9/5027 Primary

  the resource being a machine, e.g. CPUs, Servers, Terminals · CPC title