Abstract: A method for adding comments to deleted code includes maintaining a first version of a file in a code repository, providing the first version of a file available to a first user, receiving a second version of the file, the second version being an updated version of the first version of a file, the second version of the file including at least one segment of deleted code and at least one comment regarding the at least one segment of deleted code, simultaneously maintaining the second version of the file and the first version of the file in the code repository, providing the second version of the file to a second user, providing a comparison tool for comparing the first version of the file to the second version of the file, and receiving a modification approval indication including an approval of deletion of the at least one deleted segment.

Abstract: Embodiments include a system for loading components with complex intra-dependencies. Components in the system may be assigned at start up to a common loader module. The system detects reference cycles amongst the set of components in the system. All components in a reference cycle may be assigned for loading to the same common loader. This system avoids deadlock scenarios by identifying reference cycles at start up and assigning each cycle to a single common loader. The embodiments of the system also analyze components to be loaded that are identified after start up to determine if they cause a new reference cycle. Components that cause a new reference cycle may not be allowed to be loaded to prevent deadlock loading scenarios.

Abstract: Techniques for automatically installing an application on a device on a network include sending, to a server, data indicating device resources on the device. The device requests a database application from the server. The device downloads from the server an initial customized value for a configuration parameter based on the device resources and the database application. The device also downloads the database application. The device installs the database application with the initial customized value for the configuration parameter.

Abstract: A method and system of modifying instructions forming a loop is provided. A method of modifying instructions forming a loop includes modifying instructions forming a loop including: determining static and dynamic characteristics for the instructions; selecting a modification factor for the instructions based on a number of separate equivalent sections forming a cache in a processor which is processing the instructions; and modifying the instructions to interleave the instructions in the loop according to the modification factor and the static and dynamic characteristics when the instructions satisfy a modification criteria based on the static and dynamic characteristics.

Abstract: Mechanism for determining applicability of a software package for installation is described herein. In one embodiment, a process is provided to retrieve authentication information of a component from an installation descriptor file, where the descriptor file describes installation information of the software package. The software package may include one or more components and each component having zero or more sub-components. For at least one sub-component of at least one existing component that has already been installed, an image of the sub-component is authenticated using an authentication key extracted from the authentication information to determine whether the component can be installed based on the existing component. Other methods and apparatuses are also described.

Abstract: The inventions relate generally to computer systems having facilities for providing virtual portions of file systems and configuration settings to applications. More particularly, the inventions relate to computer systems that provide a layer organization for files and configuration settings that can be overlaid on top of an operating system. Detailed information on various example embodiments of the inventions are provided in the Detailed Description below, and the inventions are defined by the appended claims.

Abstract: A method, system and computer program product for converting, at run-time, a class of an object from a source class to a destination class. A statement in intermediate code indicating the conversion of the object from the source class to destination class is identified. The destination class is determined to be polymorphic to the source class. Memory space required for the destination class is determined to be less than or equal to the memory space required for the source class. A class hierarchy is traversed up and down at compile time to generate conversion code. At runtime and via up and down traversals of the class hierarchy, the pointer to a virtual function table (v-table) of the object is updated from referencing the v-table of the source class to referencing the v-table of the destination class.

Abstract: Distributed caching and download of file. A method is described that includes building a peer list comprising a listing of potential peer servers from among one or more networked computers. The peer list includes no more than a predetermined number of potential peer servers. Potential peer servers in the peer list are queried for a file or portion of a file. A message from a peer server in the peer list is received indicating that the peer server has the file or portion of a file available for download. The computer system downloads the file or portion of a file from the peer server.

Abstract: Methods and techniques for implementing a custom execution environment (CE2) and a related loader are provided. According to one embodiment, the CE2 includes code and data sections of an application and code and data sections of a set of system services. The set of system services has direct and full control of a set of hardware resources of a computer system containing one or more processors implementing a parallel protected architecture. According to one embodiment, the system services are designed for maximum simplicity, fastest possible speed, and elimination of security vulnerabilities.

Abstract: Operating system methods and techniques for supporting one or more custom execution environments (CE2s) are provided. According to one embodiment, a determination is made with respect to which system resources of a computer system, if any, are to remain under control of a resident operating system of the computer system and which of the system resources are to be placed under control of one or more CE2s. The system resources are then partitioned among the resident operating system and the one or more CE2s by associating one or more partitions of the system resources with the one or more CE2s. Such partitioning may be performed by the resident operating system by employing hardware-based isolation techniques provided by a processor of the computer system, performed by the resident operating system by employing a secure-platform interface, or configured by a system administrator via hardware partitioning capability provided by the computer system platform.

