Publication

Near-Optimal Cache Block Placement with Reactive Nonuniform Cache Architectures

Anastasia Ailamaki, Babak Falsafi
2010
Journal Articles

Abstract

The growing core counts and caches of modern processors result in data access latency becoming a function of the data's physical location in the cache. Thus, the placement of cache blocks determines the cache's performance. Reactive nonuniform cache architectures (R-NUCA) achieve near-optimal cache block placement by classifying blocks online and placing data close to the cores that use them.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Near-Optimal Cache Block Placement with Reactive Nonuniform Cache Architectures

Chat with Graph Search

Intermediate Address Space: virtual memory optimization of heterogeneous architectures for cache-resident workloads

Highly Parallel RTL Simulation

uKharon: A Membership Service for Microsecond Applications