# US 2021/0243246 A1 · Mechanism for a work node scan process to facilitate cluster scaling

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2021/0243246 A1
- Document ID: US20210243246A1
- Status: Published application
- Kind: A1
- Application number: 16/779,418
- Filed: 2020-01-31
- Published: 2021-08-05
- Earliest claimed: 2020-01-31
- Assignees: salesforce.com, inc.
- Applicants: salesforce.com, inc.
- Inventors: Yogesh Patel; Percy Mehta; Shardul Vikram; Mattia Padovani
- Web page: https://patentgrep.com/patent/US20210243246A1

## CPC

- H04L 67/10: in which an application is distributed across nodes in the network (software deployment G06F8/60; multiprogramming arrangements G06F9/46)
- H04L 67/1025: Dynamic adaptation of the criteria on which the server selection is based
- G06F 9/4881: {Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues}
- G06F 9/5077: {Logical partitioning of resources; Management or configuration of virtualized resources (specific details on emulation or internal functioning of virtual machines G06F9/455)}
- G06F 16/2246: {Trees, e.g. B+trees}
- H04L 67/1036: Load balancing of requests to servers for services different from user content provisioning, e.g. load balancing across domain name servers
- H04W 4/029: Location-based management or tracking services
- H04W 24/10: Scheduling measurement reports {; Arrangements for measurement reports}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

A method and system that perform cluster node work assignments for tenants in a multi-tenant system. The method includes selecting a partition of a cluster tenant tracking structure having a hierarchical namespace and virtual nodes representing each tenant by a cluster node foreman controller, searching the selected partition for a tenant that is unlocked in the cluster tenant tracking structure, and initiating work for the tenant by the cluster node.

## Claims

### Claim 1

A method of cluster node work assignment for tenants in a multi-tenant system, the method comprising:
selecting a partition of a cluster tenant tracking structure having a hierarchical namespace and virtual nodes representing each tenant by a foreman controller of a cluster node;
searching the selected partition for a tenant that is unlocked in the cluster tenant tracking structure; and
initiating work for the tenant by the cluster node.

### Claim 2 (depends on 1)

The method of cluster node work assignment of claim 1, further comprising:
initiating the method of cluster node work assignment in response to expiration of a timer for the cluster node, or an increase in work capacity of the cluster node.

### Claim 3 (depends on 1)

The method of cluster node work assignment of claim 1, wherein the cluster tenant tracking structure is a tree of the virtual nodes with the hierarchical namespace and the partition is a sub-tree of the tree.

### Claim 4 (depends on 3)

The method of cluster node work assignment of claim 3, wherein the virtual nodes indicate whether a tenant is assigned to the cluster node.

### Claim 5 (depends on 1)

The method of cluster node work assignment of claim 1, further comprising:
receiving notification of a tenant joining a cluster of the cluster node by a cluster node manager.

### Claim 6 (depends on 5)

The method of cluster node work assignment of claim 5, further comprising:
assigning the tenant to a partition of the cluster tenant tracking structure by the cluster node manager.

### Claim 7 (depends on 1)

The method of cluster node work assignment of claim 1, wherein selecting the partition for cluster tenant tracking structure is by round robin.

### Claim 8

A non-transitory machine-readable storage medium that provides instructions that, if executed by a processor, will cause said processor to perform operations comprising:
selecting a partition of a cluster tenant tracking structure having a hierarchical namespace and virtual nodes representing each tenant by a foreman controller of a cluster node;
searching the selected partition for a tenant that is unlocked in the cluster tenant tracking structure; and
initiating work for the tenant by the cluster node.

### Claim 9 (depends on 8)

The non-transitory machine-readable storage medium of claim 8, the operations further comprising:
initiating cluster node work assignments in response to expiration of a timer for the cluster node, or an increase in work capacity of the cluster node.

### Claim 10 (depends on 8)

The non-transitory machine-readable storage medium of claim 8, wherein the cluster tenant tracking structure is a tree of virtual nodes with the hierarchical namespace and the partition is a sub-tree of the tree.

### Claim 11 (depends on 10)

The non-transitory machine-readable storage medium of claim 10, wherein the virtual nodes indicate whether a tenant is assigned to the cluster node.

### Claim 12 (depends on 8)

The non-transitory machine-readable storage medium of claim 8, the operations further comprising:
receiving notification of a tenant joining a cluster of the cluster node by a cluster node manager.

### Claim 13 (depends on 12)

The non-transitory machine-readable storage medium of claim 12, the operations further comprising:
assigning the tenant to a partition of the cluster tenant tracking structure by the cluster node manager.

### Claim 14 (depends on 8)

The non-transitory machine-readable storage medium of claim 8, wherein selecting the partition for cluster tenant tracking structure is by round robin.

### Claim 15

A computing device in a multi-tenant environment, the computing device comprising:
a non-transitory machine-readable medium having stored therein a foreman controller of a cluster node; and
a processor coupled to the non-transitory machine-readable medium, the processor to execute the cluster node and the foreman controller, the foreman controller to select a partition of a cluster tenant tracking structure having a hierarchical namespace and virtual nodes representing each tenant by a cluster node foreman controller, search the selected partition for a tenant that is unlocked in the cluster tenant tracking structure, and initiate work for the tenant by the cluster node.

### Claim 16 (depends on 15)

The computing device of claim 15, wherein the foreman controller is further to initiate cluster node work assignments in response to expiration of a timer for the cluster node, or an increase in work capacity of the cluster node.

### Claim 17 (depends on 15)

The computing device of claim 15, wherein the cluster tenant tracking structure is a tree of virtual nodes with the hierarchical namespace and the partition is a sub-tree of the tree.

### Claim 18 (depends on 17)

The computing device of claim 17, wherein the virtual nodes indicate whether a tenant is assigned to the cluster node.

### Claim 19 (depends on 15)

The computing device of claim 15, further comprising:
a cluster node manager to receive notification of a tenant joining a cluster of the cluster node.

### Claim 20 (depends on 19)

The computing device of claim 19, further comprising:
a cluster node manager to assign the tenant to a partition of the cluster tenant tracking structure by the cluster node manager.

### Claim 21 (depends on 15)

The computing device of claim 15, wherein selecting the partition for cluster tenant tracking structure is by round robin.
