Systems for Late Code Modification

Wall, David

doi:10.1007/978-1-4471-3501-2_15

Cited by 39 publications

(10 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Each program and operating system was instrumented with epoxie [10, 37], which is a program that rewrites assembly code to record a complete address trace Assertion Implication 1. The operating system has less instruction and data locality…”

Section: Trace Overviewmentioning

confidence: 99%

The impact of operating system structure on memory system performance

Chen¹,

Bershad²

1993

Proceedings of the Fourteenth ACM Symposium on Operating Systems Principles - SOSP '93

112

View full text Add to dashboard Cite

In this paper we evaluate the memory system behavior of two distinctly different implementations of the UNIX operating system: DEC's Ultrix, a monolithic system, and Mach 3.0 with CMU's UNIX server, a microkernel-based system. In our evaluation we use combined system and user memory reference traces of thirteen industry-standard workloads.We show that the microkernel-based system executes substantially more non-idle system instructions for an equivalent workload than the monolithic system. Furthermore, the average instruction for programs running on Mach has a higher cost, in terms of memory cycles per instruction, than on Ultrix. In the context of our traces, we explore a number of popular assertions about the memory system behavior of modern operating systems, paying special attention to the effect that Mach's microkernel architecture has on system performance. Our results indicate that many, but not all of the assertions are true, and that a few, while true, have only negligible impact on real system performance.

show abstract

Section: Trace Overviewmentioning

confidence: 99%

The impact of operating system structure on memory system performance

Chen¹,

Bershad²

1993

Proceedings of the Fourteenth ACM Symposium on Operating Systems Principles - SOSP '93

112

View full text Add to dashboard Cite

show abstract

“…An alternative approach is to instrument the application code prior to execution, for example, during compilation [17], at the assembly language or object code [18] levels, at link time [19], or by rewriting the final executable [20,21]. Using controlflow analysis the quantity of information generated at trace capture time can be reduced substantially.…”

Section: Code Annotationmentioning

confidence: 99%

Performance prediction of paging workloads using lightweight tracing

Burton

2006

Future Generation Computer Systems

View full text Add to dashboard Cite

A trace of a workload's system calls can be obtained with minimal interference, and can be used as to drive repeatable experiments to evaluate system configuration alternatives. Replaying system call traces alone sometimes leads to inaccurate predictions because paging, and access to memory-mapped files, are not modelled.This paper extends tracing to handle such workloads. At trace capture time, the application's page-level virtual memory access is monitored. The size of the page access trace, and capture overheads, are reduced by excluding recently-accessed pages. This leads to a slight loss of accuracy. Using a suite of memory-intensive applications, we evaluate the capture overhead and measure the predictive accuracy of the approach.

show abstract

“…For memory references we have to solve the aliasing problem [26,12]: decide whether two memory references access the same location. We have to prove that two references always point to the same location (must-alias) or must show that they never refer to the same location.…”

Section: Introductionmentioning

confidence: 99%

Data dependence analysis of assembly code

Amme

Braun

Zehendner

et al.

Proceedings. 1998 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.98EX192)

View full text Add to dashboard Cite

Determination of data dependences is a task typically performed with highlevel language source code in today's optimizing and parallelizing compilers. Very little work has been done in the field of data dependence analysis on assembly language code, but this area will be of growing importance, e.g. for increasing Instruction Level Parallelism. A central element of a data dependence analysis in this case is a method for memory reference disambiguation which decides whether two memory operations may/must access the same memory location. In this paper we describe a new approach for determination of data dependences in assembly code. Our method is based on a sophisticated algorithm for symbolic value propagation, and it can derive value-based dependences between memory operations instead of just address-based dependences. We have integrated our method into the SALTO system for assembly language optimization. Experimental results show that our approach greatly improves the accuracy of the dependence analysis in many cases.

show abstract

Systems for Late Code Modification

Cited by 39 publications

References 9 publications

The impact of operating system structure on memory system performance

The impact of operating system structure on memory system performance

Performance prediction of paging workloads using lightweight tracing

Data dependence analysis of assembly code

Contact Info

Product

Resources

About