SYSTEM AND METHOD OF CO-ALLOCATING A RESERVATION SPANNING DIFFERENT COMPUTE RESOURCES TYPES

• US 20130247064A1
• Filed: 02/06/2013
• Published: 09/19/2013
• Est. Priority Date: 03/13/2004
• Status: Active Grant

• Current Assignee: III Holdings 12, LLC (Intellectual Ventures LLC)
• Original Assignee: Adaptive Computing Enterprises, Inc. (Ala Services LLC)
• Inventors: Jackson, David Brian
• Granted Patent: US 9,959,140 B2
• Time in Patent Office: Days
• US Class Current: 718/104
• CPC Class Codes: G06F 2209/5014 Reservation
• CPC Class Codes: G06F 2209/506 Constraint
• CPC Class Codes: G06F 9/50 Allocation of resources, e.g. of the central processing unit [CPU]
• CPC Class Codes: G06F 9/5027 the resource being a machine, e.g. CPUs, Servers, Terminals
• CPC Class Codes: G06F 9/5038 considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration scheduling strategies G06F9/4881 and subgroups
• CPC Class Codes: G06F 9/5072 Grid computing

Abstract

Co-allocating resources within a compute environment includes. Receiving a request for a reservation for a first type of resource, analyzing constraints and guarantees associated with the first type of resource, identifying a first group of resources that meet the request for the first type of resource and storing in a first list, receiving a request for a reservation for a second type of resource, analyzing constraints and guarantees associated with the second type of resource, identifying a second group of resources that meet the request for the second type of resource and storing in a second list, calculating a co-allocation parameter between the first group of resources and the second group of resources and reserving resources according to the calculated co-allocation parameter of the first group of resources and the second group of resources. The request may also request exclusivity of the reservation.

Claims

1. A method of co-allocating resources within a compute environment, the method comprising:

receiving, via a processor, a first request for a first reservation for a first type of resource in a compute environment comprising a plurality of nodes;

identifying a first group of resources that meets the first request for the first reservation;

receiving a second request for a second reservation for a second type of resource in the compute environment;

identifying a second group of resources that meets the second request for the second reservation, wherein the first type of resource and second type of resource span one or more servers in the compute environment, each having a homogeneous processor architecture; and

generating a set of resources exclusive to at least one of the first request and the second request.

2. The method of claim 1, wherein the first request specifies exclusivity of the first group of resources for the first request.

3. The method of claim 2, wherein if exclusivity is requested, the method comprises guaranteeing that the first request will be able to reserve exclusive resources.

4. A method of co-allocating resources within a compute environment, the method comprising:

receiving a first request for a reservation for a first type of resource in a compute environment comprising a plurality of networked nodes;

identifying a first group of resources that meet the first request;

receiving a second request for a reservation for a second type of resource in the compute environment, wherein the first type of resource and second type of resource span at least one node of the plurality of networked nodes, wherein each node of the plurality of networked nodes has a homogeneous processor architecture;

identifying a second group of resources that meet the second request; and

generating a co-allocation map between the first group of resources and the second group of resources, wherein first constraints, second constraints and service level agreement guarantees associated with the first request and the second request relate to time-based policies which limit requestors to a pre-determined quantity of resources at any given moment in time.

5. The method of claim 4, further comprising reserving resources according to the co-allocation map.

6. The method of claim 4, wherein generating the co-allocation map comprises identifying a reduced map of quantities of resources that can simultaneously satisfy the first request and the second request.

7. The method of claim 4, wherein the first type of resource and second type of resource comprise at least one of:

compute resources, disk storage resources, network bandwidth resources, memory resources, and licensing resources.

8. The method of claim 4, wherein generating the co-allocation map further comprises identifying an intersection of an availability of each of the first type of resource and the second type of resource.

9. The method of claim 4, further comprising:

generating a resulting array of events describing the intersecting time frames.

10. The method of claim 9, wherein the resulting array of events comprises at least one of resource quantity, resource quality, time frames, quality of information and cost.

11. The method of claim 4, wherein the first request and the second request comprise at least one of:

a job description, at least one time frame availability, a description of minimum resources, a description of resource types and attributes, and a reservation duration minimum.

12. The method of claim 4, wherein identifying the first group of resources and the second group of resources further comprises analyzing events associated with the first request and the second request and how resource availability changes over time.

13. The method of claim 12, wherein the events comprise at least one of job start, job completion, state change, boundaries, reservations, and policy enforcement limits.

14. The method of claim 4, further comprising reporting at least one of the following parameters associated with the identified first and second group of resources:

cost, quality of information data, resource quantity data, time frame data, and resource quality data.

15. The method of claim 4, further comprising:

performing again, under constraints identified by the co-allocation map, the step of identifying a first group of resources that meet the request for the first type of resource.

16. A system for co-allocating resources within a compute environment, the system comprising:

a processor; and

a computer-readable storage medium storing instructions which, when executed by the processor, cause the processor to perform operations comprising;

receiving, via a processor, a first request for a first reservation for a first type of resource in a compute environment comprising a plurality of nodes;

identifying a first group of resources that meets the first request for the first reservation;

receiving a second request for a second reservation for a second type of resource in the compute environment;

identifying a second group of resources that meets the second request for the second reservation, wherein the first type of resource and second type of resource span one or more servers in the compute environment, each having a homogeneous processor architecture; and

generating a set of resources exclusive to at least one of the first request and the second request.

17. A computer-readable medium storing instructions for controlling a processor to co-allocate resources within a compute environment, the instructions causing the processor to perform operations comprising:

receiving, via a processor, a first request for a first reservation for a first type of resource in a compute environment comprising a plurality of nodes;

identifying a first group of resources that meets the first request for the first reservation;

receiving a second request for a second reservation for a second type of resource in the compute environment;

identifying a second group of resources that meets the second request for the second reservation, wherein the first type of resource and second type of resource span one or more servers in the compute environment, each having a homogeneous processor architecture; and

generating a set of resources exclusive to at least one of the first request and the second request.