Support of non-trivial scheduling policies along with topological properties
First Claim
Patent Images
1. A computer system, comprising:
- a processor for executing computing instructions;
a memory for storing the computing instructions; and
a scheduling unit associated with the processor and the memory to schedule and dispatch a job having resource mapping requirements to resources in a computing architecture arranged at least in part on node boards in host computers via the executed computing instructions, the scheduling unit generating a candidate host list representing the resources in the host computers available to execute the job to be scheduled based on the resource mapping requirements of the job to be scheduled; and
a topology library unit including a machine map M of the computer system, the machine map M indicative of interconnections of the resources in the computer system to which the scheduling unit can schedule and dispatch the job, and at least one global status map Yn, each global status map Yn indicative of the interconnections of resources in the computer system to which the scheduling unit can schedule and dispatch the job if non-trivial scheduling requiring more than one scheduling cycle in which to schedule the job is utilized.
3 Assignments
0 Petitions
Accused Products
Abstract
A system includes a scheduling unit for scheduling jobs to resources, and a library unit having a machine map of the system and a global status map of interconnections of resources. The library unit determines a free map of resources to execute the job to be scheduled, the free map indicating the interconnection of resources to which the job in a current scheduling cycle can be scheduled. A monitoring unit dispatches a job to the resources in the free map which match the resource mapping requirements of the job and fall within the free map.
-
Citations
15 Claims
-
1. A computer system, comprising:
-
a processor for executing computing instructions; a memory for storing the computing instructions; and a scheduling unit associated with the processor and the memory to schedule and dispatch a job having resource mapping requirements to resources in a computing architecture arranged at least in part on node boards in host computers via the executed computing instructions, the scheduling unit generating a candidate host list representing the resources in the host computers available to execute the job to be scheduled based on the resource mapping requirements of the job to be scheduled; and a topology library unit including a machine map M of the computer system, the machine map M indicative of interconnections of the resources in the computer system to which the scheduling unit can schedule and dispatch the job, and at least one global status map Yn, each global status map Yn indicative of the interconnections of resources in the computer system to which the scheduling unit can schedule and dispatch the job if non-trivial scheduling requiring more than one scheduling cycle in which to schedule the job is utilized. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A method, comprising:
-
receiving a job having resource mapping requirements, the job to be scheduled and dispatched to resources in a computing architecture arranged at least in part on node boards in host computers; generating a candidate host list representing the resources in the host computers available to execute the job to be scheduled based on the resource mapping requirements of the job to be scheduled; determining a machine map M of a computer system, the machine map M indicative of interconnections of the resources in the computer system to which a scheduling system can schedule the job; determining at least one global status map Yn, each global status map Yn indicative of the interconnections of resources in the computer system to which the scheduling system can schedule the job if non-trivial scheduling requiring more than one scheduling cycle in which to schedule the job is utilized; and scheduling and dispatching the job to the resources in the computer system based on the machine map M and the global status map Yn. - View Dependent Claims (7, 8, 9, 10)
-
-
11. A computer program product for scheduling jobs in a multiprocessor system, the computer program product comprising:
a non-transitory computer readable medium having computer readable program code embodied therewith, the computer readable program code comprising computer readable program code configured to; receive a job having resource mapping requirements, the job to be scheduled and dispatched to resources in a computing architecture arranged at least in part on node boards in host computers; generate a candidate host list representing the resources in the host computers available to execute the job to be scheduled based on the resource mapping requirements of the job to be scheduled; determine a machine map M of a computer system, the machine map M indicative of interconnections of the resources in the computer system to which a scheduling system can schedule the job; determine at least one global status map Yn, each global status map Yn indicative of the interconnections of resources in the computer system to which the scheduling system can schedule the job if non-trivial scheduling requiring more than one scheduling cycle in which to schedule the job is utilized; and schedule and dispatch the job to the resources in the computer system based on the machine map M and the global status map Yn. - View Dependent Claims (12, 13, 14, 15)
Specification