Dynamic allocation and partitioning of compute nodes in hierarchical job scheduling
US8381212B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Oct 9, 2007 |
| Grant date | Feb 19, 2013 |
| Priority date | — |
| Expiry date | Feb 24, 2031 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F9/4843
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.