Abstract: An approach is provided to trace a software program running in a multi-nodal complex computing environment. A trace request is sent from a requestor node to the nodes with the trace request associated with the software program and also associated with a transaction identifier. The software program is executed on the nodes. While the program is executing, trace data entries resulting from the execution of the software program are logged at the respective nodes with each trace data entry being associated with the transaction identifier. A log request is subsequently sent from the requestor node to the other nodes. The resulting trace data is then received by the requestor node from the target nodes and logged in a transaction based log. The transaction-based log is then provided to a user of the requestor node.

Abstract: An approach is provided to trace a software program running in a multi-nodal complex computing environment. A trace request is sent from a requestor node to the nodes with the trace request associated with the software program and also associated with a transaction identifier. The software program is executed on the nodes. While the program is executing, trace data entries resulting from the execution of the software program are logged at the respective nodes with each trace data entry being associated with the transaction identifier. A log request is subsequently sent from the requestor node to the other nodes. The resulting trace data is then received by the requestor node from the target nodes and logged in a transaction based log. The transaction-based log is then provided to a user of the requestor node.

Abstract: Protocols based upon recency of use of Web documents have, in the past, been relatively satisfactory in clearing of caches. However, the greatly accelerated use of the Web both in numbers of users and in the sizes of Web documents demands more effective processes for Web cache clearing. Accordingly, there is determined for each Web document in the cache, a retrieval hardship factor. Then, in the clearing of documents from the cache, this retrieval hardship factor will be used in combination with the recency of use protocols in determining which documents are to be cleared from the cache. The retrieval hardship factor may be effectively used in combination with either most recently used (MRU) or least recently used (LRU) cache garbage collection procedures. The hardship retrieval factor is preferably determined for each accessed and cached Web document by the owner or host of the Web site, i.e. the resource location or source database on the Web.

Abstract: The present invention comprises a method and an apparatus for managing the caching of a response. The caching of a response is managed by including in the response an indication of whether the response is to be cached, partially cached, or invalidated.

Abstract: A library of performance monitor recordings is maintained according to pathologies. The library is indexed to provide a facility to diagnosis poorly performing data processing systems, by capturing performance statistics and comparing these statistics against known problematic statistics. Remote diagnosis can easily be provided by a user capturing a performance session, saving to a file, and transferring the file to a central facility for comparison against its pathological libraries.