Abstract: A common infrastructure for performing a wide variety of loop optimization transformations, and providing a set of high-level loop optimization related “building blocks” that considerably reduce the amount of code required for implementing loop optimizations. Compile-time performance is improved due to reducing the need to rebuild the control flow, where previously it was unavoidable. In addition, a system and method for implementing a wide variety of different loop optimizations using these loop optimization transformation tools is provided.

Abstract: A method, apparatus, and computer program product for using debug streams to control the amount of trace outputs when debugging software. As debug streams extend on the use of regular output streams, debug streams are very easy to use and simple to implement, while providing a high level of control over the verbosity of traces. A debug stream is created that includes a debug level setting to control the verbosity of the trace outputs. A determination is made as to whether the debug level setting in the debug stream is greater than a specified threshold level. Responsive to a determination that the debug level setting is greater than the specified threshold level, trace outputs are emitted to the debug stream.

Abstract: A cluster application deployment model provides an efficient computer implemented technique for the deployment of applications on a shared file system, and includes an automated mechanism for mapping the shared application image into the local file system of a new node of a cluster.

Abstract: There is disclosed a method and system for determining the bounds of generated software loops, where the relationships between split points and loop bounds are not known, or only partly known, at compile time. A “sub-range tree” is built with a root node representing the original software loop. Each sub-node represents a sub-range of the original software loop split by one or more split points. Each edge between nodes of the sub-range tree is marked with either a “then” (T) or “else” (E) marker, according to a predetermined scheme. Once the sub-range tree is built, a “path-from-root” is analyzed for each leaf node of the sub-range tree, and “dead” inductive control flow branches are identified and folded. The growth of software loop code based on the sub-range tree may be restricted by a predetermined code growth limit.

Abstract: A cluster application deployment model provides an efficient computer implemented technique for the deployment of applications on a shared file system, and includes an automated mechanism for mapping the shared application image into the local file system of a new node of a cluster.

Abstract: The present invention is directed to a transformation technique for nested loops. A virtual iteration space may be determined based on an unroll factor (UF). The virtual iteration space, which includes the actual iteration space, is formed such that, the virtual iteration space may be evenly divided by a selected UF. Once the virtual iteration space has been calculated or determined, the virtual iteration space is “cut” into regular portions by one or more unroll factors. Portions of the actual iteration space which do not fill the cut portions of the virtual iteration space or which fall outside these cuts which have been evenly divided by the unroll factor form a residue which is calculated. The portions of the actual iteration space which remain are also evenly divided by the unroll factor(s). An outer loop for this remaining portion of the actual iteration space is then unrolled. This unrolled portion forms a perfect nested loop.

Abstract: A cluster application deployment model provides an efficient computer implemented technique for the deployment of applications on a shared file system, and includes an automated mechanism for mapping the shared application image into the local file system of a new node of a cluster.