This paper is an analysis of program address trace data in a demand-paged computer system with a three-level staging hierarchy. Our primary objective is to explore the data both graphically and numerically, using methods that may be useful when other data traces become available. In addition, plausible point-process type models are fit to the data. Such an approach, combining data-analytic procedures with probability modeling, should prove useful in understanding program behavior and thus will aid in the rational design of complex computer systems
We call a data structure overlaid, if a node in the structure includes links for multiple data struc...
We describe our experiences with an exception anal-ysis tool for Standard ML. Information about exce...
Current processors employ aggressive prediction mechanisms to improve performance and reduce power. ...
Based on a statistical analysis of actual computer program address traces, some results are presente...
Analysis techniques, such as control flow, data flow, and control dependence, are used for a variet...
One of the most challenging problems facing today's software engineer is to understand and modify di...
Trace-driven simulation is an important aid in performance analysis of computer systems. Capturing a...
Error propagation analysis is a consolidated practice to gain insights into error modes and effects ...
This thesis consider exceptions from a different (maybe unique) perspective. Not talking about how a...
We propose a synthetic address trace generation model which combine the accuracy advantage of trace-...
One of the most challenging problems facing today's software engineer is to understand and modify di...
Traditionally, requirement capturing primary concerns about the normal behaviors of a system and lea...
This thesis examines three problems arising in the construction of an ambitious optimizing compiler ...
This thesis introduces a methodology for determining program locations where faults can easily hide....
\u3cp\u3eSystem designers make trade-offs between metrics of interest such as execution time, functi...
We call a data structure overlaid, if a node in the structure includes links for multiple data struc...
We describe our experiences with an exception anal-ysis tool for Standard ML. Information about exce...
Current processors employ aggressive prediction mechanisms to improve performance and reduce power. ...
Based on a statistical analysis of actual computer program address traces, some results are presente...
Analysis techniques, such as control flow, data flow, and control dependence, are used for a variet...
One of the most challenging problems facing today's software engineer is to understand and modify di...
Trace-driven simulation is an important aid in performance analysis of computer systems. Capturing a...
Error propagation analysis is a consolidated practice to gain insights into error modes and effects ...
This thesis consider exceptions from a different (maybe unique) perspective. Not talking about how a...
We propose a synthetic address trace generation model which combine the accuracy advantage of trace-...
One of the most challenging problems facing today's software engineer is to understand and modify di...
Traditionally, requirement capturing primary concerns about the normal behaviors of a system and lea...
This thesis examines three problems arising in the construction of an ambitious optimizing compiler ...
This thesis introduces a methodology for determining program locations where faults can easily hide....
\u3cp\u3eSystem designers make trade-offs between metrics of interest such as execution time, functi...
We call a data structure overlaid, if a node in the structure includes links for multiple data struc...
We describe our experiences with an exception anal-ysis tool for Standard ML. Information about exce...
Current processors employ aggressive prediction mechanisms to improve performance and reduce power. ...