For advanced profile-guided optimizations to be e ective in online environments, fine-grained and accurate pro- file information must be available at low cost. In this paper, we propose a generic framework that makes it possible for instrumentation based profilers to collect profile data e ciently, a task that has traditionally been associated with high overheads. The essence of the scheme is to make the underlying hardware aware of instrumentation using a special set of profile instructions and tuned micro-architecture. This not only allows the hardware to provide the runtime with mechanisms to control the profiling activity, but also makes it possible for the hardware itself to optimize the process of profiling in a manner transparent to ...
This paper investigates a possible architecture to a dynamically adaptable processor. In this archit...
Reconfigurable systems map the computational intensive parts of the code in hardware while less comp...
Abstract. Compilers can exploit knowledge that a variable has a fixed known value at a program point...
Profile-based optimizations can be used for instruction scheduling, loop scheduling, data preloading...
Microsoft ResearchAlthough runtime systems and the dynamic compilation model have revolutionized the...
Abstract Profile-based optimizations can be used for instruction scheduling, loop scheduling, data p...
Runtime profile gives considerable information that can be reused, to optimize the executable for fa...
Application profiling is an important step in the design and optimization of embedded systems. Accur...
In profiling, a tradeoff exists between information and overhead. For example, hardware-sampling pro...
For aggressive path-based program optimizations to be profitable in cost-sensitive environments, acc...
For aggressive path-based program optimizations to be profitable in cost-sensitive environments, acc...
Traditional compilers rely on static information about programs to perform optimizations. While such...
For aggressive path-based optimizations to be profitable in cost-senstive environments, accurate pat...
For aggressive path-based optimizations to be profitable in cost-senstive environments, accurate pat...
This paper investigates a possible architecture to a dynamically adaptable processor. In this archit...
This paper investigates a possible architecture to a dynamically adaptable processor. In this archit...
Reconfigurable systems map the computational intensive parts of the code in hardware while less comp...
Abstract. Compilers can exploit knowledge that a variable has a fixed known value at a program point...
Profile-based optimizations can be used for instruction scheduling, loop scheduling, data preloading...
Microsoft ResearchAlthough runtime systems and the dynamic compilation model have revolutionized the...
Abstract Profile-based optimizations can be used for instruction scheduling, loop scheduling, data p...
Runtime profile gives considerable information that can be reused, to optimize the executable for fa...
Application profiling is an important step in the design and optimization of embedded systems. Accur...
In profiling, a tradeoff exists between information and overhead. For example, hardware-sampling pro...
For aggressive path-based program optimizations to be profitable in cost-sensitive environments, acc...
For aggressive path-based program optimizations to be profitable in cost-sensitive environments, acc...
Traditional compilers rely on static information about programs to perform optimizations. While such...
For aggressive path-based optimizations to be profitable in cost-senstive environments, accurate pat...
For aggressive path-based optimizations to be profitable in cost-senstive environments, accurate pat...
This paper investigates a possible architecture to a dynamically adaptable processor. In this archit...
This paper investigates a possible architecture to a dynamically adaptable processor. In this archit...
Reconfigurable systems map the computational intensive parts of the code in hardware while less comp...
Abstract. Compilers can exploit knowledge that a variable has a fixed known value at a program point...