MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Adaptable Binary Programs (1994) [5 citations — 0 self]

Download:
pdf | ps
by Robert Wahbe, Steven Lucco, Susan L. Graham
In
ftp://reports.adm.cs.cmu.edu/usr/anon/1994/CMU-CS-94-137.ps
Add To MetaCart

Abstract:

To accurately and comprehensively monitor a program's behavior, many performance measurement tools must transform the program's executable representation or binary. By instrumenting binary programs to monitor program events, tools can precisely analyze compiler optimization effectiveness, memory system performance, pipeline interlocking, and other dynamic program characteristics that are fully exposed only at this level. Binary transformation has also been used to support software-enforced fault isolation, debugging, machine re-targeting and machine-dependent optimization. At present, binary transformation applications face a difficult trade-off. Previous approaches to implementing robust transformations incur significant disk space and run-time overhead. To improve efficiency, some current systems sacrifice robustness, relying on heuristic assumptions about the program and recognition of complex, compiler-dependent code generation idioms. In this paper we present adaptable binaries, a technique for implementing robust, efficient, and compiler-independent binary transformations. We evaluated a prototype implementation of adaptable binaries under the Ultrix 4.2 operating system and the MIPS processor architecture. Using the C spec92 benchmarks, we assessed adaptable binaries in three ways. First, we demonstrated that the information necessary to build adaptable binaries

Citations

760 A universal algorithm for sequential data compression – Lempel, Ziv - 1977
578 Efficient software-based fault isolation – Wahbe, Lucco, et al. - 1993
207 Purify: Fast detection of memory leaks and access errors – Hastings, Joyce - 1992
176 Global register allocation at link time – Wall - 1986
147 A practical system for intermodule code optimization at link-time – Srivastava, Wall - 1992
104 Rewriting executable files to measure program behavior – Larus, Ball - 1992
89 Systems for Late Code Modification – Wall - 1991
87 Generation and analysis of very long address traces – KESSLER, WALL - 1990
87 MemSpy: Analyzing memory system bottlenecks in programs – MARTONOSI, GUPTA, et al. - 1992
78 Fast breakpoints. design and implementation – KESSLER - 1990
54 Experience with a software-defined machine architecture – Wall - 1991
36 MTOOL: A Method For Detecting Memory Bottlenecks.’’ Aaron Goldberg and – Hennessy - 1990
29 Practical data breakpoints: design and implementation – Wahbe, Lucco, et al.
15 OptimaJly profiling and tracing – BaJl, Larus - 1992
15 Postloading for fun and profit – Johnson - 1990
5 HP3000 emulation on HP Precision Architecture computers – Bergh, Keilman, et al. - 1987