METHOD, SYSTEM AND PROGRAM PRODUCTS FOR A DYNAMIC, HIERARCHICAL REPORTING FRAMEWORK IN A NETWORK JOB SCHEDULER

• US 20090094605A1
• Filed: 10/09/2007
• Published: 04/09/2009
• Est. Priority Date: 10/09/2007
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Hughes, Stephen C., Sure, Ravindra R., Chan, Waiman, Brelsford, David P., Marthi, Kailash N.
• Granted Patent: US 8,381,212 B2
• Time in Patent Office: Days
• US Class Current: 718/100
• CPC Class Codes: G06F 9/4843 by program, e.g. task dispatcher, supervisor, operating system

Abstract

The present invention employs a master node for each job to be scheduled and in turn the master node distributes job start information and executable tasks to a plurality of nodes configured in a hierarchical node tree of a multinode job scheduling system. The status of the various tasks executing at the leaf nodes and other nodes of the tree report status back up the same hierarchical tree structure used to start the job, not to a scheduling agent but rather to the master node which has been established by the scheduling agent as the focal point, not only for job starting, but also for the reporting of status information from the leaf and other nodes in the tree.

Claims

1. A method for reporting job status in a multinode job processing system, said method comprising the steps of:

preserving information regarding a hierarchical tree of compute nodes, established during job launch, in respective ones of memory systems in said compute nodes; and

at least during job execution, returning job status information from said compute nodes to a master node higher in said tree.

2. The method of claim 1 in which the nodes in said tree include agents for handling return of job related data.

3. The method of claim 1 in which at least one node in said tree, during said job, retains an indication of structure for nodes beneath said at least one node in said tree.

4. The method of claim 1 in which said job status is selected from the group consisting of node readiness, job start, job completion and resource consumption.

5. The method of claim 1 in which nodes in said tree which are not leaf nodes consolidate said job status information received from other nodes in said tree.

6. The method of claim 1 in which said tree is a binary tree.

7. The method of claim 1 further including the step of providing a consolidated status report to a scheduling agent.

8. The method of claim 1 in which the nodes in said tree include agents for handling the transfer of job related data, said agents being able to process at least two jobs at the same time.

9. A multinode job scheduling system in which the memory systems therein contain program instructions for carrying out the steps of:

preserving information regarding a hierarchical tree of compute nodes, established during job launch in respective ones of memory systems in said compute nodes; and

at least during job execution, returning job status information from said compute nodes to a master node higher in said tree.

10. The method of claim 9 in which said job status is selected from the group consisting of node readiness, job start, job completion and resource consumption.

11. The method of claim 9 in which said tree is a binary tree.

12. The method of claim 9 further including the step of providing a consolidated status report to a scheduling agent.

13. The method of claim 9 in which the nodes in said tree include agents for handling the transfer of job related data, said agents being able to process at least two jobs at the same time.

14. A computer readable medium containing program instructions thereon for carrying out the steps of:

preserving information regarding a hierarchical tree of compute nodes, established during job launch in respective ones of memory systems in said hierarchical tree of compute nodes; and

at least during job execution, returning job status information from said compute nodes to a master node higher in said tree.

15. The method of claim 14 in which said job status is selected from the group consisting of node readiness, job start, job completion and resource consumption.

16. The method of claim 14 in which said tree is a binary tree.

17. The method of claim 14 further including the step of providing a consolidated status report to a scheduling agent.

18. The method of claim 14 in which the nodes in said tree include agents for handling the transfer of job related data, said agents being able to process at least two jobs at the same time.