International Business Machines Corporation

Other

Kailash N Marthi

Rosario A Uceda-Sosa

Steven R Champagne

Gregory D Laib

Wei Li

Marcos Nogueira Novaes

Alexander Druyan

Yun Xiang

Linda C Cham

Waiman Chan

Harshad Tanna

David Paul Brelsford

Stephen Craig Hughes

Ravindra R Sure

James E Burke, Jr

Veronica Kertesz

Arra R Rajeshwar

Shubha Lakshmi

Venkatarao Kandula

Saikrishna Nori

Abdul R Shareef

Don Whitehead

Subhash Garg

A scheduler receives flexible reservation requests for scheduling in a computing environment comprising consumable resources. The flexible reservation request specifies a duration and a required resource. The consumable resources comprise machine resources and floating resources. The scheduler creates a flexible job for the flexible reservation request and places the flexible job in a prioritized job queue for scheduling, wherein the flexible job is prioritizes relative to at least one regular job in the prioritized job queue. The scheduler adds a reservation set to a waiting state for the flexible reservation request. The scheduler, responsive to detecting the flexible job positioned in the prioritized job queue for scheduling next and detecting a selection of consumable resources available to match the at least one required resource for the duration, transfers the selection of consumable resources to the reservation and sets the reservation to an active state.

Workflow control of reservations and regular jobs using a flexible job scheduler

A scheduler receives at least one flexible reservation request for scheduling in a computing environment comprising consumable resources. The flexible reservation request specifies a duration and at least one required resource. The consumable resources comprise at least one machine resource and at least one floating resource. The scheduler creates a flexible job for the at least one flexible reservation request and places the flexible job in a prioritized job queue for scheduling, wherein the flexible job is prioritizes relative to at least one regular job in the prioritized job queue. The scheduler adds a reservation set to a waiting state for the at least one flexible reservation request. The scheduler, responsive to detecting the flexible job positioned in the prioritized job queue for scheduling next and detecting a selection of consumable resources available to match the at least one required resource for the duration, transfers the selection of consumable resources to the reservation and sets the reservation to an active state, wherein the reservation is activated as the selection of consumable resources become available and has uninterrupted use of the selection of consumable resources for the duration by at least one job bound to the flexible reservation.

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.

Dynamic allocation and partitioning of compute nodes in hierarchical job scheduling

Concurrent access to a global data repository is provided, while minimizing the number of locks acquired to provide the concurrent access. One or more resources within the global data repository have predefined relationships with one or more other resources of the repository. Thus, locking for a particular resource is based on its relationship with one or more other resources of the repository.

System and program products for efficiently locking resources of a global data repository

Method for efficiently locking resources of a global data repository

A client application sends a request to a given server of a replicated group of servers, and expects a response to the request. If the client does not receive a response to the request, or if the server is otherwise unavailable, the client is automatically reconnected to another server of the replicated group. The servers of the replicated group do not, however, have to have any knowledge of the communication session of the client.

Method, system and program products for automatically connecting a client to a server of a replicated group of servers

A utility for rapid development of three dimensional representations of electrical distribution switchgear is provided. These switchgear elevations have logical connections to the switchgear devices. An elevation can be modified to any dimensions with an infinite number of combinations and arrangements of meters and protection devices to quickly and accurately represent a customer's switchgear. Also, an event logger utility is provided for viewing, organizing and analyzing unusual behavior in a power system. The event logger utility passes a received message as an un-acknowledgeable or acknowledgeable alarm or as an event based upon the contents of a initialization file. A utility for the waveform capture is provided for viewing and analysis of waveforms (e.g., Fourier, frequency and/or harmonic analysis) captured by sophisticated metering devices. Waveforms from a device may be super-imposed for analysis. Processing of the collected waveform data to display any one of the eight waveform parameters (i.e., I, I, I, I, V, V, V, V) or a combination thereof including an 'all' selection in a window tiling format is provided.

Man machine interface for power management control systems

At least a portion of a table stored in a global data repository is selected to be accessed and modified. The selected portion is stored in a local table in local memory of a node of a client-server environment. The local table is modified, and then at least a portion of the modified local table is merged with the global table. The merger is performed without requiring any user locking of the global table.

Method, system and program products for modifying globally stored tables of a client-server environment

One or more tables stored in a global data repository are concurrently accessible and modifiable. A client requests the locking of one or more tables within a global server data repository on behalf of a local tree. This locking creates a lock block, which enables at least a portion of the locked tables to be selected, modified and then merged back with the tables residing in the server. One or more other clients may also request to use the same lock block and thus, the same local tree, if shared concurrency is allowed. These other clients would also be allowed to select, modify and merge at least a portion of the tables. The merging of the tables is serialized at the global data repository, if necessary.

Method, system and program products for concurrent write access to a global data repository

Write requests are performed against one or more resources of a resource group in a persistent and atomic manner. When a write request is received, a backup resource group is updated to reflect data in a current resource group. Thereafter, the write request is performed against the backup resource group. After successfully performing the write operation(s), the backup resource group and the current resource group are swapped in an atomic, consistent manner, such that the backup resource group is now the new current resource group.

Growing community of inventors

Poughkeepsie, NY, United States of America

Kailash N Marthi