Abstract: Early exit of a loop is performed. A determination is made as to whether a loop within computer code reaches a fixed point of processing, which is predefined. Based on determining that the loop reaches the fixed point of processing, at least one indication is included in the loop to perform an early exit of the loop prior to a last iteration of the loop.

Abstract: Feedback-directed pass pipeline optimization in static compilation includes receiving a set of source input of source code by a static compiler. The static compiler initiates a compilation operation on the source code in which, in a pass pipeline during the compilation operation that creates an intermediate representation (IR) representing the source code, a set of optimization diagnostics identified during a first pass of the pass pipeline is emitted into a side file. The pass pipeline is then optimized using the set of optimization diagnostics.

Abstract: Code pattern matching is performed within computer code to determine whether the computer code includes an idiom from a predefined set of idioms. Based on determining that the computer code includes the idiom, a set of data items of the idiom to be analyzed is determined. The set of data items is analyzed with respect to one or more corresponding values from the computer code based on a set of constraints defined for the idiom to determine whether the set of data items satisfy one or more predefined conditions for the idiom. Based on the analyzing indicating that the one or more predefined conditions are satisfied, one or more code segments of the computer code including the idiom are replaced with replacement code to provide revised computer code.

Abstract: Feedback-directed pass pipeline optimization in static compilation includes receiving a set of source input of source code by a static compiler. The static compiler initiates a compilation operation on the source code in which, in a pass pipeline during the compilation operation that creates an intermediate representation (IR) representing the source code, a set of optimization diagnostics identified during a first pass of the pass pipeline is emitted into a side file. The pass pipeline is then optimized using the set of optimization diagnostics.

Abstract: Aspects include modeling data cache utilization for each loop in a loop nest; estimating total data cache lines fetched in one iteration of the loop; and determining the possibility of data cache reuse across loop iterations using data cache lines fetched and associativity constraints. Aspects also include estimating, for memory reference pairs, reuse by one reference of data cache line fetched by another; estimating total number of cache misses for all iterations of the loop; and estimating total number of cache misses of a reference for iterations of a next outer loop as equal to total cache misses for an entire inner loop. Aspects further include estimating memory cost of a loop unroll and jam transformation, without performing the transformation; and extending a data cache model to estimate best unroll-and-jam factors for the loop nest, capable of minimizing total cache misses incurred by the memory references in the loop body.

Abstract: Aspects include modeling data cache utilization for each loop in a loop nest; estimating total data cache lines fetched in one iteration of the loop; and determining the possibility of data cache reuse across loop iterations using data cache lines fetched and associativity constraints. Aspects also include estimating, for memory reference pairs, reuse by one reference of data cache line fetched by another; estimating total number of cache misses for all iterations of the loop; and estimating total number of cache misses of a reference for iterations of a next outer loop as equal to total cache misses for an entire inner loop. Aspects further include estimating memory cost of a loop unroll and jam transformation, without performing the transformation; and extending a data cache model to estimate best unroll-and-jam factors for the loop nest, capable of minimizing total cache misses incurred by the memory references in the loop body.

Abstract: Aspects include executing a first phase that includes injecting instrumentation into program code in response to identifying an inner conditional check in the program code and running the instrumented program with a representative workload. The injecting includes duplicating the inner conditional check and placing a duplicate of the inner conditional check before a respective original nested conditional check in the program code to create an instrumented program. The instrumented program includes a plurality of basic blocks including original basic blocks and a newly added basic block that includes the duplicate of the inner conditional check. The method also includes executing a second phase that includes collecting execution frequency values from counters associated with the basic blocks to form metadata used to make optimization decisions for the program code.

Abstract: A system and method are proposed for identifying multimedia files in a first database which are related to a textual term specified by a user. The textual term is used to search a second database of multimedia files, each of which is associated with a portion of text. The “second database” is usually composed of files from the databases of a very large number of servers connected via the internet. The multimedia files identified in the search are ones for which the corresponding associated text is relevant to the textual term. The identified multimedia files are used to generate a classifier engine. The classifier engine is then applied to the first database of multimedia files, thereby retrieving multimedia files in the first database which are relevant to the textual term. The user can optionally specify whether the retrieved multimedia files are relevant or not, and this permits a feedback process to improve the classifier engine.

Abstract: An effective method of allowing a sensor node to estimate its own position, based only on coarse distances to its neighbors, together with an embedding mathematical tool. This method involves four major steps for each of the nodes: estimating distances to and exchange distance information with nearby nodes; performing position estimation locally; broadcasting the result; and refining its estimation. It also supports nodes joining/leaving the network and nodes with lower power. Further, because useful information for position-based routing is already embedded during the position estimation process, no extra transmission is required for efficient route determination in reporting data to a collecting node.