Patent application number | Description | Published |
20080301272 | QUORUM-BASED POWER-DOWN OF UNRESPONSIVE SERVERS IN A COMPUTER CLUSTER - 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. | 12-04-2008 |
20080301490 | QUORUM-BASED POWER-DOWN OF UNRESPONSIVE SERVERS IN A COMPUTER CLUSTER - 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. | 12-04-2008 |
20080301491 | QUORUM-BASED POWER-DOWN OF UNRESPONSIVE SERVERS IN A COMPUTER CLUSTER - 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. | 12-04-2008 |
20090013017 | Methods, Systems, and Computer Program Products for Optimizing Virtual Machine Memory Consumption - A method, system, and computer program product for optimizing virtual machine (VM) memory consumption are provided. The method includes monitoring VM accesses to a plurality of objects in a heap, and identifying a dead object among the objects in the heap. The method also includes copying the dead object to a data storage device as a serialized object, and replacing the dead object in the heap with a loader object. The loader object is smaller than the dead object and includes a reference to the serialized object. | 01-08-2009 |
20090064181 | UNOBTRUSIVE PORT AND PROTOCOL SHARING AMONG SERVER PROCESSES - A method for augmenting a hierarchy of layered applications and corresponding protocols can include applying a discrimination algorithm to a selection process in which a particular application/protocol layer in a listing of adjacent application/protocol layers is selected to receive traffic flowing through the hierarchy. A new application/protocol layer is inserted adjacent to the particular application/protocol layer in the hierarchy. Also, a new application/protocol layer is added to the listing, and the discrimination algorithm is replaced with another discrimination algorithm programmed to consider the new application/protocol layer during the selection process. Each of the steps of performing the inserting, adding and replacing steps are performed without decoupling or disabling other applications and protocols in the hierarchy. | 03-05-2009 |
20090150344 | Collaborative Program Development Method and System - 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. | 06-11-2009 |
20090150465 | Object Deallocation System and Method - 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. | 06-11-2009 |
20090213032 | Computer System Having Shared Display Devices - A computer system includes a first electronic device having a first display. The first display includes a first electronic image having an anchor point. The computer system also includes a second electronic device that is moveable relative to the first electronic device. The second electronic device includes a movement sensor and a second display operatively connected with the first display. The second display includes a second electronic image that is associated with the first electronic image. Upon sensing movement of the second electronic device relative to the first electronic device, the movement sensor determines a direction of the movement relative to the anchor point and triggers a shifting of the second electronic image relative to the anchor point of the first electronic image. | 08-27-2009 |
20090216784 | System and Method of Storing Probabilistic Data - A method of storing probabilistic data in accordance with an exemplary embodiment of the present invention includes capturing a first instance of a probabilistic data sample, storing the first instance of the probabilistic data sample as a probabilistic data record, collecting a second instance of the probabilistic data sample, refining the probabilistic data record with the second instance of the probabilistic data sample to establish a refined probabilistic data record, and saving the refined probabilistic data record in a probabilistic data record database. | 08-27-2009 |
20090254918 | Mechanism for Performance Optimization of Hypertext Preprocessor (PHP) Page Processing Via Processor Pinning - A method, system, and computer program product for optimizing “Hypertext Preprocessor” (PHP) processes by identifying the PHP pages which are active on a server and forwarding requests for specific pages to a processor which has recently processed that page. A request processing optimization (RPO) utility assigns an initial request received at the server for a PHP page based on a number of factors which may include a relative usage level of a processor within a pool of available processors on a server. The RPO utility assigns a request to additional processors based on: (1) a threshold frequency of page requests; and (2) a resource intensive factor of a page request measured by average response time of the page request. The assignment of PHP pages to a particular processor(s) enhances cache performance since the requisite code for a specific PHP page is loaded into the processor's cache. | 10-08-2009 |
20090254923 | Mechanism that Provides More Efficient Event Handler Processing - 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. | 10-08-2009 |
20100037244 | Method for Providing Inline Service-Oriented Architecture Application Fragments - A method for providing inline service-oriented architecture application fragments is disclosed. A remote procedure call is initially from a client application executing on a first data processing system by an application server executing on a second data processing system. The remote procedure call is a call to execute a service in a service-oriented architecture hosted by the application server. The remote procedure call includes a metadata tag indicating a preference for having computer-executable code corresponding to the service transmitted from the second data processing system to the first data processing system for execution on the first data processing system. A determination is made whether or not the service supports transmitting computer-executable code. If the service supports the transmitting computer-executable code, a service unit of work is transmitted to the first data processing system. If the service does not support transmitting executable code, the service is executed by the second data processing system to generate a result. | 02-11-2010 |
20100100894 | System and Method for Asynchronously Invoking Dynamic Proxy Interface Using Supplemental Interfaces - In a Java-based environment, a dynamic proxy runtime provides a client with the ability to asynchronously invoke an interface method, thereby unblocking the client and allowing it to perform other tasks while waiting for results to be returned from the runtime. The original interface is not redefined nor is the real target object implementation modified. Rather, the runtime defines rules which the client employs to define an additional asynchronous interface to supplement the original interface. | 04-22-2010 |
20100169289 | Two Phase Commit With Grid Elements - A method, storage medium, and computer that, in an embodiment, receive a command that specifies a transaction identifier, keys, and partition identifiers. A primary partition is selected that executes on a first server. The first server comprises a first grid element that includes a first row that is identified by an initial key. An identification of the first grid element, the transaction identifier, an identifier of the primary partition, and the initial key are stored in a primary factory point at the first server. A secondary partition that executes on a second server is found. The second server comprises a second grid element that includes a second row that is identified by a second key. An identification of the second grid element, the transaction identifier, an identifier of the secondary partition, and the second key are stored in a secondary factory point at the second server. | 07-01-2010 |
20110066592 | Real Time Data Replication - 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. | 03-17-2011 |
20110307871 | Distributed Debugging - 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. | 12-15-2011 |
20120089549 | RULE AUTHORING FOR EVENTS IN A GRID ENVIRONMENT - 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. | 04-12-2012 |
20120131598 | Mechanism that Provides More Efficient Event Handler Processing - 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. | 05-24-2012 |
20120179679 | Autonomically Regulating Information Transfer When Accessing Database Resources - 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. | 07-12-2012 |
20120215732 | RULE AUTHORING FOR EVENTS IN A GRID ENVIRONMENT - 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. | 08-23-2012 |
20130041869 | Real Time Data Replication - 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. | 02-14-2013 |
20140052736 | CUSTOM OBJECT-IN-MEMORY FORMAT IN DATA GRID NETWORK APPLIANCE - 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. | 02-20-2014 |
20140052744 | CUSTOM OBJECT-IN-MEMORY FORMAT IN DATA GRID NETWORK APPLIANCE - 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. | 02-20-2014 |