|Title||:||SFFMap: Set-First Fill Mapping for Energy Efficient Pipelined Data Caches|
|Speaker||:||Pritam Majumder (IITM)|
|Details||:||Tue, 26 May, 2015 11:00 AM @ BSB 361|
|Abstract:||:||The block organization of contemporary highly associative modern data caches needs to be reconsidered. Because the conventional mapping in high-associative data caches is unable to exploit spatial locality in accesses beyond the block level; even though there may be 8, 16, or, even more blocks present in each set. On the other hand, because of parallel access of tag and data array in the data cache, the per-access energy wastage increases with the increase in associativity.
Here in this work we introduce a new block organization, namely, Set-First Fill Mapping (SFFMap), for data caches to exploit spatial locality in the data cache accesses at set level granularity. The spatial locality in accesses are transformed into savings in dynamic energy with the help of a set-buffer, realized using existing pipeline registers in the data cache itself. We introduce two supporting techniques, namely, Multi-Banked and Low-Power SFFMap to improve dynamic and leakage energy savings further for data caches. Overall, we achieve 45% of the total on-chip cache energy savings with the help of our technique.