z-logo
open-access-imgOpen Access
Exploring latency-power tradeoffs in deep nonvolatile memory hierarchies
Author(s) -
Doe Hyun Yoon,
Tobin Gonzalez,
Parthasarathy Ranganathan,
Robert Schreiber
Publication year - 2012
Publication title -
citeseer x (the pennsylvania state university)
Language(s) - English
Resource type - Conference proceedings
DOI - 10.1145/2212908.2212923
Subject(s) - computer science , memory hierarchy , cache , cache pollution , non volatile memory , cache only memory architecture , dram , latency (audio) , semiconductor memory , parallel computing , non uniform memory access , cpu cache , interleaved memory , cache coloring , computer architecture , embedded system , cache algorithms , memory management , computer hardware , telecommunications
To handle the demand for very large main memory, we are likely to use nonvolatile memory (NVM) as main memory. NVM main memory will have higher latency than DRAM. To cope with this, we advocate a less-deep cache hierarchy based on a large last-level, NVM cache. We develop a model that estimates average memory access time and power of a cache hierarchy. The model is based on captured application behavior, an analytical power and performance model, and circuit-level memory models such as CACTI and NVSim. We use the model to explore the cache hierarchy design space and present latency-power tradeoffs for memory intensive SPEC benchmarks and scientific applications. The results indicate that a flattened hierarchy lowers power and improves average memory access time.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom