Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Tree-Traversal Orientation Analysis Kevin Andrusky, Stephen Curial and Jose Nelson Amaral
 

Summary: Tree-Traversal Orientation Analysis
Kevin Andrusky, Stephen Curial and Jos┤e Nelson Amaral
Department of Computing Science
University of Alberta
Edmonton, Alberta, Canada
{andrusky, curial, amaral}@cs.ualberta.ca
Abstract. This paper presents a profiling-based analysis to determine
the traversal orientation of link-based tree data structures. Given the
very-high memory-hierarchy latencies in modern computers, once the
compiler has identified that a pointer-based data structure represents
a tree, it would be useful to determine the predominant orientation of
traversal for the tree. Optimizing compilers can implement the static
shape analysis proposed by Ghiya and Hendren to determine if a linked
data structure is a tree [10]. However no techniques have been reported
to enable an optimizing compiler to determine the predominant traversal
orientation of a tree. This paper describes an analysis that collects data
during an instrumented run to determine if the traversal is predominantly
breadth-first or depth-first. The analysis determined, with high accuracy,
the predominant orientation of traversal of trees in programs written by
us as well as in the Olden benchmark suite. This profile-based analysis is

  

Source: Amaral, JosÚ Nelson - Department of Computing Science, University of Alberta

 

Collections: Computer Technologies and Information Sciences