Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Recursive Data Structure Profiling Easwaran Raman David I. August
 

Summary: Recursive Data Structure Profiling
Easwaran Raman David I. August
Department of Computer Science
Princeton University
Princeton, NJ 08544
{eraman,august}@princeton.edu
ABSTRACT
As the processor-memory performance gap increases, so does the
need for aggressive data structure optimizations to reduce memory
access latencies. Such optimizations require a better understand-
ing of the memory behavior of programs. We propose a profiling
technique called Recursive Data Structure Profiling to help better
understand the memory access behavior of programs that use re-
cursive data structures (RDS) such as lists, trees, etc. An RDS
profile captures the runtime behavior of the individual instances of
recursive data structures. RDS profiling differs from other memory
profiling techniques in its ability to aggregate information pertain-
ing to an entire data structure instance, rather than merely capturing
the behavior of individual loads and stores, thereby giving a more
global view of a program's memory accesses.

  

Source: August, David - Department of Computer Science, Princeton University

 

Collections: Computer Technologies and Information Sciences