International Business Machines Corporation

William Thomas Newport

John Joseph Stecher

Robert William Wisniewski

Erik John Burckart

Steven Joseph Branda

Chris D Johnson

Stephen M Fontes

Jared H Anderson

Brian Keith Martin

Jason Robert McGee

Graham Derek Wallis

Thomas R Gissel

James William Stopyro

Victor S Moore

Frederick Allyn Kulack

Christopher D Johnson

Craig Andrew Lanzen

Subbarao K Meduri

James Lee Van Oosten

Robert H High

Fred A Kulack

Edward M Lynch

Christopher Henry Jones

Gennaro A Cuomo

Stephen James Hobson

Jian Tang

Hao Wang

Jinmei Shen

Donald Francis Ferguson

Eric Nels Herness

Teresa Chung Kan

Pernell James Dykes

Stephen James Cocks

Kevin William Sutter

A Joseph Bockhold

John J Stetcher

Techniques are disclosed for implementing custom object-in-memory formats in a data grid network appliance. The techniques include maintaining a record of format definitions on a client device of the data grid and a corresponding record of format definitions on a server device of the data grid. Each format definition may indicate one or more attributes of an object class and data types and byte ranges of the attributes. The client device may serialize one or more objects for storage in the data grid based on respective format definitions associated with the one or more objects and retrieved from the record of format definitions maintained on the client device. Further, the server device may perform one or more data grid operations using format definitions retrieved from the record of format definitions maintained on the server device.

Custom object-in-memory format in data grid network appliance

A rules engine can be initialized as part of an object grid, wherein the rules engine is executable code executing using computer resources. The rules engine updates a business mapper. The rules engine receives a business rule definition to form a business rule. The rules engine determines business terms are present in the business rule. The rules engine converts the business terms to technical terms based on the business mapper, responsive to a determination that business terms are present. The rules engine determines that the business rule comprises a temporal rule. The rules engine receives rule criteria, wherein the rule criteria is at least one selected from the group consisting of frequency, delay and timing dependency, responsive to the determination that the business rule is a temporal rule. The rules engine stores the business rule to the rules engine. The rules engine publishes the business rule to a publish-subscribe topic.

Rule authoring for events in a grid environment

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

In an embodiment, a first debug agent at a first computer receives a packet. The first debug agent adds a debug command and an identifier of the first debug agent to the packet and sends the packet to a receiving computer. A second debug agent at the receiving computer removes the debug command and the identifier of the first debug agent from the packet and sends the packet to a second program that executes at the receiving computer. The second debug agent further executes the debug command, which causes the second program that executes on the receiving computer to halt execution at a breakpoint or address watch memory location. The second debug agent sends the state of the second program to the first debug agent, which presents, at the first computer, the state and a listing of the second program.

Distributed debugging

A method, apparatus and program product deallocate an object from a memory heap in a virtual machine environment by, in part, determining that the object is replaceable using an object reference associated with the object. The object may additionally be automatically determined as being properly removable by using a value indicative of a number of object references associated with the object. Where these conditions are met, the object may be removed from the memory heap. Where a new object can fit into a space within the memory from which the object was removed, the new object may be automatically allocated into the space. The object may be designated as being replaceable using automated or manual processes. A garbage collector algorithm may additionally execute, as needed.

Object deallocation system and method

A database access facility for accessing databases includes a monitoring function which monitors accesses by requestors of database data. The monitoring function tracks which database fields are requested to dynamically determine the fields which the application needs. Once sufficient tracking data is obtained, subsequent accesses to the database on behalf of an application are automatically modified by the application server to request only the fields which are likely to be needed. Preferably, the database access facility is an application server for one or middle tier applications which access the database on behalf of multiple clients in a three-tier client-server environment.

Autonomically regulating information transfer when accessing database resources

A combination of synchronous and asynchronous replication of data is used to replicate a local database to a replicated database. The typical tradeoff between synchronous and asynchronous replication is optimized by using hybrid replication, which is to use synchronous replication for inserting new data and asynchronous replication for updating existing data. The combined use of synchronous and asynchronous in this manner provides an efficient replicated database where the replicated database can tolerate some delay in data updates but requires no data loss of new data.

Real time data replication

An application server includes a connection pool that specifies a number of allowable connections, and includes a backend failure detection mechanism and a backend failure recovery mechanism. When the backend failure detection mechanism detects that the backend fails, applications waiting on the hung connections may be notified of the backend failure. The backend failure detection mechanism will then detect when the backend recovers and becomes available once again. Once the backend is available again, the backend failure recovery mechanism increases the number of connections in the connection pool to compensate for the hung connections. As each hung connection is timed out using a network timeout mechanism, the number of allowable connections is reduced. Eventually all of the hung connections will time out, with the result being that the connection pool will contain the same specified number of allowable connections it originally had before the backend failed.

Handling backend failover in an application server

Disclosed is an apparatus, method, service product, and program product which each provide an enhanced, registration-based event handler mechanism. Listener programs are located and compiled before notification is needed. When notification is ultimately required, the pre-located listeners can be called directly without incurring the performance expense associated with first locating and then calling each listener.

Mechanism that provides more efficient event handler processing

A method, apparatus and program product facilitate the collaborative development of an algorithm by, in part, displaying an algorithm associated with a performance attribute, and receiving user input relating to the algorithm from a plurality of networked users. The performance attribute of the algorithm may be automatically modified based on the user input. The modified performance attribute may be displayed to the plurality of networked users. A query may be received from a user interested in the algorithm. In response to the user query, the algorithm may be located from among a plurality of algorithms. For instance, the algorithm may be located from among the plurality of algorithms by matching the performance attribute to a criterion of the user query. Alternatively or additionally, the algorithm may be located by matching the performance attribute to a profile of the user submitting the user query. Also in response to the user query, a second algorithm and/or performance attribute related to the algorithm, or another, may be displayed.

Collaborative program development method and system

A method, apparatus and program product is provided for accessing data in an abstract data store. In response to receiving a key value, an object is created by converting the key value into a key tuple. A value tuple is requested from the abstract data store corresponding to the key tuple. The key tuple and value tuple are converted to the object by a projector, which then stores the object on an object graph. An object is saved to the abstract data store by persisting the object onto the object graph. The object is detected on the object graph by the projector. In response to detecting the object, the object is converted to a key tuple and a value tuple by the projector. The object graph is then synchronized with the abstract data store by pushing the key and value tuples to the abstract data store.

Generic bijection with graphs

Growing community of inventors

Rochester, MN, United States of America

William Thomas Newport