Tenant assignment system

Patent metadata

Field	Value
Publication number	US-10313261-B1
Application number	US-201615183668-A
Country	US
Kind code	B1
Filing date	Jun 15, 2016
Priority date	Jun 15, 2016
Publication date	Jun 4, 2019
Grant date	Jun 4, 2019

Abstract

A system for tenant assignment includes an interface and a processor. The interface is to receive a tenant resource usage data and a hardware resource data. The tenant resource usage data comprises a tenant information on a set of tenants. The hardware resource data comprises a hardware resource information on a set of hardware resources. The processor is to develop a tenant assignment model based at least in part on the tenant resource usage data and the hardware resource data, solve the tenant assignment model to determine a suggested tenant assignment comprising an assignment of the set of tenants to the set of hardware resources, and to provide the suggested tenant assignment.

First claim

What is claimed is:

1. A system for tenant assignment, comprising:
an interface to:
receive a tenant resource usage data and a hardware resource data,
wherein the tenant resource usage data comprises a tenant information on a set of tenants,
wherein the hardware resource data comprises a hardware resource information on a set of hardware resources; and

a processor to:
create a first tenant usage profile for a first tenant in the set of tenants based at least in part on the tenant resource usage data, wherein the first tenant usage profile comprises a first maximum tenant usage case for a time period, wherein the first maximum tenant usage case for the time period comprises maximum tenant usage by the first tenant of a first recurring time segment and a second recurring time segment over a completed period of time;
create a second tenant usage profile for a second tenant in the set of tenants based at least in part on the tenant resource usage data, wherein the second tenant usage profile comprises a second maximum tenant usage case for the time period, wherein the second maximum tenant usage case for the time period comprises maximum usage by the second tenant of the first recurring time segment and the second recurring time segment over the completed period of time;
develop a tenant assignment model based at least in part on the first maximum tenant usage case, the second maximum tenant usage case, and the hardware resource data;
solve the tenant assignment model to determine a suggested tenant assignment comprising an assignment of the set of tenants to the set of hardware resources, wherein the tenant assignment model is caused to be solved by an integer linear program solver; and
provide the suggested tenant assignment.

2. The system of claim 1 , wherein the processor further assigns the set of tenants based at least in part on the suggested tenant assignment.

3. The system of claim 1 , wherein a hardware resource in the set of hardware resources is configured to provide one or more of: an Object Transaction Service, an Advanced Objects Data Store Service, or an Object Reporting Service.

4. The system of claim 1 , wherein a hardware resource in the set of hardware resources is configured to comprise one or more specialized servers.

5. The system of claim 1 , wherein a hardware resource profile is created for a hardware resource in the set of hardware resources.

6. The system of claim 5 , wherein the hardware resource profile comprises a server memory capacity and a server processor capacity.

7. The system of claim 1 , wherein the first tenant usage profile is based at least in part on one or more of: a static data footprint of the data, a metadata size, an estimate of RAM growth based on tasks run, a task count, an instance accessed, or a number of decompressions.

8. The system of claim 1 , wherein the first tenant usage profile is dynamically updated based on a usage history.

9. The system of claim 1 , wherein the tenant in the set of tenants has a required service, wherein the required service comprises one of: an Object Transaction Service, an Advanced Objects Data Store Service, or an Object Reporting Service.

10. The system of claim 1 , wherein the tenant resource usage data comprises one or more of: a task log, a garbage collection log, or a tenant configuration data.

11. The system of claim 1 , wherein the suggested tenant assignment allocates the set of tenants to the set of hardware resources.

12. The system of claim 1 , wherein the tenant assignment model comprises a constraint.

13. The system of claim 12 , wherein the constraint comprises one or more of: a preference to move tenants to lower numbered services, a static resource limit, a dynamic resource limit, a number of tenants assigned to a hardware resource, a specialized service needed, a structural constraint, a buffer, a tenant consumption, or a service of all tenants.

14. The system of claim 1 , wherein the tenant assignment model comprises a cost function for a service in a set of services.

15. The system of claim 1 , wherein results for the tenant assignment model results are post-processed to determine tenant assignment.

16. A method for tenant assignment, comprising:
receiving a tenant resource usage data and a hardware resource data,
wherein the tenant resource usage data comprises a tenant information on a set of tenants,
wherein the hardware resource data comprises a hardware resource information on a set of hardware resources;

creating a tenant first tenant usage profile for a first tenant in the set of tenants based at least in part on the tenant resource usage data, wherein the first tenant usage profile comprises a first maximum tenant usage case for a time period, wherein the first maximum tenant usage case for the time period comprises maximum tenant usage by the first tenant of a first recurring time segment and a second recurring time segment over a completed period of time;
creating a second tenant usage profile for a second tenant in the set of tenants based at least in part on the tenant resource usage data, wherein the second tenant usage profile comprises a second maximum tenant usage case for the time period, wherein the second maximum tenant usage case for the time period comprises maximum usage by the second tenant of the first recurring time segment and the second recurring time segment over the completed period of time;
developing, using a processor, a tenant assignment model based at least in part on the first maximum tenant usage case, the second maximum tenant usage case, and the hardware resource data;
solving the tenant assignment model to determine a suggested tenant assignment comprising an assignment of the set of tenants to the set of hardware resources, wherein the tenant assignment model is caused to be solved by an integer linear program solver; and
providing the suggested tenant assignment.

17. A computer program product for tenant assignment, the computer program product being embodied in a non-transitory computer readable storage medium and comprising computer instructions for:
receiving a tenant resource usage data and a hardware resource data,
wherein the tenant resource usage data comprises a tenant information on a set of tenants,
wherein the hardware resource data comprises a hardware resource information on a set of hardware resources;

creating a first tenant usage profile for a first tenant in the set of tenants based at least in part on the tenant resource usage data, wherein the first tenant usage profile comprises a first maximum tenant usage case for a time period, wherein the first maximum tenant usage case for the time period comprises maximum tenant usage by the first tenant of a first recurring time segment and a second recurring time segment over a completed period of time;
creating a second tenant usage profile for a second tenant in the set of tenants based at least in part on the tenant resource usage data, wherein the second tenant usage profile comprises a second maximum tenant usage case for the time period, wherein the second maximum tenant usage case for the time period comprises maximum usage by the second tenant of the first recurring time segment and the second recurring time segment over the completed period of time;
developing, using a processor, a tenant assignment model based at least in part on the first maximum tenant usage case, the second maximum tenant usage case, and the hardware resource data;
solving the tenant assignment model to determine a suggested tenant assignment comprising an assignment of the

Assignees

• Workday Inc

Inventors

• Walton Iii Harry Philip

Classifications

• G06F9/5066

  Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs (mappping at compile time, see G06F8/451) · CPC title

• H04L47/787

  Bandwidth trade among domains · CPC title

• G06F9/5022

  Mechanisms to release resources · CPC title

• H04L67/10

  in which an application is distributed across nodes in the network (software deployment G06F8/60; multiprogramming arrangements G06F9/46) · CPC title

• G06F9/5027

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