×

Dynamic allocation and partitioning of compute nodes in hierarchical job scheduling

  • US 8,381,212 B2
  • Filed: 10/09/2007
  • Issued: 02/19/2013
  • Est. Priority Date: 10/09/2007
  • Status: Expired due to Fees
First Claim
Patent Images

1. A method of reporting job status comprising:

  • obtaining from a parent node, by a plurality of compute nodes, one or more portions of a job to be executed by the plurality of compute nodes, together with information indicating a plurality of child nodes that are children to the plurality of compute nodes that are available to accept at least one portion of the job, the plurality of compute nodes and the plurality of child nodes being in a hierarchical relationship, wherein the plurality of compute nodes are higher in the hierarchical relationship than the plurality of child nodes and wherein the parent node is higher in the hierarchical relationship than the plurality of compute nodes;

    executing by the plurality of compute nodes at least one portion of the job;

    forwarding by the plurality of compute nodes to the plurality of child nodes at least one portion of the job to be executed by the plurality of child nodes;

    receiving by a node of the plurality of compute nodes from at least one child node of the plurality of child nodes status information regarding the at least one portion of the job executed by the at least one child node;

    consolidating by the node the status information received from the at least one child node with status information regarding the at least one portion of the job executed by the node to provide consolidated status information, the consolidated status information including status information from the at least one child node and from the node itself; and

    providing to the parent node the consolidated status information.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×