Abstract: A method, system and program product maintains consistency of data across a hierarchy of caches. Under the present invention, each data entry in the hierarchy of caches is assigned its own dependency identifier as well as the dependency identifiers of any data entries on which it depends. Thus, the present invention allows corresponding data entries to be linked for automatic invalidation.

Abstract: A method, apparatus, system, and signal-bearing medium that in an embodiment determine the active partitions of an application and assign the active partitions among servers via a routing table. The routing table is sent to a client, who uses the routing table to send requests and/or messages to the active partitions. In an embodiment, the routing table includes identifiers of the active partitions and the associated partitions. If one of the servers fails or if the partitions have a loading imbalance, the partitions are reassigned via the routing table.

Abstract: A method, computer program product, and a data processing system for transforming markup language documents is provided. A first markup language document in a first format to be transformed into a second document of a second format is obtained. A reference to a source of a data fragment to be inserted into the second document is identified. A data fragment cache is interrogated. A determination of whether the data fragment is located in the data fragment cache is made. The first markup language document is transformed into the second document. The second document includes the data fragment.

Abstract: A method, apparatus, and computer implemented instructions for handling requests in a network data processing system. The network data processing system includes a network and clients connected to the network. A first server is present in which the first server receives a request from a client to access a resource, performs an authentication process with the client, add information to the request in which the information indicates that the request is from a trusted source to form a modified request, and sends the modified request for processing. This modified request is received by a second server. This second server determines whether the first server is a trusted server based on the information, and provides access to the resource in response to a determination that the first server is a trusted server. If the second server receives the request directly from a client, it would process the request by itself instead of basing its trust on any of the known first servers.

Abstract: An object state caching method can include augmenting a compiled object having at least one referenced method with conditional caching logic. The conditional caching logic can be executed in an execution environment to determine whether to execute the referenced method. If the conditional caching logic determines not to execute the referenced method, the execution of the referenced method can be bypassed. Additionally, the stored object state can be retrieved from a communicatively coupled object cache. Finally, the retrieved object state can be forwarded to a requesting process. If, however, the conditional caching logic determines to execute the referenced method, the referenced method can be executed producing the resultant object state, and, the resultant object state can be cached in the coupled object cache.

Abstract: Incoming work units (e.g., requests) in a computing workload are analyzed and classified according to predicted execution. Preferred embodiments track which instrumented wait points are encountered by the executing work units, and this information is analyzed to dynamically and autonomically create one or more recognizers to programmatically recognize similar, subsequently-received work units. When a work unit is recognized, its execution behavior is then predicted. Execution resources are then allocated to the work units in view of these predictions. The recognizers may be autonomically evaluated or tuned, thereby adjusting to changing workload characteristics. The disclosed techniques may be used advantageously in application servers, message-processing software, and so forth.

Abstract: A method of caching contextually variant objects in a common cache. The method can include identifying an object type for a requested object and determining whether the requested object has an object type which is specified among an enumerated set of cacheable object types which can be stored in the common cache. Importantly, each cacheable object type can have an associated context. If the requested object has an object type which is specified among the enumerated set of cacheable object types, a cache key can be computed for the requested object using cache key formulation rules for the associated context. Finally, the requested object can be retrieved from the common cache using the formulated cache key. Notably, in one aspect of the invention, the method also can include the step of invalidating individual objects in the common cache according to corresponding cache policies of associated contexts.

Abstract: A method of caching contextually variant objects in a common cache. The method can include identifying an object type for a requested object and determining whether the requested object has an object type which is specified among an enumerated set of cacheable object types which can be stored in the common cache. Importantly, each cacheable object type can have an associated context. If the requested object has an object type which is specified among the enumerated set of cacheable object types, a cache key can be computed for the requested object using cache key formulation rules for the associated context. Finally, the requested object can be retrieved from the common cache using the formulated cache key. Notably, in one aspect of the invention, the method also can include the step of invalidating individual objects in the common cache according to corresponding cache policies of associated contexts.

Abstract: Controlling a cache of distributed data is provided by dynamically determining whether and/or where to cache the distributed data based on characteristics of the data, characteristics of the source of the data and characteristics of the cache so as to provide an indication of whether to cache the data. The data may be selectively cached based on the indication.

Abstract: A technique for permitting a developer to be presented with a visual programming environment which includes different representations of a class library from which a developer may select classes for inclusion in an application under development. The environment includes a class window, a composition editor window, and a methods window. To permit greater understanding of the class library that the developer is working with, the class library can be presented in the class window in a class tree format, in a class list format, or in a graphical format which includes graphical representations of the classes. The developer may select a class for inclusion in the application under development from any of the three formats. The methods window is provided for displaying the methods (code) for a selected class. The methods of a class may be modified or new methods added via the methods window after the class has been added to the application under development.