Abstract: A method and system for generating multi-byte equivalents based upon single byte source test data for use in testing a computer program. A method for testing multi-byte data handling can include the steps of converting each single byte native text character of a source string to a multi-byte equivalent to produce a multi-byte test string. Subsequently, the multi-byte test string can be provided to a testing tool for use when testing a computer program. Notably, the multi-byte equivalent can be a wide Latin equivalent.

Abstract: History of software execution and the associated messages are stored in repositories and their associated buffers. Each level of trace entry is expired at a different, tailored rate. The most detailed log, showing only the information immediately preceding the event, expires most quickly. This means that when the trace buffer is written to some storage medium at the point of failure, the trace entries are more frequent and detailed. However, as time passes, more of the details are lost. Nevertheless, the outline history of events, that would have been lost in the case of a uniform details level of tracing, is maintained. Therefore, information with at least some degree of details will be available further back in time to help the diagnosis.

Abstract: A method and system of auto parallelization of zero-trip loops that substitutes a nested basic linear induction variable by exploiting a parallelizing compiler is provided. Provided is a use of a max{0,N} variable for loop iterations in case of no information is known about the value of N, for a typical loop iterating from 1 to N, in which N is the loop invariant. For the nested basic induction variables, an induction variable substitution process is applied to the nested loops starting from the innermost loop to the outermost one. Then a removal of the max operator afterwards through a copy propagation pass of the IBM compiler is provided. In doing so, the loop dependency on the induction variable is eliminated and an opportunity for a parallelizing compiler to parallel the outermost loop is provided.

Abstract: Generating loop code to execute on Single-Instruction Multiple-Datapath (SIMD) architectures, where the loop operates on datatypes having different lengths, is disclosed. Further, a preferred embodiment of the present invention includes a novel techique to efficiently realign or shift arbitrary streams to an arbitrary offset, regardless whether the alignments or offsets are known at the compile time or not. This technique enables the application of advanced alignment optimizations to runtime alignment. This allows sequential loop code operating on datatypes of disparate length to be transformed (“simdized”) into optimized SIMD code through a fully automated process.

Abstract: Generating loop code to execute on Single-Instruction Multiple-Datapath (SIMD) architectures, where the loop operates on datatypes having different lengths, is disclosed. Further, a preferred embodiment of the present invention includes a novel technique to efficiently realign or shift arbitrary streams to an arbitrary offset, regardless whether the alignments or offsets are known at the compile time or not. This technique enables the application of advanced alignment optimizations to runtime alignment. Length conversion operations, for packing and unpacking data values, are included in the alignment handling framework. These operations are formally defined in terms of standard SIMD instructions that are readily available on various SIMD platforms. This allows sequential loop code operating on datatypes of disparate length to be transformed (“simdized”) into optimized SIMD code through a fully automated process.

Abstract: A method and apparatus for performing pipelined computations that include cross-iteration computations. The apparatus includes a functional unit having at least one input and an output, each input being operable to receive an input data value and an associated input data validity tag indicative of the validity of the input data value and the output being operable to provide an output data value and an associated output data validity tag indicative of the validity of the output data value. The first functional unit is operable in a first mode in which an output data value from the first functional unit is valid if all of the input data values are valid, and in a second mode in which the output data value from the first functional unit is valid if any of the input data values is valid.

Abstract: Methods, systems and articles of manufacture are provided for organizing, managing and utilizing standard development templates and framework components in an application development environment. Functionality provided by embodiments of the present invention allows developers to develop applications more efficiently and cost effectively.

Abstract: Methods, systems and articles of manufacture are provided for organizing, managing and utilizing standard development templates and framework components in an application development environment. Functionality provided by embodiments of the present invention allows developers to develop applications more efficiently and cost effectively.

Abstract: A compiler is provided for compiling at least one array or bank unit of a DRAM macro such that electrical performance, including cycle time, access time, setup time, among other properties, is optimized. The compiler compiles the DRAM macro according to inputted information. The compiler receives an input capacity and configuration for the DRAM macro. A compiler algorithm determines a number of wordlines and bitlines required to create the DRAM macro of the input capacity. The compiler algorithm optimizes the cycle time and access time of the DRAM macro by properly configuring a support unit of the DRAM macro based upon the number of wordlines and bitlines.