System and method for topology-aware job scheduling and backfilling in an HPC environment

• US 9,189,275 B2
• Filed: 12/12/2012
• Issued: 11/17/2015
• Est. Priority Date: 04/15/2004
• Status: Active Grant

• Current Assignee: Raytheon Company (Rtx Corporation)
• Original Assignee: Raytheon Company (Rtx Corporation)
• Inventors: Davidson, Shannon V., Richoux, Anthony N.
• Primary Examiner(s): Vo, Ted T
• Application Number:
  US13/712,423
• Publication Number:
  US 20130104138A1
• Time in Patent Office: 1,070 Days
• Field of Search: 717159-166, 718/104
• US Class Current: 1/1
• CPC Class Codes: G06F 11/1482 by means of middleware or OS functionality
• CPC Class Codes: G06F 11/2025 using centralised failover control functionality
• CPC Class Codes: G06F 2201/815 Virtual
• CPC Class Codes: G06F 9/4881 Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
• CPC Class Codes: G06F 9/50 Allocation of resources, e.g. of the central processing unit [CPU]
• 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/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 Class Codes: G06F 9/5072 Grid computing
• CPC Class Codes: 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
• CPC Class Codes: G06F 9/5083 Techniques for rebalancing the load in a distributed system

Abstract

A method for job management in an HPC environment includes determining an unallocated subset from a plurality of HPC nodes, with each of the unallocated HPC nodes comprising an integrated fabric. An HPC job is selected from a job queue and executed using at least a portion of the unallocated subset of nodes.

Claims

1. A method comprising:

determining, using one or more computers, an original subset of a plurality of communicatively coupled nodes of a computing environment, the original subset comprising nodes currently unallocated to a job;

selecting a job from a job queue; and

determining that dimensions of the selected job are greater than a topology of the original subset;

selecting one or more nodes from a second plurality of nodes, the second plurality being distinct from the original subset, wherein the selected one or more nodes from the second plurality are unavailable at the time of selecting; and

adding the nodes selected from the second plurality to the original subset to satisfy the dimensions of the selected job after the nodes selected from the second plurality become available; and

executing the selected job.

2. The method of claim 1, further comprising executing the selected job using one or more nodes of the original subset and one or more nodes of the selected second plurality of nodes.

3. The method of claim 1, further comprising selecting the job from the job queue based on priority.

4. The method of claim 1, wherein the dimensions of the job are based, at least in part, on one or more job parameters and an associated policy.

5. The method of claim 1, further comprising:

dynamically allocating a job space from the original subset and the second plurality of nodes based, at least in part, on the dimensions of the job, wherein executing the selected job comprises executing the selected job using the dynamically allocated job space.

6. The method of claim 1, further comprising:

determining that a second job that was executing on a second subset in the plurality of nodes has failed;

adding the second subset to the original subset; and

adding the failed job to the job queue.

7. Software in one or more non-transitory, tangible computer-readable media and when executed operable to:

determine an original subset of a plurality of communicatively coupled nodes of a computing environment, the original subset comprising nodes currently unallocated to a job;

select a job from a job queue;

determine that dimensions of the selected job are greater than a topology of the original subset;

select one or more nodes from a second plurality of nodes, the second plurality being distinct from the original subset, wherein the selected one or more nodes from the second plurality are unavailable at the time of selecting,

add the selected second nodes to the original subset to satisfy the dimensions of the selected job after the nodes selected from the second plurality become available; and

execute the selected job.

8. The software of claim 7, wherein the software is operable to select the job from the job queue based on priority.

9. The software of claim 7, wherein the dimensions of the job are based, at least in part, on one or more job parameters and an associated policy.

10. The software of claim 7, further operable to:

dynamically allocate a job space from the original subset and the selected second nodes based, at least in part, on the dimensions of the job; and

wherein the software operable to execute the selected job comprises software operable to execute the selected job using the dynamically allocated job space.

11. A system comprising:

a plurality of communicatively coupled nodes of a computing environment; and

a management node operable to;

determine an original subset of the plurality of nodes, the original subset comprising nodes currently unallocated to a job;

select a job from a job queue;

determine that dimensions of the selected job are greater than a topology of the original subset;

select one or more nodes from a second plurality of nodes, the second plurality being distinct from the original subset, wherein the selected one or more nodes from the second plurality are unavailable at the time of selecting,

add the selected one or more nodes from the second plurality to the original subset to satisfy the dimensions of the selected job after the nodes selected from the second plurality become available; and

execute the selected job using one or more processors of one or more nodes of the modified original subset.

12. The system of claim 11, wherein the management node is operable to select the job from the job queue based on priority.

13. The system of claim 12, wherein the dimensions of the job are based, at least in part, on one or more job parameters and an associated policy.

14. The system of claim 12, wherein the management node is further operable to:

dynamically allocate a job space from the modified original subset of nodes based, at least in part, on the dimensions of the job; and

execute the selected job using the dynamically allocated job space.

15. The system of claim 11, wherein the management node is further operable to return the selected second nodes to the second plurality.

16. The system of claim 11, wherein the management node is further operable to:

determine that a job that was executing on a second subset in the plurality of nodes has failed;

add the second subset to the unallocated subset; and

add the failed job to the job queue.