Abstract: The present invention is directed to a system and method for monitoring system performance by sampling instructions in a burst mode, rather than once per interrupt. A burst mode may be configurable for a number of instructions per burst. Furthermore, these instructions are counted using a dynamic tree structure, rather than a log, which results in substantial savings in storage. The present invention requires minimal changes to the operating system, and no changes to application code that is being monitored. No recompilation is necessary to use the present invention. In addition, the present invention provides a system and method for monitoring code segments that are disabled for interrupts, and thus are difficult, if not impossible, to monitor using prior art performance tools. In a multi-processor system, the burst mode is active on all processors at the same time, and each processor has its own dynamic tree structure.

Abstract: The present invention is directed to a system and method for monitoring performance in an information handling system in a minimally intrusive manner. The method of the present invention includes a collection phase, a placement phase, and an instrumentation phase. During the collection phase, a workload (i.e. code segment) is traced, and instruction and data accesses are determined. During the placement phase, the trace data is passed to a cache simulator. The cache simulator uses the trace data, along with hardware and instrumentation characteristics, to determine an optimal placement for instrumentation code and data. If the desired conflict level is not attainable, the best possible placement is found by executing the code to be monitored with a variety of instrumentation code and data placements until the least intrusive placement is found. The best possible placement is then used during the instrumentation phase to actually execute the instrumented code.

Abstract: The present invention is directed to a system and method for monitoring system performance by using a multi-phase approach. The first phase, referred to as the burst counting phase, utilizes a set of counters to identify calls and returns which are heavily used. In the second phase, referred to as the instrumentation phase, the performance characteristics of the "hot spots" are monitored through the use of hardware counters. In a symmetrical multi-processor embodiment, the performance profiler is active on all processors at the same time. Frequently executed code paths are identified in a manner that is minimally-intrusive to the system as a whole, and uses relatively little storage. The user may specify a threshold count, after which hardware monitoring begins, and the user may specify the type of hardware performance data collected. After both phases of the performance monitor are run, the data can be presented to the user in a variety of ways.

Abstract: The present invention is directed to a system and method for monitoring system performance by sampling instructions in a burst mode, rather than once per interrupt. A burst mode may be configurable for a number of instructions per burst. Furthermore, these instructions are counted using a dynamic tree structure, rather than a log, which results in substantial savings in storage. The present invention requires minimal changes to the operating system, and no changes to application code that is being monitored. No recompilation is necessary to use the present invention. In addition, the present invention provides a system and method for monitoring code segments that are disabled for interrupts, and thus are difficult, if not impossible, to monitor using prior art performance tools. In a multi-processor system, the burst mode is active on all processors at the same time, and each processor has its own dynamic tree structure.

Abstract: The present invention relates to a milk protein mixture useful for promoting growth of animal cells, for treating a surface wound, or for treating a gastrointestinal injury, disease, or ulcer, methods for preparing the milk protein mixture and methods employing the milk protein mixture. The milk protein mixture is prepared from a milk product such as cheese whey employing a cation exchange resin suitable for absorbing the milk protein mixture, filtering, and concentrating the product of cation exchange. The milk protein mixture for promoting growth of animal cells also includes a liquid culture medium. The milk protein mixture for treating a surface wound or for treating a gastrointestinal injury, disease, or ulcer also includes a pharmaceutically or veterinarily acceptable diluent, carrier, or excipient.

Abstract: A method, apparatus and article of manufacture for managing pages of virtual storage in a computer system by delaying the actual release of a page by the system after its release has been requested by a guest program of the system, resulting in pending page releases. Establishment of a pending page release results in an entry in a log of pending page release, leaving the page(s) allocated to the guest. The system can release pages in the log at any time. The guest can request cancellation of pending page releases, in which case the requested pages are removed from the log for reuse by the guest if they have not already been released by the system. Key setting, page clearing or formatting, and page validation or staging, are optional services which can be included in cancellation requests. Establishment and cancellation are preferably requested by the guest using the intercepted instruction DIAGNOSE, and are performed by a storage manager component of the host operating system.

Abstract: Minimizing data cache misses when performing binary searches. Values in an array to be searched are stored as subsets, clustered to minimize the number of cache misses. A first set of auxiliary values is created consisting of a subset of the first-searched values that fit on one cache line. Subsequent sets of values are then created consisting of one cache line full of values for each value in the first set within one cache line. A binary search is conducted by first searching SET ONE, for the largest array value that is less-than or equal to the search key, or alternatively the smallest array value greater than or equal to the search key. The search of SET ONE, is followed by a search of any subsequent sets of values, with the binary search concluding by testing values within one cache line in the subsequent sets of values until the desired value is found.

Abstract: A simple, quick, quiet load-release device which comprises a standard thred nut cut into three sections along its length. The three sections are held together by use of a heat meltable tape which is wrapped around the nut. A resistance wire is laid between layers of the tape and upon application of a current through the resistance wire, the tape melts permitting the nut sections to separate and release any load supported by the release device.