Abstract: Start times are determined for jobs to be executed in the future in a multi-cluster environment. The start times are, for instance, the earliest start times in which the jobs may be executed. The start times are computed in logarithmic time, providing processing efficiencies for the multi-cluster environment. Processing efficiencies are further realized by employing parallel processing in determining the start times.

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.

Abstract: Start times are determined for jobs to be executed in the future in a multi-cluster environment. The start times are, for instance, the earliest start times in which the jobs may be executed. The start times are computed in logarithmic time, providing processing efficiencies for the multi-cluster environment. Processing efficiencies are further realized by employing parallel processing in determining the start times.

Abstract: A fault tolerant capability for the reliable collection and aggregation of disparate data from multiple processing units. Data of a processing unit is collected and locally aggregated at that processing unit. The locally aggregated data is stored in a local database, and periodically forwarded to a central manager. In response to receiving the data, the central manager determines whether the data should be included in a total aggregate of data for the processing environment.

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.

Abstract: A method and apparatus for providing common access to data spaces by a plurality of virtual machine guests emulated on a host computer system. A token received from a given one of the virtual machine guests is used to identify a particular host data space. The guest also supplies an offset. The offset and the identified host data space are then used to derive a host absolute address representative of a data location in the host data space.

Abstract: The invention disclosed and claimed herein provides a method for a virtual machine, which maps to the V=R region of a host machine's address space, to resume program execution successfully when the host operating system terminates and subsequently restarts successfully after the occurrence of a system incident. The system incident brings the computer system down, but with a reasonable chance that the system will be able to bounce. A bounce occurs when the host operating system nucleus is reinitialized or refreshed. The virtual machine will be allowed to survive the system incident as long as its integrity can be maintained, i.e. as long as its status and in-progress work can be preserved.