International Business Machines Corporation

Graham Derek Wallis

David Ware

William Thomas Newport

Colin Leonard Bird

John Justin Duigenan

Michael I Roper

Stephen James Todd

Graham John Wills

Michael Joseph Spreitzer

Srinivas Hasti

Timothy Nicholas Holloway

Ian Westbrook Parkinson

Lawrence Steven Evans

Christopher Henry Jones

Mark E Taylor

Vicente Rosselli Suarez

Stephen James Hobson

Brian Keith Martin

Andrew James Stanford-Clark

Gidon Gershinsky

Christoph Lingenfelder

Boaz Carmeli

Lucas William Partridge

Robert William Phippen

Lawrence Leon Porter

Andrew Key

Stephen James Cocks

Marc Stanley Carter

Neil G S Young

Michael George Taylor

Guy Patrick Hindle

Vincent Sethi

Michael Platt

Anthony Fyles

Christopher Wilkinson

Lindsey Louise Ashworth

Neil George Stanley Young

Richard Thomas Smith

Tom Evans

David John Howard

Helen Postlethwaite

Michael Ian Roper

For each vertex of a network graph that includes a set of vertices, a meta-property of the vertex is determined relative to other vertices of the set of vertices, a distance of the vertex from a user's viewpoint of a three-dimensional (3D) rendering of the network graph is determined, and a ranking figure is calculated as a function of the determined meta-property in combination with the determined distance. The set of vertices of the network graph is ranked as a function of the respective calculated ranking figures. Labels for a subset of the set of vertices are selectively displayed on a display as a function of the ranking.

Adaptive labeling of network graphs

For each vertex of a network graph that includes a set of vertices, a meta-property of the vertex is determined relative to other vertices of the set of vertices, a distance of the vertex from a user's viewpoint of a three dimensional (3D) rendering of the network graph is determined, and a ranking figure is calculated as a function of the determined meta-property in combination with the determined distance. The set of vertices of the network graph is ranked as a function of the respective calculated ranking figures. Labels for a subset of the set of vertices are selectively displayed on a display as a function of the ranking.

To enable adaptive monitoring of the resource, metrics about the workload received at the resource from one or more clients are used to derive monitoring feedback comprising a recommendation as to how the monitoring should be performed. This is then used as input to a decision making process controlling the monitoring of the resource. The recommendation may be for the monitor to increase or decrease its monitoring interval. The resource may decide to increase or decrease its monitoring depth or checking, or may suggest a new monitoring depth to the monitor.

Method, apparatus, and computer program product for enabling monitoring of a resource

A system for managing inbound messages in a server complex including one or more message consumers. The system includes a server configured to receive the inbound messages from a first peripheral device and to transmit messages to one or more of the plurality of message consumers. The system also includes an inbound message queue coupled to the server, the inbound message queue configured to store inbound message until an age of any message stored on the inbound message queue exceeds a predetermined threshold.

Inbound message rate limit based on maximum queue times

A method of performing message operations includes receiving a message operation request identifying a queue, retrieving a list of the subset of partitions associated with the alias received in the request, and selecting at least one of the partitions within the retrieved subset. According to the method, the queue includes a plurality of partitions, the request identifies the queue with an alias, and the alias having a subset of the plurality of partitions associated therewith.

Scoping an alias to a subset of queue partitions

The order of messages in an asynchronous message system is preserved, by generating a message and tagging the generated message with a sequence identifier and a sequence number. The order of messages is further preserved by processing the tagged message by checking a log to determine whether the sequence identifier is in the log, sending the tagged message to a selected consumer if the sequence identifier is not in the log and sending the tagged message to a particular consumer if the sequence identifier is in the log. Still further, the order of messages is preserved by writing an entry to the log having the sequence identifier and the sequence number of the tagged message and a consumer identifier of the selected consumer if the sequence identifier of the tagged message is not in the log.

System for preserving message order