Abstract: Methods, systems, computer program products, and methods of doing business whereby programmatically-generated byte code insertion is used to perform run-time tracing of code that potentially encounters a wait during execution. The byte code insertion is performed at load time, and inserts byte codes before and after a located (potential) wait point. The inserted byte code functions to gather execution statistics, such as a time stamp before invoking a located wait point and a time stamp after invoking the located wait point. Preferred embodiments allow this tracing to be selectively activated/deactivated.

Abstract: A method, system and program product for maintaining data consistency across a hierarchy of caches is provided. Under the present invention, each data entry in the hierarchy of caches is assigned its own dependency identifier as well as the dependency identifiers of any data entries on which it depends. Thus, the present invention allows corresponding data entries to be linked for automatic invalidation.

Abstract: Workload is programmatically distributed across a set of execution resources. In a multithreaded server environment, response time to end users is improved while increasing the efficiency of software execution and resource usage. Execution time and wait/queued time are tracked, for various types of requests being serviced by a server. Multiple logical pools of threads are used to service these requests, and inbound requests are directed to a selected one of these pools such that requests of similar execution-time requirements are serviced by the threads in that pool. The number and size of thread pools may be adjusted programmatically, and the distribution calculation (i.e., determining which inbound requests should be assigned to which pools) is a programmatic determination. In preferred embodiments, only one of these variables is adjusted at a time, and the results are monitored to determine whether the effect was positive or negative.

Abstract: Thread pools in a multithreaded server are programmatically adjusted, based on observed statistics from the server's inbound workload. In a multithreaded server environment, response time to end users is improved while increasing the efficiency of software execution and resource usage. Execution time and wait/queued time are tracked, for various types of requests being serviced by a server. Multiple logical pools of threads are used to service these requests, and inbound requests are directed to a selected one of these pools such that requests of similar execution-time requirements are serviced by the threads in that pool. The number and size of thread pools may be adjusted programmatically, and the distribution calculation (i.e., determining which inbound requests should be assigned to which pools) is a programmatic determination. In preferred embodiments, only one of these variables is adjusted at a time, and the results are monitored to determine whether the effect was positive or negative.

Abstract: An object state caching method can include augmenting a compiled object having at least one referenced method with conditional caching logic. The conditional caching logic can be executed in an execution environment to determine whether to execute the referenced method. If the conditional caching logic determines not to execute the referenced method, the execution of the referenced method can be bypassed. Additionally, the stored object state can be retrieved from a communicatively coupled object cache. Finally, the retrieved object state can be forwarded to a requesting process. If, however, the conditional caching logic determines to execute the referenced method, the referenced method can be executed producing the resultant object state, and, the resultant object state can be cached in the coupled object cache.

Abstract: A method for securing cached data in an enterprise environment. The method can include processing a request to locate data in a query cache. If the data can be located in the query cache, the data can be retrieved from the query cache. Additionally, at least one encrypted portion of the retrieved data can be decrypted. Finally, the decrypted portion and any remaining unencrypted portion of the retrieved data can be forwarded to a requesting client. By comparison, if the data cannot be located in the query cache, the data can be retrieved from a back-end data source over a computer communications network, and forwarded to the requesting client. Additionally, at least a portion of the retrieved data can be encrypted and both the encrypted portion and any remaining unencrypted portion can be stored in the query cache.

Abstract: A method of caching contextually variant objects in a common cache. The method can include identifying an object type for a requested object and determining whether the requested object has an object type which is specified among an enumerated set of cacheable object types which can be stored in the common cache. Importantly, each cacheable object type can have an associated context. If the requested object has an object type which is specified among the enumerated set of cacheable object types, a cache key can be computed for the requested object using cache key formulation rules for the associated context. Finally, the requested object can be retrieved from the common cache using the formulated cache key. Notably, in one aspect of the invention, the method also can include the step of invalidating individual objects in the common cache according to corresponding cache policies of associated contexts.

Abstract: A Web application testing method. A network message from one of several network clients can be intercepted. Session data in the network message can be identified and state information retrieved for the session in the Web application. An operation and corresponding associated parameters can be selected from a Web scenario template based upon the retrieved state information. Finally, operations can be invoked in the Web application, the operations corresponding to the operation and associated operational parameters selected from the Web scenario template.

Abstract: A technique for visually creatins and populating a class with members. A developer is provided with a container window representing a new class when the developer indicates that a new class is to be built. The developer vary populate the new class with members in a number of ways, including dragging visual elements representative of code to the container window and dropping them in the container window. By dropping the visual element into the container, an association between the code the visual element represents and the class represented by the container window is established. This relationship is also displayed to the developer by displaying the visual element within the container window.

Abstract: A game lobby allows users to open a game with their name at a central place so that others may see and join that game. The user can set the criteria for starting this game, such as the number of players or start time, whichever comes first. This paradigm enables a platform-independent object model without the burden of multi-user communication management by the game developer. The object model enables the development of game lobby services by multiple vendors and allows games to freely operate with any of these lobby implementations.