×

Support of non-trivial scheduling policies along with topological properties

  • US 10,467,051 B2
  • Filed: 07/25/2016
  • Issued: 11/05/2019
  • Est. Priority Date: 05/11/2004
  • Status: Expired due to Fees
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.

View all claims
  • 3 Assignments
Timeline View
Assignment View
    ×
    ×