International Business Machines Corporation

Jeffrey S Lucash

Gregory D Laib

Marcos Nogueira Novaes

Ronald T Goering

George Sohos

Peter Richard Badovinatz

Chun-Shi Chang

Michael Anthony Schmidt

Reinhard Theodor Buendgen

Myung Mun Bae

Juergen P Schneider

Thomas Lumpp

Steven E Froehlich

Rong-Sheng Lee

John K Alex

Richard Edwin Harper

Larry Bert Brenner

Ravi Shankar

David Carl Frank

Rosario A Uceda-Sosa

Kyung D Ryu

Thomas V Weaver

Harry Cheselka

Barry P Lubart

John C Rathjen, Jr

Thomas Van Weaver

Ronald S Harter

Ronald Sasala

William R Vincent

Joy L Mann

Chuhi Chang

Robert J Major

An aspect of this invention is a method that includes evaluating a computing environment by performing auditing of a fault tolerance ability of the computing environment to tolerate each of a plurality of failure scenarios; constructing a failover plan for each of the plurality of scenarios; identifying one or more physical resource limitations which constrain the fault tolerance ability; and identifying one or more physical resources to be added to the computing environment to tolerate each of the plurality of failure scenarios.

Systems and methods for open and extensible integration of management domains in computation and orchestration of resource placement

An autonomic computing system and method determine that a desired end state cannot be reached, determine that an acceptable sub-state can be reached using at least one of priority ratings, conditional relationship specifications, and alternative relationship specifications, and place the computing system in an acceptable sub-state. The priority ratings can contain an attribute assigned to a policy definition that determines a sequence for applying the policy definition. The attribute can be 'mandatory', a numerical value, or 'not required'. The conditional relationship specifications have policy definitions that are applied when the state of a specified resource meets a predetermined requirement. An alternative relationship specification has policy definitions and/or conditional relationship specifications that are applied when the state of a specified resource does not meet a predetermined requirement.

Policy driven autonomic computing-programmatic policy definitions

An autonomic computing system and method store a set of resource equivalencies in memory, select at least one resource equivalency from the set of resource equivalencies, and use the selected at least one resource equivalency for operating the selected resource as required by an autonomic computing system. The set of equivalent resources can contain a plurality of physically distinct resources that are logically equivalent. Resources are added or removed from the set automatically. Equivalent sets can be nested within an equivalent set.

Policy driven automation&#x2014;specifying equivalent resources

A three-dimensional data structure for storing data is defined and maintained. The three-dimensional data structure includes at least one column of data having a depth greater than zero indicating that multiple data values are provided for multiple domains represented by the structure. The data structure also includes zero or more columns of data having a depth of zero indicating that the data value of a zero depth column is invariable for a plurality of domains represented by the structure. The structure is maintained by employing various operations including, create, write and read operations.

Three-dimensional data structure for storing data of multiple domains and the management thereof

Policy driven automation -  specifying equivalent resources

An autonomic computing system and method determine policy definitions () and a set of available actions (); monitor resources distributed within the system; determine if the system is at a desired end state; and modify resource states by sending instructions for the resources to perform available actions. The policy definitions () specify: start order between resources, prioritization between resources, conditional activation of policies, desired end state of resources, and location limitation of resources. The system and method receive status information from available resources, and monitor and modify the system until it reaches the desired end state. The policy definitions () can be determined by specifying a user-defined system end state and resource relationships. The policy definitions () can further harvest implicit relationships between resources, via self-discovery, and underlying relationships among resources.

Policy driven autonomic computing-specifying relationships

Various components are provided to manage a clustered environment. These components include a System Registry that provides a global data storage; a Configuration manager that stores data locally on nodes of the clustered environment and globally within the System Registry; a Liveness component to provide status of communications paths of the cluster; a Group Services component that provides services to one or more other components of the clustered environment; and a Resource Management component that communicates with one or more resource controllers of the clustered environment. Each of the components of the clustered environment has one or more data and/or functional dependencies on one or more other components of the environment. However, relationships between the components are created such that the data and functional dependencies form an acyclic graph (i.e., a cycle of dependency relationships is avoided).

Method, system and program products for managing a clustered computing environment

Method, system and program products for ordering lists of service addresses to provide load balancing of a clustered environment

Method, system and program products for managing identifiers of components of a clustered environment

Method, system and program products for managing cluster configurations

The management and use of replicated distributed transactions is facilitated. A distributed synchronous transaction system protocol is provided to manage the replication of distributed transactions for client application instances. The distributed synchronous transaction system allows transactions to be replicated without having the client application instances be aware of other instances to receive the transaction. Further, if a failure occurs during processing of a distributed replicated transaction, the distributed synchronous transaction system manages the recovery of the failure.

Method, system and program products for serializing replicated transactions of a distributed computing environment

Method, system and program products for providing clusters of a computing environment

Method, system and program products for defining nodes to a cluster

A facility is provided for managing a service connection between a client process having a single threaded library and a server process. The facility includes monitoring activity of a client code of the client process by the client library, and commensurate therewith monitoring activity of the client library across a service connection to the server process, wherein activity of the client library on the service connection is indicative of activity of the client code. The service connection between the client process and the server process is terminated if a message is not received at the server process from the single threaded client library within a defined tolerance interval. Upon termination of the service connection, any locked client resource is recovered at the server process.

Facility for managing a service connection between a client process having a single threaded library and a server process

Growing community of inventors

Hurley, NY, United States of America

Jeffrey S Lucash