D. Ung and C. Cifuentes. Optimising hot paths in a dynamic binary translator. In Workshop on Binary Translation, Oct. 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
METRIC: Tracking Down Inefficiencies in the Memory .. - Marathe, Mueller, .. (2003) (2 citations) (Correct)
....linear solvers with response times on the order of several minutes up to over an hour. We concentrate our efforts on providing feedback to a programmer quickly. A number of approaches address dynamic optimizations through binary translation and just in time compilation techniques for native code [27, 1, 8, 29, 12]. The main thrust of these techniques is program transformation based on knowledge about taken execution paths, such as trace scheduling. The transformations include the reallocation of registers and loop transformations (such as code motion and unrolling) to name a few. These efforts are ....
D. Ung and C. Cifuentes. Optimising hot paths in a dynamic binary translator. In Workshop on Binary Translation, Oct. 2000.
Partial Data Traces: Efficient Generation and.. - Mueller, Mohan.. (2001) (Correct)
....size, are known, and this knowledge may result in program transformations better geared toward a particular architecture. We can restrict these optimizations to hot paths that may be detected by instrumentation along the lines of portable frameworks that target di erent processors, such as UQBT [9, 23]. Our infrastructure permits these optimizations to occur o ine before the optimized code is injected into the application. The application may proceed to execute while the binary is being optimized, which reduces the overhead of dynamic compilation typically imposed by just in time compilation. ....
....These approaches involve linear solvers with response times on the order of several minutes up to over an hour. We concentrate our e orts on providing feedback to a programmer quickly. A number of approaches address dynamic optimizations through just in time compilation techniques for native code [2, 9, 23, 12]. The main thrust of these techniques is program transformation based on knowledge about taken execution paths, such as trace scheduling. The transformations include the reallocation of registers and loop transformations (such as code motion and unrolling) to name a few. These e orts are ....
D. Ung and C. Cifuentes. Optimising hot paths in a dynamic binary translator. In Workshop on Binary Translation, October 2000.
Dynamic Optimization in the Mainframe World - Bank, Garrett, Lethin (Correct)
....actually used gets optimized into a faster form. The system transitions to a point where nearly all time is spent in the optimized code and next to none in the slow emulation mode. A common feature of this picture is that the first pieces of optimized code will be replaced by better faster code [7][8]. In OOCT, we intended to replace compiled code segments both to use more complete profile information and to reduce slow jumps between segments. However, replaceable segments require a locking protocol to prevent them from being replaced when they are in use and we were surprised to find that the ....
David Ung and Cristina Cifuentes, "Optimising Hot Paths in a Dynamic Binary Translator", Workshop on Binary Translation
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC