| R. L. Sites, A. Chernoff, M. B. Kirk, M. P. Marks, and S. G. Robinson, Binary translation, Comm. Assoc. Comput. Mach. 36 (February 1993), 69#81. |
....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 ....
R. L. Sites, A. Chernoff, M. B. Kirk, M. P. Marks, and S. G. Robinson. Binary translation. Communications of the ACM, 36(2):69--81, Feb. 1993.
....Recovery s IBM 360 decompiler [7] In this paper, we concentrate on the translation from SPARC assembly code to an imperative procedural language like C. Other target languages can benefit from the same techniques; we chose C due to its popularity in the Unix community. The reader is referred to [16, 6] for ways of translating machine code to assembly. Translation of assembly to HLL code requires a series of analyses in order to abstract away from the hardware features of assembly languages, and to recover the high level features available in most common procedural programming languages. The ....
R. Sites, A. Chernoff, M. Kirk, M. Marks, and S. Robinson. Binary translation. Commun. ACM, 36(2):69--81, Feb. 1993.
.... Department of Computer Science North Carolina State University 448 EGRC, Raleigh, NC 27695 7534 email: jpmarath unity.ncsu.edu, mueller cs.ncsu.edu Abstract Binary rewriting has enjoyed increasing popularity for onthe y optimization JITing as well as translation across different ISAs [1], 2] 3] 4] 5] We examine a novel application of binary rewriting, namely, we deploy binary manipulation techniques to pin point performance problems in the memory hierarchy. We extract reference information from applications in hot spots of execution and analyze the cache behavior with ....
....such as those frequently occurring 3 Declare A[n] B[n] n] initialize A with 0. for (i = 0; i n 1; i ) begin scope 1 for(j = 0; j n 1; j ) begin scope 2 A[i] A[i] B[i 1] j 1] end scope 2 end scope 1 Event Stream: enter scope 1 enter scope 2 A[0] B[1][1] A[0] exit scope 2 enter scope 2 A[1] B[2] 1] A[1] exit scope 2 . exit scope 1 RSD: start addr, length, addr stride,event type, start seq id,seq id stride,source table index PRSD: base addr, base addr shift, sequence id base, sequence id shift, PRSD length,RSD o sets in A: ....
[Article contains additional citation context not shown here]
R. L. Sites, A. Cherno, M. B. Kirk, M. P. Marks, and S. G. Robinson, \Binary translation," Communications of the ACM, vol. 36, no. 2, pp. 69-81, Feb. 1993.
....the absence of instruction overlap, simulator code can be instantiated for each instruction independently, thus simplifying simulator generation to the concatenation of the respective behavioral code specified in the LISA description. In contrast to direct binary to binary translation technqiues [15], the translation of target specific into host specific machine code uses C source code as intermediate format. This keeps the simulator portable, and thus independent from the the simulation host. Since the instruction based code translation generates program code that linearly increases in ....
R. Sites. Binary translation. Communications of the ACM, 36(2):69--81, Feb. 1993. 5662
....machines, intermediate languages and language independent execution platforms have fascinated language researchers for a long time. Well known examples include UNCOL [6] UCSD P code [23] ANDF [20] AS 400 [25] hardware emulators such as VMWare, Transmeta Crusoe TM [30] binary translation [26], the JVM [19] and most recently Microsoft s Common Language Infrastructure (CLI) 2] There are several reasons why people are looking at alternative implementation paths for native compilers: Portability By using an intermediate language, you need only n m translators instead of n # m ....
R. Sites, A. Chernoff, M. Kirk, and M. Marks. Binary Translation. CACM, 36(2):69--81, 1993.
.... design tradeoffs [8] operating system authors to debug their code [1] and to evaluate operating system performance [6, 25] parallel system architects to assess the performance of large systems [4, 9, 23] and end users to execute programs written for one system on a different host system [19, 26, 27]. Simulators also vary in their performance and the level of detail they can model. A common metric is the slow down, or the average number of simulator host instructions executed per simulated instruction (see work by Magnusson and others for a more extensive discussion of slow down [15, 12] ....
....techniques can improve the performance of macro simulators. Instead of decoding the operation fields each time an instruction is executed, the instruction is translated once into a form that is faster to execute. This idea has been used in a variety of simulators for a number of applications [8, 10, 17, 19, 26]. It is also used in some processors to translate an instruction set that programmers see into a more RISC like form that is more efficient to execute [7, 11] 3.3 Direct Execution The target program can also be executed directly on the simulator host [5, 13, 23] by encasing the program in an ....
Richard L. Sites, Anton Chernoff, Mathew B. Kerk, Maurice P. Marks, and Scott G. Robinson. Binary translation. Communications of the ACM, pages 69--81, February 1993.
.... [11] that architectures which do not run Intel x86 code may well be doomed for failure, regardless of their speed To solve the compatibility problem efficiently, there have been several proposals beyond plain or caching interpreters [10] One has been the object code translation approach (e.g. [20, 21, 22, 23]) where a software program takes as input an executable module generated for the old machine, and profile directed feedback information from past emulations, if available. It then generates a new executable module that can run on the new architecture (resorting to interpretation in some difficult ....
....self modifying code, generating a random number and using it as a branch target address, and so on) have been addressed, the static object code translation solution still has some problems. If object code translation is used to emulate applications written for one existing machine on another ([22, 23]) then many primitives may need to be generated to emulate one old architecture instruction, or unsafe simplifying assumptions may need to be made (e.g. about ordering of shared variable accesses, or the number of bits in the floating point representation) to get more performance, in which case ....
[Article contains additional citation context not shown here]
R. Sites et al. Binary Translation, CACM,Vol. 36, no.2, pp. 69-81, Feb. 1993.
No context found.
R. L. Sites, A. Chernoff, M. B. Kirk, M. P. Marks, and S. G. Robinson, Binary translation, Comm. Assoc. Comput. Mach. 36 (February 1993), 69#81.
No context found.
R. Sites, A. Chernoff, M. Kirk, M. Marks, and S. Robinson, "Binary Translation", Digital Technical Journal, Vol. 4, No. 4, Digital Equipment Corporation, Maynard, MA, 1992.
No context found.
R. L. Sites, A. Chernoff, M. B. Kirk, M. P. Marks, and S. G. Robinson, "Binary Translation", Communications of the ACM, Vol. 36, pp. 69-81, February 1993.
No context found.
R. Sites, A. Chernoff, M. Kirk, M. Marks, and S. Robinson. Binary translation. Communications of the ACM, 36(2):69--81, February 1993.
No context found.
Richard L. Sites, Anton Chernoff, Matthew B. Kirk, Maurice P. Marks, and Scott G. Robinson. Binary translation. Communications of the ACM, 36(2):69--81, 1993.
No context found.
Sites, R., Cherno#, A., Kirk, M., Marks, M., and Robinson, S., "Binary Translation", Communications of the ACM, Vol. 36, No. 2, February 1993
No context found.
Richard L. Sites, Anton Chernoff, Matthew B. Kirk, Maurice P. Marks, and Scott G. Robinson. Binary translation. Communications of the ACM, 36(2):69--81, 1993.
No context found.
R. Sites et al., "Binary translation," Commun. ACM, vol. 36, pp. 69--81, Feb. 1993.
No context found.
Richard L. Sites, Anton Chernoff, Matthew B. Kerk, Maurice P. Marks, and Scott G. Robinson, Binary Translation, Communications of the ACM, 36(2):69-81, February 1993.
No context found.
R. Sites, A. Chernoff, M. Kirk, M. Marks, and S. Robinson. Binary translation. Communications of the ACM, 36(2):69--81, February 1993.
No context found.
R.L. Sites, A. Chernoff, Kirk, M. Marks, and S. Robinson, "Binary Translation," Comm. ACM 36 (2), Feb. 1993.
No context found.
R.L. Sites, A. Chernoff, M.B. Kirk, M.P. Marks, and S.G. Robinson. Binary translation. Communications of the ACM, 36(2):69--81, February 1993.
No context found.
Richard L. Sites, Anton Chernoff, Matthew B. Kirk, Maurice P. Marks, and Scott G. Robinson. Binary translation. Communications of the ACM, 36(2):69--81, February 1993.
No context found.
R. L. Sites, A. Chernoff, M. B. Kirk, M. P. Marks, and S. G. Robinson. Binary translation. Communications of the ACM, 36(2):69--81, February 1993.
No context found.
Richard L. Sites, Anton Chernoff, Matthew B. Kirk, Maurice P. Marks and Scott G. Robinson, `Binary translation', Communications of the ACM, 36, (2), 69--81 (1993).
No context found.
R. Sites, A. Chernoff, Kirk, M. Marks, and S. Robinson, "Binary Translation," Comm. ACM 36 (2), Feb. 1993, pp. 69-81.
No context found.
R. L. Sites, A. Cherno, M. B. Kirk, M. P. Marks, and S. G. Robinson. Binary translation. Communications of the ACM, 36(2):69-81, February 1993.
No context found.
R.L. Sites, A. Chernoff, M.B. Kirk, M.P. Marks, and S.G. Robinson. Binary translation. Communications of the AUM, 36(2):69 81, February 1993.
First 50 documents Next 50
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