Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Dynamic Dependency Analysis of Ordinary Programs 1 Todd M. Austin and Gurindar S. Sohi
 

Summary: Dynamic Dependency Analysis of Ordinary Programs 1
Todd M. Austin and Gurindar S. Sohi
Computer Sciences Department
University of Wisconsin-Madison
1210 W. Dayton Street
Madison, WI 53706
faustin sohig@cs.wisc.edu
Abstract
A quantitative analysis of program execution is essential
to the computer architecture design process. With the cur-
rent trend in architecture of enhancing the performance of
uniprocessors by exploiting ne-grain parallelism, rst-order
metrics of program execution, such as operation frequencies,
are not su cient characterizing the exact nature of depen-
dencies between operations is essential.
This paper presents a methodology for constructing the
dynamic execution graph that characterizes the execution of
an ordinary program (an application program written in an
imperative language such as C or FORTRAN) from a serial
execution trace of the program. Itthen uses the methodology

  

Source: Austin, Todd M. - Department of Electrical Engineering and Computer Science, University of Michigan

 

Collections: Engineering; Computer Technologies and Information Sciences