Intel Corporation

Chu-Cheow Lim

Tin-Fook Ngai

Zhao Hui Du

Hong Jiang

Guei-Yuan Lueh

Wei Ey Li

Dattatraya Kulkarni

Kalyan Muthukumar

Abhay Kanhere

Daniel M Lavery

Jean-Francois C Collard

Rakesh Krishnaiyer

Gerolf F Hoflehner

John Ng

Somnath Ghosh

Bixia Zheng

A method of compressing instructions in a program may include extracting unique bit patterns from the instructions in the program and constructing a linear programming formulation or an integer programming formulation from the unique bit patterns, the instructions, and/or the size of a memory storage. The linear programming formulation or the integer programming formulation may be solved to produce a solution. The method may include compressing at least some of the instructions based on the solution by storing at least some of the unique bit patterns in a memory and placing corresponding indices to the memory in new compressed instructions.

Optimal selection of compression entries for compressing program instructions

A method to optimize speculative parallel thread execution comprises selecting a plurality of partition candidate pairs for speculative parallel thread execution, transforming each partition candidate pair of the plurality of partition candidate pairs to improve the expected performance gain of each pair, and selecting a set of one or more transformed partition candidate pairs that do not interfere with each other and produce a maximum expected performance gain.

Mechanism to optimize speculative parallel threading

Disclosed are embodiments of a compiler, methods, and system for resource-aware scheduling of instructions. A list scheduling approach is augmented to take into account resource constraints when determining priority for scheduling of instructions. Other embodiments are also described and claimed.

Resource-aware scheduling for compilers

A Markov chain model of a software system may be used to compute all-pairs reaching probabilities to provide guidance in performing speculative operations with respect to the software system.

Computation of all-pairs reaching probabilities in software systems

An apparatus, method, and program product for optimizing code that contains dynamically-allocated memory. The aliasing behavior of internal pointers of dynamically-allocated memory is used to disambiguate memory accesses and to eliminate false data dependencies. It is determined whether a dynamically-allocated array will behave like a statically-allocated array throughout the entire program execution once it has been allocated. This determination is used to improve the instruction scheduling efficiency, which yields better performance.

Alias-free test for dynamic array structures

Growing community of inventors

Santa Clara, CA, United States of America

Chu-Cheow Lim