International Business Machines Corporation

Peter Richard Badovinatz

Orvalle Theodore Kirby

John Arthur Pershing, Jr

Tushar Deepak Chandra

Larry Bert Brenner

Ajei Sarat Gopal

Marc Adam Kaplan

Marion Lee Blount

Jeffrey S Lucash

John Joseph Turek

Dennis Duane Jurgensen

Myung Mun Bae

Gregory D Laib

Chun-Shi Chang

Steven E Froehlich

John Joseph Edward Turek

Veronika Margaret Megler

Reinhard Theodor Buendgen

Vijay A Kumar

Krishna Kummamuru

Marcos Nogueira Novaes

Vijay Krishnarao Naik

Pradeep Varma

Juergen P Schneider

Thomas Lumpp

William Francis Jerome

Michael Anthony Schmidt

Ronald T Goering

Ajay Raina

Barry P Lubart

Jifang Zhang

Sameh Afif Fakhouri

John K Alex

Rong-Sheng Lee

Angelo Pruscino

Patrick O'Rourke

Chuhi Chang

Jeffrey R Hedglin

Orvalle Theordore Kirby

Jr John Arthur Pershing

Content items are revealed to a user based on whether they have been previously reviewed by the user. A number of content items are thus received over time. The content items may be discrete content items, or may be portions of a content stream, and may be received over different media. For each content item, it is determined whether the content item was previously reviewed by a user. Where the content item was not previously reviewed, the item is revealed to the user, such as by being displayed or announced to the user. Where the content item was previously reviewed, the item is hidden from the user, such as by being deleted, by being replaced with an alternative content item, and so on.

Based on repeated experience, system for modification of express and negating overload from media and optimizing referential efficiency

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

Based on repeated experience, system for modification of expression and negating overload from media and optimizing referential efficiency

Policy driven automation -  specifying equivalent resources

An embodiment of the invention provides a method of managing a cluster of networked resources and resource groups using rule-based constraints. This method includes the step of building a globally optimal cluster configuration of the resources in accordance with the rule-based constraints and a current state of the resources, including identifying for each of the resources and resource groups an availability and quality of service, which are determined by dependencies among the resources and resource groups, resource equivalency, constraints on the resources and network policies. The method comprises the further steps of bringing the cluster of resources on-line in a systematic manner, given the current state of each of the resources and resource groups; and with the cluster of networked resources on-line, determining dynamic dependencies of and configuration infomration about the cluster of resources (i) statically at defined times and (ii) dynamically during cluster operation.

Managing a cluster of networked resources and resource groups using rule - base constraints in a scalable clustering environment

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

A desired group of reachable nodes of a communications environment is provided. The desired group of reachable nodes includes one or more nodes that can communicate with one another via a same network of a plurality of networks of the communications environment. In one embodiment, the desired group of reachable nodes includes the largest set of nodes that can communicate with one another via a common network. A globally consistent view of this largest set of reachable nodes is provided to interested nodes of the communications environment.

Providing a globally consistent desired group of reachable nodes

Program product for an application programming interface that unifies a plurality of mechanisms into a single framework. The interface includes a mechanism for communicating between members of a process group of related processes, and a mechanism for synchronizing the related processes of the process group. Additionally, the application programming interface may include mechanisms for managing membership of the process group or a processor group of processors, and/or a mechanism for controlling a group state value for the process group.

Program product for an application programming interface unifying multiple mechanisms

In a multinode data processing system, the messages to be transmitted from node to node, per the request of an application program, are stored in a queue on one of the nodes. Acknowledgment of the receipt of the messages is used to control transmission of messages at future times by adjusting the maximum number of allowable messages to be sent from the queue and also by adjusting the time interval that the system waits before retransmitting unacknowledged messages. This permits the use of so-called 'unreliable' messaging protocols and relieves application programs and programmers from the burden of employing more complicated protocols.

Communication efficiency and performance in an unreliable communication environment

A method and program product for managing membership of process groups of a distributed computing environment. Requests to alter membership of a first process group are received and presented to the first process group as a batched request. However, requests to change the membership of a second process group are received and presented to the second process group serially. Thus, the manner in which requests are presented can be different for various process groups. Additionally, different types of requests can be presented to the same process group in a differing manner. For instance, requests to join a process group can be presented as a batched request and requests to leave the process group can be presented serially, or vice versa.

Utilizing batch requests to present membership changes to process groups

A barrier synchronization system in a distributed computing environment. A group of members, including a plurality of related processes executing on one or more processors of the distributed computing environment, is provided a protocol having a dynamic number of synchronization phases. The protocol is voted on by one or more members of the group to determine how the protocol should proceed for the group of members. The protocol may complete successfully, continue to another synchronization phase or be rejected. The group of members determines how many synchronization phases the protocol is to include.

System for barrier synchronization wherein members dynamic voting

An application programming interface that unifies a plurality of mechanisms into a single framework. The interface includes a mechanism for communicating between members of a process group of related processes, and a mechanism for synchronizing the related processes of the process group. Additionally, the application programming interface may include mechanisms for managing membership of the process group or a processor group of processors, and/or a mechanism for controlling a group state value for the process group.

Application programming interface unifying multiple mechanisms

Actions responsive to changes in the state of independent process groups whose process members are spread across a group of nodes in a distributed computing environment. The process groups are arranged in a hierarchy having source process groups and target process groups immediately above and dependent upon the source process groups. A change in the state or membership of a process group will result in a group services function of the nodes in the group injecting the change into the source group members of the affected group. When the action is successfully completed, the change is reflected up the hierarchy to the target group member or members. Upon successful action by the target group, the target group becomes the new source group which in turn may have target groups, and the changes are again reflected up the hierarchy to the new target groups.

System for serializing actions of independent process groups

Growing community of inventors

Kingston, NY, United States of America

Peter Richard Badovinatz