System and method for enforcing future policies in a compute environment

• US 8,464,266 B2
• Filed: 01/31/2012
• Issued: 06/11/2013
• Est. Priority Date: 03/11/2005
• 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
• Primary Examiner(s): An, Meng
• Assistant Examiner(s): WAI, ERIC CHARLES
• Application Number:
  US13/362,243
• Publication Number:
  US 20120198467A1
• Time in Patent Office: 497 Days
• Field of Search: None
• US Class Current: 718/104
• CPC Class Codes: G06F 21/6218 to a system of files or objects, e.g. local or distributed file system or database
• CPC Class Codes: G06F 2221/2141 Access rights, e.g. capability lists, access control lists, access tables, access matrices
• CPC Class Codes: G06F 9/5061 Partitioning or combining of resources
• CPC Class Codes: G06F 9/5072 Grid computing

Abstract

A disclosed system receives a request for resources, generates a credential map for each credential associated with the request, the credential map including a first type of resource mapping and a second type of resource mapping. The system generates a resource availability map, generates a first composite intersecting map that intersects the resource availability map with a first type of resource mapping of all the generated credential maps and generates a second composite intersecting map that intersects the resource availability map and a second type of resource mapping of all the generated credential maps. With the first and second composite intersecting maps, the system can allocate resources within the compute environment for the request based on at least one of the first composite intersecting map and the second composite intersecting map.

Claims

1. A method comprising:

receiving a request for resources within a compute environment, wherein the request comprises a credential that places a limit on use of the compute environment for a job associated with the request;

generating a credential map for the credential that indicates one of reserved resources and consumed resources at given time frames;

generating a resource availability map that identifies times and resources that are available independent of any policy;

generating a composite intersecting map that intersects the resource availability map with the credential map;

selecting a time frame for reserving resources for the request based on the composite intersecting map; and

reserving resources within the compute environment for the request based on the time frame and the composite intersecting map.

2. The method of claim 1, wherein the request is a request for one of a job and a reservation.

3. The method of claim 2, wherein the credential comprises at least one of:

a user, a group, a number of processors, a number of jobs, a quality of service, a number of nodes, a bandwidth, licensing availability, a second time frame and a cost.

4. The method of claim 1, wherein the credential map is time-based.

5. The method of claim 1, wherein the time flame is one of:

an earliest time flame that an allocation of resources can be made and a time flame which will improve use of the compute resources.

6. The method of claim 1, wherein the credential map is for the credential that indicates consumed resources, the method, further comprising:

determining whether, based on a second composite intersecting map that relates to the reserved resources, the time frame for reserving resources does not overlap with any consumed resources and is completely within the reserved resources, and if so, then the step of reserving resources is performed without any credential constraints.

7. The method of claim 6, wherein, if the time flame does not overlap consumed resources but requires unreserved resources, the step of reserving resources further comprises reserving new resources according to credential constraints.

8. The method of claim 7, wherein reserving new resources according to credential constraints further comprises identifying an amount of unreserved resources that are available for reservation according to credential constraints.

9. The method of claim 8, wherein identifying the amount of unreserved resources that are available for reservation according to credential constraints further comprises determining a difference between unreserved resources and previously reserved resources that will satisfy the request for resources.

10. The method of claim 9, wherein a difference between unreserved resources and previously reserved resources further is based on consumed resources.

11. A system comprising:

a processor; and

a computer-readable medium storing instructions, which, when executed by the processor, perform a method comprising;

receiving a request for resources within a compute environment, wherein the request comprises a credential that places a limit on use of the compute environment for a job associated with the request;

generating a credential map for the credential that indicates one of reserved resources and consumed resources at given time frames;

generating a resource availability map that identifies times and resources that are available independent of any policy;

generating a composite intersecting map that intersects the resource availability map with the credential map;

selecting a time frame for reserving resources for the request based on the composite intersecting map; and

reserving resources within the compute environment for the request based on the time frame and the composite intersecting map.

12. A non-transitory computer-readable medium storing instructions for controlling a computing device, the instructions, when executed by the computing device, cause the computing device to perform a method comprising:

receiving a request for resources within a compute environment, wherein the request comprises a credential that places a limit on use of the compute environment for a job associated with the request;

generating a credential map for the credential that indicates one of reserved resources and consumed resources at given time frames;

generating a resource availability map that identifies times and resources that are available independent of any policy;

generating a composite intersecting map that intersects the resource availability map with the credential map;

selecting a time frame for reserving resources for the request based on the composite intersecting map; and

reserving resources within the compute environment for the request based on the time frame and the composite intersecting map.