Is your memory hierarchy stop** your microprocessor from performing at the high level it
should be? Memory Systems: Cache, DRAM, Disk shows you how to resolve this problem …

Profiling can accurately analyze program behavior for select data inputs. We show that
profiling can also predict program locality for inputs other than profiled ones. Here locality is …

As computer memory hierarchy becomes adaptive, its performance increasingly depends on
forecasting the dynamic program locality. This paper presents a method that predicts the …

With the rapid improvement of processor speed, performance of the memory hierarchy has
become the principal bottleneck for most applications. A number of compiler transformations …

On modern computer systems, the memory performance of an application depends on its
locality. For a single execution, locality-correlated measures like average miss rate or …

The widespread use of object-oriented languages and Internet security concerns are just the
beginning. Add embedded systems, multiple memory banks, highly pipelined units …

We present a rule-based framework for the development of scalable parallel high
performance simulations for a broad class of scientific applications (with particular emphasis …

While the memory of most machines is organized as a hierarchy, program data are laid out
in a uniform address space. This paper defines a model of reference affinity, which …

Many important applications, such as those using sparse data structures, have memory
reference patterns that are unknown at compile-time. Prior work has developed run-time …

Sparse triangular solve (SpTRSV) is one of the most important kernels in many real-world
applications. Currently, much research on parallel SpTRSV focuses on level-set construction …