Abstract: A method, a computer program product, and a system for allocating a variable into storage class memory during compilation of a program. The method includes selecting a variable recorded in a symbol table during compilation and computing a variable size of the variable by analyzing attributes related to the variable. The method further includes computing additional attributes relating to the variable. The method also includes computing a control flow graph and analyzing the control flow graph and the additional attributes to determine an allocation location for the variable. The method further includes allocating the variable into a storage class memory based on the analysis performed.

Abstract: For migrating data to a remote data repository based on the security protocol capabilities of the remote data repository, a storage module identifies a security profile of a file residing in an on-premise data repository, where the security profile comprises security protocol requirements, matches the identified security profile with an entry in a list of one or more remote data repository providers, each entry comprising a security protocol capability of a corresponding remote data repository provider, and migrates, in response to finding a match of the identified security profile and the identified security protocol capability, the file to the matched remote data repository provider.

Abstract: A method, a computer program product, and a system for allocating a variable into storage class memory during compilation of a program. The method includes selecting a variable recorded in a symbol table during compilation and computing a variable size of the variable by analyzing attributes related to the variable. The method further includes computing additional attributes relating to the variable. The method also includes computing a control flow graph and analyzing the control flow graph and the additional attributes to determine an allocation location for the variable. The method further includes allocating the variable into a storage class memory based on the analysis performed.

Abstract: Predicting physical memory attributes by compiler analysis of code blocks includes receiving source code including at least one code block, and identifying a buffer associated with the at least one code block. Buffer access characteristics associated with the buffer are determined from the at least one code block. The buffer access characteristics are mapped to physical memory attributes associated with one or more physical memories of a computing system. Executable program code including a system call associated with memory allocation is generated based upon the physical memory attribute values.

Abstract: For migrating data to a remote data repository based on the security protocol capabilities of the remote data repository, a storage module identifies a security profile of a file residing in an on-premise data repository, where the security profile comprises security protocol requirements, matches the identified security profile with an entry in a list of one or more remote data repository providers, each entry comprising a security protocol capability of a corresponding remote data repository provider, and migrates, in response to finding a match of the identified security profile and the identified security protocol capability, the file to the matched remote data repository provider.

Abstract: A translation component, such as a compiler, recognizes comments of a program and uses those comments to provide optimization recommendations or to generate optimized code to improve processing within a computing environment. The comments are translated into structures recognizable by translation phases to generate more efficient code or pragmas to improve performance.

Abstract: Systems, methods, and computer program products relating to compiling source code to reduce memory operations during execution. A compiler receives source code. The compiler identifies an indirect access array operation in the source code. The compiler generates replacement code for the indirect access array operation. The replacement code includes a mask array and a union data structure. The compiler generates modified code. The modified code modifies the source code to include the replacement code in place of the indirect access array operation.

Abstract: Systems, methods, and computer program products relating to compiling source code to reduce memory operations during execution. A compiler receives source code. The compiler identifies an indirect access array operation in the source code. The compiler generates replacement code for the indirect access array operation. The replacement code includes a mask array and a union data structure. The compiler generates modified code. The modified code modifies the source code to include the replacement code in place of the indirect access array operation.

Abstract: A translation component, such as a compiler, recognizes comments of a program and uses those comments to provide optimization recommendations or to generate optimized code to improve processing within a computing environment. The comments are translated into structures recognizable by translation phases to generate more efficient code or pragmas to improve performance.

Abstract: A method for reducing loop branches comprises analyzing an intermediate code to identify a candidate loop; analyzing the candidate loop to identify a candidate conditional statement containing at least one mutable operand; and determining if the computation in the candidate conditional statement is monotonic. The method further comprises calculating initial and final values of the mutable operand and generating a first version of the candidate loop which does not contain the candidate conditional statement and which is configured to be executed if the initial and final values of the mutable operand satisfy a range check. The method also comprises generating a second version of the candidate loop which contains the candidate conditional statement and which is configured to be executed if at least one of the initial and final values of the mutable operand does not satisfy the range check.