CO-ALLOCATING A RESERVATION SPANNING DIFFERENT COMPUTE RESOURCES TYPES

• US 20070106994A1
• Filed: 12/26/2006
• Published: 05/10/2007
• Est. Priority Date: 03/13/2004
• Status: Active Grant

• Current Assignee: III Holdings 12, LLC (Intellectual Ventures LLC)
• Original Assignee: Cluster Resources, Inc. (Ala Services LLC)
• Inventors: Jackson, David
• Granted Patent: US 8,782,654 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/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
• CPC Class Codes: G06F 9/5083 Techniques for rebalancing the load in a distributed system

Abstract

A system and method of reserving resources in a compute environment are disclosed. The method embodiment comprises receiving a request for resources within a computer environment, determining at least one completion time associated with at least one resource type required by the request, and reserving resources within the computer environment based on the determine of at least the completion time. A scaled wall clock time on a per resource basis may also be used to determine what resources to reserves The system may determine whether to perform a start time analysis or a completion time analysis or a hybrid analysis in the process of generating a co-allocation map between a first type of resource and a second type of resource in preparation for reserving resources according to the generated co-allocation map.

Claims

1. A method of reserving resources in a compute environment, the method comprising:

receiving a request for resources within a compute environment;

determining at least one completion time associated with at least one resource type required by the request; and

reserving resources within the compute environment based on the determined at least one completion time.

2. The method of claim 1, further comprising:

determining a range of completion times for the request.

3. The method of claim 1, wherein determining the at least one completion time is at least in part based on wall clock scaling information that is job specific.

4. The method of claim 1, further comprising:

identifying feasible resources within the compute environment for the request.

5. The method of claim 4, further comprising:

analyzing each identified feasible resource for its effective speed in fulfilling the request.

6. The method of claim 5, further comprising:

analyzing workload commitment for each identified feasible resource.

7. The method of claim 6, wherein the analysis of workload commitments represents a per node availability range.

8. The method of claim 7, further comprising:

translating the per node availability range into a potential completion time range.

9. The method of claim 8, further comprising:

measuring the potential completion time range with at least the other requirement; and

determining a w-allocation for multiple collections of resources that can meet the request.

10. The method of claim 9, wherein the merging represents a merging of at least two mappings of potential completion times for diverse resources in the compute environment.

11. The method of claim 1, further comprising:

determining at least one start time associated with the request using a scaled wall clock limit for the request.

12. The method of claim 1, wherein the at least one completion time for the request is determined based on a worst case scenario for any particular resource.

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

receiving a request for resources requiring a first type of resource and a second type of resources;

analyzing completion times associated with the first type of resource;

analyzing completion times associated with the second type of resource;

generating a co-allocation map between the first type of resource and the second type of resource based on the analysis of completion times for the first and second type of resource.

14. The method of claim 13, further comprising reserving resources according to the generated co-allocation map.

15. The method of claim 13, 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.

16. The method of claim 15, wherein the co-allocation map comprises all time frames where available resources exist that satisfy the first request and the second request.

17. The method of claim 13, wherein possible types of resources comprise at least one of:

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

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

19. The method of claim 18, wherein generating the co-allocation map further comprises determining intersecting time frames in which both the first request and the second request may be simultaneously satisfied.

20. The method of claim 19, further comprising:

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

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

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

receiving a request for resources requiring a first type of resource and a second type of resources;

analyzing a first relative resource speed associated with the first type of resource;

analyzing a second relative resource speed associated with the second type of resource;

generating a co-allocation map between the first type of resources and the second type of resources based on the analysis of the first and second relative resource speed.

23. A method of reserving resources in a compute environment, the method comprising:

receiving a request for resources within a compute environment;

determining whether to perform a start time analysis, completion time analysis or hybrid analysis in preparation for reserving resources in the compute environment based on a request; and

reserving resources within the computer environment based on the determined analysis.