There is disclosed a method, apparatus and computer program for an application instance to request attachment to a queue partition on a messaging server within a plurality of messaging servers, each messaging server holding at least one queue partition, the set of queue partitions together forming a single queue. An application instance requests attachment to a queue partition, the request requesting exclusivity with regard to other application instances having a common identifier. Responsive to an indicating that the request has been successful, the application instance interacts with the queue partition.

Method for attaching to a partitioned queue spread across a plurality of messaging servers

A method of routing messages to multiple consumers comprises determining a probability function defining message classification probabilities for each of a plurality of consumer sets, receiving a plurality of messages, classifying each message, storing each message in a queue, receiving notification of a consumer available to process a message, ascertaining the consumer set to which the available consumer belongs, accessing the probabilities for the ascertained consumer set, selecting a message classification according to the accessed probabilities, and transmitting a message, of the selected classification, to the available consumer.

Method of routing messages to multiple consumers

Order associated with messages is preserved in an environment wherein a message includes an associated order identifier; a receiver is operable to receive a first message associated with a first order identifier and a selection component is operable to select a first entity for processing the first message. The system includes a determination component for determining whether a notification associated with completion of processing of the first message has been received by the receiver; and a controller for controlling the selection component to select a second entity for processing the second message, in response to a combination of receipt of the notification and a second message associated with the first identifier being received by the receiver preceding the receipt of the notification.

Messages are redistributed in a clustered messaging environment including messaging servers and consuming applications. Each messaging server has a queue partition operable to contain messages. Each consuming application can connect to a messaging server in to consume one or more messages from a queue partition local to that messaging server. A message on a holding queue partition local to a messaging server without at least one consumer interested in consuming that message is said to be marooned. A marooned message is redistributed from the holding queue partition to a messaging server that does have at least one consumer interested in consuming the message. The redistribution involves identifying a group of servers, each of which has one or more consumers interesting in consuming the message, selecting a server from the group and forwarding the message to the selected server.

Redistributing messages in a clustered messaging environment

A variety of techniques are disclosed for efficient liveness monitoring in a reliable publish/subscribe multicast system having at least one broker and at least one subscriber, by: at the broker, sending () a status request message to the subscriber, and at the subscriber, sending () a status response message to the broker to indicate liveness. Status responses by subscribers may be suppressed when at least a chosen minimum number (&#x3e;=1) of subscribers send a response. This suppression (-) uses a system of 'response claim' messages and random back-off timers. These provide the advantage that the efficiency of network usage is improved by reducing the number of unwanted packets that are sent.

Liveness monitoring in a publish/subscribe messaging system

A method of synchronization for use in a distributed data processing system comprising a legacy computer having means for storing a master version of data, an application server, and a thin client computer which stores a copy of the master version of data. Firstly, the thin client executes operations locally on the copy. The operations are sent in a list to the application server. The application server executes the operations on the master data, on behalf of the thin client. If the operations can be executed successfully on the master version, synchronization occurs in that the successful operations are applied to the master version.

Synchronizing data in a distributed data processing system

A quorum-based server power-down mechanism allows a manager in a computer cluster to power-down unresponsive servers in a manner that assures that an unresponsive server does not become responsive again. In order for a manager in a cluster to power down servers in the cluster, the cluster must have quorum, meaning that a majority of the computers in the cluster must be responsive. If the cluster has quorum, and if the manager server did not fail, the manager causes the failed server(s) to be powered down. If the manager server did fail, the new manager causes all unresponsive servers in the cluster to be powered down. If the power-down is successful, the resources on the failed server(s) may be failed over to other servers in the cluster that were not powered down. If the power-down is not successful, the cluster is disabled.

Quorum-based power-down of unresponsive servers in a computer cluster

Folders of data from disparate application programs are organized in conformity to a reference taxonomy. A reference taxonomy for representing an organization of stored data found in multiple disparate application programs is created. Each application taxonomy from the multiple disparate application programs is compared to the reference taxonomy by a user. If the user decides to use the reference taxonomy, then the reference taxonomy replaces the application taxonomy for each of the multiple disparate application programs.

Growing community of inventors

West Wellow, United Kingdom

Graham Derek Wallis