Abstract: The present invention discloses a system and a method for resource data classification and management. In operation, the present invention provides for evaluating a deployment probability score for each incoming data-record based on previous data-records. Further, a match score of each incoming data-record is computed. Furthermore, each incoming data-record is analyzed to determine a bench period associated with each incoming data-record. Yet further, the present invention, categorizes the incoming data-records into two or more categories based on corresponding deployment probability score, match score and bench period. A deployment opportunity index is generated for each incoming data-record representing the categories and corresponding probability score, match score and bench period, providing an upfront indication of deploy-ability of an incoming data-record. Finally, the present invention provides for generating a list of recommendations for each data-record.

Abstract: The present invention discloses a system and a method for resource data classification and management. In operation, the present invention provides for evaluating a deployment probability score for each incoming data-record based on previous data-records. Further, a match score of each incoming data-record is computed. Furthermore, each incoming data-record is analyzed to determine a bench period associated with each incoming data-record. Yet further, the present invention, categorizes the incoming data-records into two or more categories based on corresponding deployment probability score, match score and bench period. A deployment opportunity index is generated for each incoming data-record representing the categories and corresponding probability score, match score and bench period, providing an upfront indication of deploy-ability of an incoming data-record. Finally, the present invention provides for generating a list of recommendations for each data-record.

Abstract: A system and method for optimization of code with non-adjacent loops. A compiler builds a node tree, which is not a control flow graph, that represents parent-child relationships of nodes of a computer program. Each node represents a control flow statement or a straight-line block of statements of the computer program. If a non-adjacent loop pair of nodes satisfy predetermined conditions, the compiler may perform legal code transformations on the computer program and corresponding node transformations on the node tree. These transformations may make adjacent this pair of loop nodes. The compiler may be configured to perform legal code transformations, such as head and tail duplication, code motion, and if-merging, in order to make adjacent these two loop nodes. Then loop fusion may be performed on this loop pair in order to increase instruction level parallelism (ILP) within an optimized version of the original source code.

Abstract: A system and method for optimization of code with non-adjacent loops. A compiler builds a node tree, which is not a control flow graph, that represents parent-child relationships of nodes of a computer program. Each node represents a control flow statement or a straight-line block of statements of the computer program. If a non-adjacent loop pair of nodes satisfy predetermined conditions, the compiler may perform legal code transformations on the computer program and corresponding node transformations on the node tree. These transformations may make adjacent this pair of loop nodes. The compiler may be configured to perform legal code transformations, such as head and tail duplication, code motion, and if-merging, in order to make adjacent these two loop nodes. Then loop fusion may be performed on this loop pair in order to increase instruction level parallelism (ILP) within an optimized version of the original source code.